BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
query
Google query

Tag #query

3450 papers:

CCCC-2020-ChenKKVH #automation #database #performance
Improving database query performance with automatic fusion (HC, AK, BK, CV, LJH), pp. 63–73.
CSLCSL-2020-AngluinAF #ambiguity #automaton #predict
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries (DA, TA, DF), p. 17.
CSLCSL-2020-VortmeierZ #complexity
Dynamic Complexity of Parity Exists Queries (NV, TZ), p. 16.
SANERSANER-2019-ChaparroFSM #debugging #detection
Reformulating Queries for Duplicate Bug Report Detection (OC, JMF, US, AM), pp. 218–229.
FMFM-2019-BrenasES #database #reasoning
Reasoning Formally About Database Queries and Updates (JHB, RE, MS), pp. 556–572.
HaskellHaskell-2019-Ekblad #database #monad #relational
Scoping monadic relational database queries (AE), pp. 114–124.
FDGFDG-2019-ZhangS #game studies #natural language
Retrieving videogame moments with natural language queries (XZ, AMS), p. 7.
CIKMCIKM-2019-AbualsaudS
Patterns of Search Result Examination: Query to First Action (MA, MDS), pp. 1833–1842.
CIKMCIKM-2019-BhutaniJ #knowledge base #online
Online Schemaless Querying of Heterogeneous Open Knowledge Bases (NB, HVJ), pp. 699–708.
CIKMCIKM-2019-BhutaniZJ #composition #knowledge base #learning
Learning to Answer Complex Questions over Knowledge Bases with Query Composition (NB, XZ, HVJ), pp. 739–748.
CIKMCIKM-2019-BremenDJ #logic programming #probability
Ontology-Mediated Queries over Probabilistic Data via Probabilistic Logic Programming (TvB, AD, JCJ), pp. 2437–2440.
CIKMCIKM-2019-CaoDGMT #named #network
BeLink: Querying Networks of Facts, Statements and Beliefs (TDC, LD, FG, IM, XT), pp. 2941–2944.
CIKMCIKM-2019-ChenTL #learning #social
Query Embedding Learning for Context-based Social Search (YCC, YCT, CTL), pp. 2441–2444.
CIKMCIKM-2019-ChenWCKQ #dataset #generative #towards
Towards More Usable Dataset Search: From Query Characterization to Snippet Generation (JC, XW, GC0, EK, YQ), pp. 2445–2448.
CIKMCIKM-2019-KoLLLY #on the
On VR Spatial Query for Dual Entangled Worlds (SHK, YCL, HCL, WCL, DNY), pp. 9–18.
CIKMCIKM-2019-ManchandaSK #e-commerce
Intent Term Weighting in E-commerce Queries (SM, MS, GK), pp. 2345–2348.
CIKMCIKM-2019-RekatsinasDP #adaptation #crowdsourcing #named #performance
CRUX: Adaptive Querying for Efficient Crowdsourced Data Extraction (TR, AD, AGP), pp. 841–850.
CIKMCIKM-2019-RomeroRPPSW
Commonsense Properties from Query Logs and Question Answering Forums (JR, SR, KP, JZP, AS, GW), pp. 1411–1420.
CIKMCIKM-2019-YafayA #performance
Caching Scores for Faster Query Processing with Dynamic Pruning in Search Engines (EY, ISA), pp. 2457–2460.
CIKMCIKM-2019-YangTDZLL #framework #semantics
An Active and Deep Semantic Matching Framework for Query Rewrite in E-Commercial Search Engine (YY, JT, HD, ZZ, YL, XL), pp. 309–318.
CIKMCIKM-2019-ZhaoCY #comprehension #e-commerce #learning
A Dynamic Product-aware Learning Model for E-commerce Query Intent Understanding (JZ, HC, DY), pp. 1843–1852.
ECIRECIR-p1-2019-BahrainianZMC #information retrieval #predict #topic
Predicting the Topic of Your Next Query for Just-In-Time IR (SAB, FZ, IM, FC), pp. 261–275.
ECIRECIR-p1-2019-DaltonNDA #topic
Local and Global Query Expansion for Hierarchical Complex Topics (JD0, SN, LD, JA), pp. 290–303.
ECIRECIR-p1-2019-MalliaSS #case study
An Experimental Study of Index Compression and DAAT Query Processing Methods (AM, MS, TS), pp. 353–368.
ECIRECIR-p1-2019-SalehP #information retrieval
Term Selection for Query Expansion in Medical Cross-Lingual Information Retrieval (SS, PP), pp. 507–522.
ECIRECIR-p2-2019-ImaniVMS #ad hoc #axiom #order #retrieval
An Axiomatic Study of Query Terms Order in Ad-Hoc Retrieval (AI, AV, AM, AS), pp. 196–202.
ECIRECIR-p2-2019-ImaniVMS19a #network #using #word
Deep Neural Networks for Query Expansion Using Word Embeddings (AI, AV, AM, AS), pp. 203–210.
ECIRECIR-p2-2019-Russell-RoseCK #approach
Rethinking 'Advanced Search': A New Approach to Complex Query Formulation (TRR, JC, UK), pp. 236–240.
ECIRECIR-p2-2019-Steiner #information retrieval
The Influence of Backstories on Queries with Varying Levels of Intent in Task-Based Specialised Information Retrieval (MS), pp. 375–379.
ECIRECIR-p2-2019-SyedIGSV #detection #induction #learning #natural language
Inductive Transfer Learning for Detection of Well-Formed Natural Language Search Queries (BS, VI, MG0, MS0, VV), pp. 45–52.
ECIRECIR-p2-2019-YafayA #on the
On the Impact of Storing Query Frequency History for Search Engine Result Caching (EY, ISA), pp. 155–162.
ICMLICML-2019-0002WF #clustering #complexity #kernel
Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering (TY0, DPW, MF), pp. 7055–7063.
ICMLICML-2019-FahrbachMZ #adaptation #complexity
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity (MF, VSM, MZ), pp. 1833–1842.
ICMLICML-2019-FischerBDGZV #logic #named #network
DL2: Training and Querying Neural Networks with Logic (MF, MB, DDC, TG, CZ, MTV), pp. 1931–1941.
KDDKDD-2019-LiuGNWXLLX #comprehension #concept #documentation #mining
A User-Centered Concept Mining System for Query and Document Understanding at Tencent (BL, WG, DN, CW, SX, JL, KL, YX), pp. 1831–1841.
MoDELSMoDELS-2019-BurV #estimation #graph #runtime #towards
Towards WCET Estimation of Graph Queries@Run.time (MB, DV), pp. 233–238.
MoDELSMoDELS-2019-Garcia-Dominguez
Querying and Annotating Model Histories with Time-Aware Patterns (AGD, NB, JMPU, LHGP), pp. 194–204.
MoDELSMoDELS-2019-SanchezZRKP #execution #modelling #on the fly
On-the-Fly Translation and Execution of OCL-Like Queries on Simulink Models (BS0, AZ, HHR, DSK, RFP), pp. 205–215.
OOPSLAOOPSLA-2019-SalvaneschiKSHE #distributed #privacy
Language-integrated privacy-aware distributed queries (GS, MK, DS, PH, SE, MM), p. 30.
SLESLE-2019-SeiferHLLS #empirical #graph #java #open source
Empirical study on the usage of graph query languages in open source Java projects (PS, JH, ML, RL, SS), pp. 152–166.
CGOCGO-2019-TianQ0LR #manycore #sequence
Transforming Query Sequences for High-Throughput B+ Tree Processing on Many-Core Processors (RT, JQ, ZZ0, XL0, BR), pp. 96–108.
JCDLJCDL-2018-FafaliosKN #documentation #ranking #semantics
Ranking Archived Documents for Structured Queries on Semantic Layers (PF, VK, WN), pp. 155–164.
JCDLJCDL-2018-WillkommSSSB #algebra #corpus
A Query Algebra for Temporal Text Corpora (JW, CSP, MS, MS, KB), pp. 183–192.
ICSMEICSME-2018-RahmanR #code search #crowdsourcing #data analysis #effectiveness #using
Effective Reformulation of Query for Code Search Using Crowdsourced Knowledge and Extra-Large Data Analytics (MMR0, CKR), pp. 473–484.
ICSMEICSME-2018-RahmanR18a #api #code search #crowdsourcing #data analysis #named #using
NLP2API: Query Reformulation for Code Search Using Crowdsourced Knowledge and Extra-Large Data Analytics (MMR0, CKR), p. 714.
CIKMCIKM-2018-AdigaCKMRRS #modelling #network #probability #using
Inferring Probabilistic Contagion Models Over Networks Using Active Queries (AA, VCM, CJK, MVM, SSR, DJR, RES), pp. 377–386.
CIKMCIKM-2018-CeriCGKMNP
Demonstration of GenoMetric Query Language (SC, AC, AG, AK, MM, LN, PP), pp. 1887–1890.
CIKMCIKM-2018-Elghandour0OV #incremental #scalability
Incremental Techniques for Large-Scale Dynamic Query Processing (IE, AK0, DO, SV), pp. 2297–2298.
CIKMCIKM-2018-GaikwadMA #data type #performance
Data Structure for Efficient Line of Sight Queries (SG, MM, DCA), pp. 1535–1538.
CIKMCIKM-2018-HashemiWKZC #user satisfaction #using
Measuring User Satisfaction on Smart Speaker Intelligent Assistants Using Intent Sensitive Query Embeddings (SHH, KW, AEK, IZ, PAC), pp. 1183–1192.
CIKMCIKM-2018-JiangW #named #network
RIN: Reformulation Inference Network for Context-Aware Query Suggestion (JYJ, WW0), pp. 197–206.
CIKMCIKM-2018-KalayciXRKC #named #ontology
Ontop-temporal: A Tool for Ontology-based Query Answering over Temporal Data (EGK, GX0, VR, TEK, DC), pp. 1927–1930.
CIKMCIKM-2018-LiuPZJH #generative #keyword #natural language #problem
Generating Keyword Queries for Natural Language Queries to Alleviate Lexical Chasm Problem (XL, SP, QZ0, YGJ, XH), pp. 1163–1172.
CIKMCIKM-2018-LuccheseN0TV #effectiveness #performance #web
Efficient and Effective Query Expansion for Web Search (CL, FMN, RP0, RT, RV), pp. 1551–1554.
CIKMCIKM-2018-NagarkarC #execution #named #performance #set
PSLSH: An Index Structure for Efficient Execution of Set Queries in High-Dimensional Spaces (PN, KSC), pp. 477–486.
CIKMCIKM-2018-NobariAHN #comprehension #identification
Query Understanding via Entity Attribute Identification (ADN, AA, FH, MN), pp. 1759–1762.
CIKMCIKM-2018-PathakGNK #named #retrieval
AQuPR: Attention based Query Passage Retrieval (PP, MDG, NN, HK), pp. 1495–1498.
CIKMCIKM-2018-ScellsZ #comprehension #named #visualisation
searchrefiner: A Query Visualisation and Understanding Tool for Systematic Reviews (HS, GZ), pp. 1939–1942.
CIKMCIKM-2018-ShenKBQM #clustering #email #learning #multi #ranking
Multi-Task Learning for Email Search Ranking with Auxiliary Query Clustering (JS, MK, MB, ZQ, DM), pp. 2127–2135.
CIKMCIKM-2018-TzouramanisTPM
The Range Skyline Query (TT, ET, ANP, YM), pp. 47–56.
CIKMCIKM-2018-YangGC #comprehension #e-commerce #perspective
Query Tracking for E-commerce Conversational Search: A Machine Comprehension Perspective (YY, YG, XC), pp. 1755–1758.
ECIRECIR-2018-DingZGB #generative
Generating High-Quality Query Suggestion Candidates for Task-Based Search (HD, SZ0, DG, KB), pp. 625–631.
ICMLICML-2018-IlyasEAL #black box
Black-box Adversarial Attacks with Limited Queries and Information (AI, LE, AA, JL), pp. 2142–2151.
ICMLICML-2018-WeissGY #automaton #network #using
Extracting Automata from Recurrent Neural Networks Using Queries and Counterexamples (GW, YG, EY), pp. 5244–5253.
ICPRICPR-2018-UekiHKK #fine-grained #retrieval #using #video
Fine-grained Video Retrieval using Query Phrases - Waseda_Meisei TRECVID 2017 AVS System - (KU, KH, KK, TK), pp. 3322–3327.
KDDKDD-2018-BaiOZFRST #n-gram #scalability
Scalable Query N-Gram Embedding for Improving Matching and Relevance in Sponsored Search (XB0, EO, YZ, AF, AR, RS, AT), pp. 52–61.
KDDKDD-2018-LeeGZ #generative #network
Rare Query Expansion Through Generative Adversarial Networks in Search Advertising (MCL, BG, RZ), pp. 500–508.
KDDKDD-2018-RaoTL #comprehension #framework #learning #multi #network #platform
Multi-Task Learning with Neural Networks for Voice Query Understanding on an Entertainment Platform (JR, FT, JL), pp. 636–645.
KDDKDD-2018-SunZZGH #analysis #online
Exploring the Urban Region-of-Interest through the Analysis of Online Map Search Queries (YS, HZ, FZ, JG, QH), pp. 2269–2278.
ICMTICMT-2018-DanielSC #model transformation #scalability
Scalable Queries and Model Transformations with the Mogwaï Tool (GD, GS, JC), pp. 175–183.
ICMTICMT-2018-Pankowski #database #interface #ontology
Schema Transformations and Query Rewriting in Ontological Databases with a Faceted Interface (TP), pp. 76–91.
OOPSLAOOPSLA-2018-WangCB #reasoning #relational
Speeding up symbolic reasoning for relational queries (CW, AC, RB), p. 25.
ESEC-FSEESEC-FSE-2018-0001R #debugging #locality
Improving IR-based bug localization with context-aware query reformulation (MMR0, CKR), pp. 621–632.
ICSE-2018-CasteleinASPD #generative #search-based #sql #testing
Search-based test data generation for SQL queries (JC, MFA, MS, AP, AvD), pp. 1120–1230.
ICSE-2018-SirresBKLKKT #code search #performance
Augmenting and structuring user queries to support efficient free-form code search (RS, TFB, DK0, DL0, JK, KK, YLT), p. 945.
CASECASE-2018-WimmerM #modelling
From AutomationML to AutomationQL: A By-Example Query Language for CPPS Engineering Models (MW, AM), pp. 1394–1399.
FASEFASE-2018-BurSVV #cyber-physical #distributed #graph #monitoring #runtime
Distributed Graph Queries for Runtime Monitoring of Cyber-Physical Systems (MB, GS, AV0, DV), pp. 111–128.
CSLCSL-2018-BonchiSS #visual notation
Graphical Conjunctive Queries (FB, JS, PS), p. 23.
JCDLJCDL-2017-FafaliosHKN #semantics #web
Building and Querying Semantic Layers for Web Archives (PF, HH, VK, WN), pp. 11–20.
ICSMEICSME-2017-ChaparroFM #behaviour #debugging #locality #using
Using Observed Behavior to Reformulate Queries during Text Retrieval-based Bug Localization (OC, JMF, AM), pp. 376–387.
SANERSANER-2017-AndersonH #php
Query Construction Patterns in PHP (DA, MH0), pp. 452–456.
SANERSANER-2017-BartmanNCM #named #source code
srcQL: A syntax-aware query language for source code (BB, CDN, MLC, JIM), pp. 467–471.
SCAMSCAM-2017-Anderson0 #analysis #php #sql
Supporting Analysis of SQL Queries in PHP AiR (DA, MH0), pp. 153–158.
SCAMSCAM-2017-NagyC #detection #embedded #java #smell #sql
A Static Code Smell Detector for SQL Queries Embedded in Java Code (CN0, AC), pp. 147–152.
ICFP-2017-AuerbachHMSS #case study #compilation #coq #experience #prototype #using
Prototyping a query compiler using Coq (experience report) (JSA, MH, LM, AS, JS), p. 15.
CIKMCIKM-2017-ArmanACA #3d #database #named #scalability
VizQ: A System for Scalable Processing of Visibility Queries in 3D Spatial Databases (AA, MEA, FMC, KA), pp. 2447–2450.
CIKMCIKM-2017-BastB #named #performance
QLever: A Query Engine for Efficient SPARQL+Text Search (HB, BB), pp. 647–656.
CIKMCIKM-2017-Chekol #evaluation #probability #scalability
Scaling Probabilistic Temporal Query Evaluation (MWC), pp. 697–706.
CIKMCIKM-2017-DehghaniRAF #learning
Learning to Attend, Copy, and Generate for Session-Based Query Suggestion (MD0, SR, EA, PF), pp. 1747–1756.
CIKMCIKM-2017-GaurBB #graph #using
Tracking the Impact of Fact Deletions on Knowledge Graph Queries using Provenance Polynomials (GG, SJB, AB0), pp. 2079–2082.
CIKMCIKM-2017-GroverAV #latency #reduction
Latency Reduction via Decision Tree Based Query Construction (AG, DA, GV), pp. 1399–1407.
CIKMCIKM-2017-Han0YZ #approach #assembly #graph #keyword #rdf
Keyword Search on RDF Graphs - A Query Graph Assembly Approach (SH, LZ0, JXY, DZ0), pp. 227–236.
CIKMCIKM-2017-LiaoSSLGL #ambiguity #modelling #web
Deep Context Modeling for Web Query Entity Disambiguation (ZL, XS, YS, SL, JG, CL), pp. 1757–1765.
CIKMCIKM-2017-LuoHCYK #named
SEQ: Example-based Query for Spatial Objects (SL, JH, RC, JY, BK), pp. 2179–2182.
CIKMCIKM-2017-MansouriZRO0 #ambiguity #learning #web
Learning Temporal Ambiguity in Web Search Queries (BM, MSZ, MR, FO, RC0), pp. 2191–2194.
CIKMCIKM-2017-MehrotraY #learning #using
Task Embeddings: Learning Query Embeddings using Task Context (RM, EY), pp. 2199–2202.
CIKMCIKM-2017-SunX0L #interactive #keyword #semantics
Interactive Spatial Keyword Querying with Semantics (JS, JX, KZ0, CL), pp. 1727–1736.
CIKMCIKM-2017-XiongLCH #documentation #named #ranking
JointSem: Combining Query Entity Linking and Entity based Document Ranking (CX, ZL0, JC, EHH), pp. 2391–2394.
CIKMCIKM-2017-XuG #multi
Query and Animate Multi-attribute Trajectory Data (JX, RHG), pp. 2551–2554.
ECIRECIR-2017-AlkhawaldehPJY #clustering #information retrieval #learning #named
LTRo: Learning to Route Queries in Clustered P2P IR (RSA, DP0, JMJ, FY), pp. 513–519.
ECIRECIR-2017-ArguelloA0 #performance #predict #using
Using Query Performance Predictors to Reduce Spoken Queries (JA, SA, FD0), pp. 27–39.
ECIRECIR-2017-BampoulidisPLBH #evaluation #online #question
Does Online Evaluation Correspond to Offline Evaluation in Query Auto Completion? (AB, JRMP, ML, JB, AH), pp. 713–719.
ECIRECIR-2017-BaruaP #classification #using
Named Entity Classification Using Search Engine's Query Suggestions (JB, DP), pp. 612–618.
ECIRECIR-2017-ChifuDMM #predict
Human-Based Query Difficulty Prediction (AGC, SD, SM, JM), pp. 343–356.
ECIRECIR-2017-DadashkarimiSTF #documentation #pseudo
Dimension Projection Among Languages Based on Pseudo-Relevant Documents for Query Translation (JD, MSS, AT, HF, AS), pp. 493–499.
ECIRECIR-2017-HasibiBB #effectiveness #performance
Entity Linking in Queries: Efficiency vs. Effectiveness (FH, KB, SEB), pp. 40–53.
ECIRECIR-2017-LiR #correlation #question #topic
Do Topic Shift and Query Reformulation Patterns Correlate in Academic Search? (XL0, MdR), pp. 146–159.
ICMLICML-2017-MouLLJ #distributed #execution #natural language #symbolic computation
Coupling Distributed and Symbolic Execution for Natural Language Queries (LM, ZL, HL0, ZJ), pp. 2518–2526.
OOPSLAOOPSLA-2017-Yaghmazadeh0DD #named #natural language #synthesis
SQLizer: query synthesis from natural language (NY, YW0, ID, TD), p. 26.
PEPMPEPM-2017-KatsushimaK
Language-integrated query with ordering, grouping and outer joins (poster paper) (TK, OK), pp. 123–124.
PLDIPLDI-2017-ChuWCS #named #proving #semantics #sql
HoTTSQL: proving query rewrites with univalent SQL semantics (SC, KW, AC, DS), pp. 510–524.
PLDIPLDI-2017-MamourasRAIK #composition #evaluation #named #performance #specification #streaming
StreamQRE: modular specification and efficient evaluation of quantitative queries over streaming data (KM, MR, RA, ZGI, SK), pp. 693–708.
PLDIPLDI-2017-WangCB #sql
Synthesizing highly expressive SQL queries from input-output examples (CW, AC, RB), pp. 452–466.
ASEASE-2017-LinL0CGLLMR #interface #named #natural language
TiQi: a natural language interface for querying software project data (JL, YL, JG0, JCH, WG, WL, SL, NM, AR), pp. 973–977.
ASEASE-2017-RahmanR #concept #documentation #using
Improved query reformulation for concept location using CodeRank and document structures (MMR, CKR), pp. 428–439.
ESEC-FSEESEC-FSE-2017-GarbervetskyP0M #big data #optimisation #static analysis
Static analysis for optimizing big data queries (DG, ZP, MB0, MM, TM, EZ), pp. 932–937.
ESEC-FSEESEC-FSE-2017-SahaGMM #framework #natural language #platform
Natural language querying in SAP-ERP platform (DS, NG, SM, BM), pp. 878–883.
CSLCSL-2017-AngluinAF #learning #polynomial
Query Learning of Derived Omega-Tree Languages in Polynomial Time (DA, TA, DF), p. 21.
MSRMSR-2016-YangHL #analysis #stack overflow
From query to usable code: an analysis of stack overflow code snippets (DY, AH0, CVL), pp. 391–402.
CIKMCIKM-2016-0002AK #distance #network
Fully Dynamic Shortest-Path Distance Query Acceleration on Massive Networks (TH0, TA, KiK), pp. 1533–1542.
CIKMCIKM-2016-Balaneshinkordan #concept #graph #using
Sequential Query Expansion using Concept Graph (SB, AK), pp. 155–164.
CIKMCIKM-2016-ChenLYWLZ #graph #keyword #multi #performance
Efficient Batch Processing for Multiple Keyword Queries on Graph Data (LC, CL, XY0, BW0, JL, RZ0), pp. 1261–1270.
CIKMCIKM-2016-FoleyOA #keyword #ranking
Improving Entity Ranking for Keyword Queries (JF, BO, JA), pp. 2061–2064.
CIKMCIKM-2016-HansenLM #predict #using #web
Ensemble Learned Vaccination Uptake Prediction using Web Search Queries (NDH, CL, KM), pp. 1953–1956.
CIKMCIKM-2016-HanYYGG #mobile #sequence
Framing Mobile Information Needs: An Investigation of Hierarchical Query Sequence Structure (SH, XY, ZY, ZG, AG), pp. 2131–2136.
CIKMCIKM-2016-HeTOKYC #learning
Learning to Rewrite Queries (YH, JT, HO, CK, DY, YC), pp. 1443–1452.
CIKMCIKM-2016-Hoang-VuVF #keyword
A Unified Index for Spatio-Temporal Keyword Queries (TAHV, HTV, JF), pp. 135–144.
CIKMCIKM-2016-HuangCCZ #recommendation
KB-Enabled Query Recommendation for Long-Tail Queries (ZH0, BC, RC, YZ), pp. 2107–2112.
CIKMCIKM-2016-HuWCLF #graph #scalability
Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs (JH, XW, RC, SL, YF), pp. 1241–1250.
CIKMCIKM-2016-JiangYCZY #network #privacy #reachability
Privacy-Preserving Reachability Query Services for Massive Networks (JJ, PY, BC, ZZ, XY0), pp. 145–154.
CIKMCIKM-2016-KongA
Precision-Oriented Query Facet Extraction (WK, JA), pp. 1433–1442.
CIKMCIKM-2016-KraviGMCMPT #analysis #multi
One Query, Many Clicks: Analysis of Queries with Multiple Clicks by the Same User (EK, IG, AM, DC, YM, DP, GT), pp. 1423–1432.
CIKMCIKM-2016-KuziSK #using #word
Query Expansion Using Word Embeddings (SK, AS, OK), pp. 1929–1932.
CIKMCIKM-2016-LiCC0Y #performance
Efficient Processing of Location-Aware Group Preference Queries (ML, LC, GC, YG0, GY0), pp. 559–568.
CIKMCIKM-2016-LiCL #approximate #graph #using
Approximating Graph Pattern Queries Using Views (JL, YC0, XL), pp. 449–458.
CIKMCIKM-2016-LiPC #benchmark #metric #named #tool support
OptMark: A Toolkit for Benchmarking Query Optimizers (ZL, OP, MC), pp. 2155–2160.
CIKMCIKM-2016-LiRM #multi
Multiple Queries as Bandit Arms (CL0, PR, QM), pp. 1089–1098.
CIKMCIKM-2016-LiSCS #adaptation #effectiveness #on the #rank
On the Effectiveness of Query Weighting for Adapting Rank Learners to New Unlabelled Collections (PL, MS, MJC, FS), pp. 1413–1422.
CIKMCIKM-2016-LiuLZZMYL #detection
Detecting Promotion Campaigns in Query Auto Completion (YL, YL, KZ0, MZ0, SM, YY, HL), pp. 125–134.
CIKMCIKM-2016-MaSCYKV #distributed #network #performance
Query Answering Efficiency in Expert Networks Under Decentralized Search (LM0, MS, DC, XY, SK, MV), pp. 2119–2124.
CIKMCIKM-2016-MoshfeghiVT
Improving Search Results with Prior Similar Queries (YM, KV, PT), pp. 1985–1988.
CIKMCIKM-2016-RoukhBO #energy #named
EnerQuery: Energy-Aware Query Processing (AR, LB, CO0), pp. 2465–2468.
CIKMCIKM-2016-SinghC #aspect-oriented #using
Iterative Search using Query Aspects (MS, WBC), pp. 2037–2040.
CIKMCIKM-2016-WangWZ #distributed #graph #partial evaluation #performance #rdf #using
Efficient Distributed Regular Path Queries on RDF Graphs Using Partial Evaluation (XW0, JW, XZ), pp. 1933–1936.
CIKMCIKM-2016-YanoTT #ambiguity #topic
Quantifying Query Ambiguity with Topic Distributions (YY, YT, AT), pp. 1877–1880.
CIKMCIKM-2016-ZhuangLRE #named #optimisation
PRO: Preference-Aware Recurring Query Optimization (ZZ, CL, EAR, MYE), pp. 2191–2196.
CIKMCIKM-2016-ZucconPH #information retrieval
Query Variations and their Effect on Comparing Information Retrieval Systems (GZ, JRMP, AH), pp. 691–700.
ECIRECIR-2016-AlmasriBC #comparison #feedback #learning #pseudo
A Comparison of Deep Learning Based Query Expansion with Pseudo-Relevance Feedback and Mutual Information (MA, CB, JPC), pp. 709–715.
ECIRECIR-2016-ArguelloAD #performance #predict #using
Using Query Performance Predictors to Improve Spoken Queries (JA, SA, FD0), pp. 309–321.
ECIRECIR-2016-Balaneshinkordan #comparison #empirical #graph
An Empirical Comparison of Term Association and Knowledge Graphs for Query Expansion (SB, AK), pp. 761–767.
ECIRECIR-2016-RoySGC #documentation #ranking #segmentation
Improving Document Ranking for Long Queries with Nested Query Segmentation (RSR, AS, NG, MC), pp. 775–781.
ICPRICPR-2016-LuZJDTSX0
Smart query expansion scheme for CDVS based on illumination and key features (TL, CZ, HJ, LD, LT, JS, XX, WG0), pp. 2942–2947.
KDDKDD-2016-BorisyukKSZ #documentation #framework #learning #modelling #named
CaSMoS: A Framework for Learning Candidate Selection Models over Structured Queries and Documents (FB, KK, DS, BZ), pp. 441–450.
KDDKDD-2016-CoskunGK #network #performance #proximity
Efficient Processing of Network Proximity Queries via Chebyshev Acceleration (MC, AG, MK), pp. 1515–1524.
KDDKDD-2016-YuanYZH #approximate #difference #linear #optimisation #privacy
Convex Optimization for Linear Query Processing under Approximate Differential Privacy (GY, YY, ZZ, ZH), pp. 2005–2014.
ECOOPECOOP-2016-AvgustinovMJS #named #object-oriented #relational
QL: Object-oriented Queries on Relational Data (PA, OdM, MPJ, MS), p. 25.
PEPMPEPM-2016-BrandveinL #runtime
Removing runtime overhead for optimized object queries (JB, YAL), pp. 73–84.
PEPMPEPM-2016-SuzukiKK #performance
Finally, safely-extensible and efficient language-integrated query (KS, OK, YK), pp. 37–48.
PPDPPPDP-2016-LiuBSL #incremental
Demand-driven incremental object queries (YAL, JB, SDS, BL), pp. 228–241.
ASEASE-2016-RahmanR #automation #concept #crowdsourcing #named #using
QUICKAR: automatic query reformulation for concept location using crowdsourced knowledge (MMR, CKR), pp. 220–225.
FASEFASE-2016-CarlosST #repository #scalability #traversal
Two-Step Transformation of Model Traversal EOL Queries for Large CDO Repositories (XDC, GS, ST), pp. 141–157.
JCDLJCDL-2015-MikkonenV
Books' Interest Grading and Fiction Readers' Search Actions During Query Reformulation Intervals (AM, PV), pp. 27–36.
PODSPODS-2015-AmelootGKNS
Parallel-Correctness and Transferability for Conjunctive Queries (TJA, GG, BK, FN, TS), pp. 47–58.
PODSPODS-2015-FanGCDL #big data
Querying Big Data by Accessing Small Data (WF, FG, YC, TD, PL), pp. 173–184.
PODSPODS-2015-GrozM
Skyline Queries with Noisy Comparisons (BG, TM), pp. 185–198.
PODSPODS-2015-Kapralov #complexity #nearest neighbour #trade-off
Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search (MK), pp. 329–342.
PODSPODS-2015-KoutrisW #complexity #consistency #constraints #self
The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints (PK, JW), pp. 17–29.
PODSPODS-2015-Ullman #linear #multi
Private Multiplicative Weights Beyond Linear Queries (JU), pp. 303–312.
SIGMODSIGMOD-2015-Atre
Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins) (MA), pp. 1793–1808.
SIGMODSIGMOD-2015-BergmanMNT
Query-Oriented Data Cleaning with Oracles (MB, TM, SN, WCT), pp. 1199–1214.
SIGMODSIGMOD-2015-ChenGLJCZ #metric #nondeterminism
Indexing Metric Uncertain Data for Range Queries (LC, YG, XL, CSJ, GC, BZ), pp. 951–965.
SIGMODSIGMOD-2015-ChuBS #database #evaluation #parallel #performance #theory and practice
From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System (SC, MB, DS), pp. 63–78.
SIGMODSIGMOD-2015-GuoCC #algorithm #keyword #performance
Efficient Algorithms for Answering the m-Closest Keywords Query (TG, XC, GC), pp. 405–418.
SIGMODSIGMOD-2015-GuoZLTB
Location-Aware Pub/Sub System: When Continuous Moving Queries Meet Dynamic Event Streams (LG, DZ, GL, KLT, ZB), pp. 843–857.
SIGMODSIGMOD-2015-HangKD #data access #named
ENKI: Access Control for Encrypted Query Processing (IH, FK, ED), pp. 183–196.
SIGMODSIGMOD-2015-JiZJNHF #data type #execution #quality
Quality-Driven Continuous Query Execution over Out-of-Order Data Streams (YJ, HZ, ZJ, AN, GH, CF), pp. 889–894.
SIGMODSIGMOD-2015-MeneghettiMCC #evaluation
Output-sensitive Evaluation of Prioritized Skyline Queries (NM, DM, PC, JC), pp. 1955–1967.
SIGMODSIGMOD-2015-PapailiouTKK #adaptation
Graph-Aware, Workload-Adaptive SPARQL Query Caching (NP, DT, PK, NK), pp. 1777–1792.
SIGMODSIGMOD-2015-PengW #probability
k-Hit Query: Top-k Query with Probabilistic Utility Function (PP, RCWW), pp. 577–592.
SIGMODSIGMOD-2015-PerelmanR #compilation #named #worst-case
DunceCap: Compiling Worst-Case Optimal Query Plans (AP, CR), pp. 2075–2076.
SIGMODSIGMOD-2015-PsallidasDCC #named
S4: Top-k Spreadsheet-Style Search for Query Discovery (FP, BD, KC, SC), pp. 2001–2016.
SIGMODSIGMOD-2015-RazniewskiKNS #database #identification
Identifying the Extent of Completeness of Query Answers over Partially Complete Databases (SR, FK, WN, DS), pp. 561–576.
SIGMODSIGMOD-2015-ScheibliDB #3d #distributed #interactive #named #visualisation
QE3D: Interactive Visualization and Exploration of Complex, Distributed Query Plans (DS, CD, AB), pp. 877–881.
SIGMODSIGMOD-2015-TrummerK #algorithm #incremental #multi #optimisation
An Incremental Anytime Algorithm for Multi-Objective Query Optimization (IT, CK), pp. 1941–1953.
SIGMODSIGMOD-2015-TuR #named #using
DunceCap: Query Plans Using Generalized Hypertree Decompositions (ST, CR), pp. 2077–2078.
SIGMODSIGMOD-2015-UlrichG #compilation
The Flatter, the Better: Query Compilation Based on the Flattening Transformation (AU, TG), pp. 1421–1426.
SIGMODSIGMOD-2015-YangWWW #approximate #performance #string
Local Filtering: Improving the Performance of Approximate Queries on String Collections (XY, YW, BW, WW), pp. 377–392.
TPDLTPDL-2015-DulischKS #overview #retrieval #social
Query Expansion for Survey Question Retrieval in the Social Sciences (ND, AOK, PS), pp. 28–39.
VLDBVLDB-2015-AmsterdamerKM #interface #natural language
A Natural Language Interface for Querying General and Individual Knowledge (YA, AK, TM), pp. 1430–1441.
VLDBVLDB-2015-BenediktLT #constraints #data access
Querying with Access Patterns and Integrity Constraints (MB, JL, ET), pp. 690–701.
VLDBVLDB-2015-BergmanMNT #named
QOCO: A Query Oriented Data Cleaning System with Oracles (MB, TM, SN, WCT), pp. 1900–1911.
VLDBVLDB-2015-BursztynGM #performance #rdf
Reformulation-based query answering in RDF: alternatives and performance (DB, FG, IM), pp. 1888–1899.
VLDBVLDB-2015-CebiricGM #graph #rdf #summary
Query-Oriented Summarization of RDF Graphs (SC, FG, IM), pp. 2012–2023.
VLDBVLDB-2015-ConsensFKP #bisimulation #summary
S+EPPs: Construct and Explore Bisimulation Summaries, plus Optimize Navigational Queries; all on Existing SPARQL Systems (MPC, VF, SK, GP), pp. 2028–2039.
VLDBVLDB-2015-DasYZVVKGKM #database #in memory #optimisation
Query Optimization in Oracle 12c Database In-Memory (DD, JY, MZ, SRV, NV, RK, PG, JK, NM), pp. 1770–1781.
VLDBVLDB-2015-DeutchGM #datalog #source code #using
Selective Provenance for Datalog Programs Using Top-K Queries (DD, AG, YM), pp. 1394–1405.
VLDBVLDB-2015-DyresonBG #dependence
Virtual eXist-db: Liberating Hierarchical Queries from the Shackles of Access Path Dependence (CED, SSB, RG), pp. 1932–1943.
VLDBVLDB-2015-FaulknerBL
k-Regret Queries with Nonlinear Utilities (TKF, WB, AL), pp. 2098–2109.
VLDBVLDB-2015-GaoL0ZZ
Answering Why-not Questions on Reverse Top-k Queries (YG, QL, GC, BZ, LZ), pp. 738–749.
VLDBVLDB-2015-HammoudRNBS #adaptation #communication #distributed #named #rdf
DREAM: Distributed RDF Engine with Adaptive Query Planner and Minimal Communication (MH, DAR, RN, SMRB, SS), pp. 654–665.
VLDBVLDB-2015-HarbiAKM #dataset #rdf
Evaluating SPARQL Queries on Massive RDF Datasets (RH, IA, PK, NM), pp. 1848–1859.
VLDBVLDB-2015-HeWKCLYL #named
SDB: A Secure Query Processing System with Data Interoperability (ZH, WKW, BK, DWLC, RL, SMY, EL), pp. 1876–1887.
VLDBVLDB-2015-JayaramGL #graph #interactive #interface #named #visual notation
VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation (NJ, SG, CL), pp. 1940–1951.
VLDBVLDB-2015-JiangN #feedback #interactive #named #specification
SnapToQuery: Providing Interactive Feedback during Exploratory Query Specification (LJ, AN), pp. 1250–1261.
VLDBVLDB-2015-KatsarouNT #performance #scalability
Performance and Scalability of Indexed Subgraph Query Processing Methods (FK, NN, PT), pp. 1566–1577.
VLDBVLDB-2015-KhanC #graph #modelling #nondeterminism #on the
On Uncertain Graphs Modeling and Queries (AK, LC), pp. 2042–2053.
VLDBVLDB-2015-KimSHHC #morphism #rdf
Taming Subgraph Isomorphism for RDF Query Processing (JK, HS, WSH, SH, HC), pp. 1238–1249.
VLDBVLDB-2015-LeisKK0 #performance #sql
Efficient Processing of Window Functions in Analytical SQL Queries (VL, KK, AK, TN), pp. 1058–1069.
VLDBVLDB-2015-LiCM #approach #data-driven
Query From Examples: An Iterative, Data-Driven Approach to Query Construction (HL, CYC, DM), pp. 2158–2169.
VLDBVLDB-2015-MouratidisZP #rank
Maximum Rank Query (KM, JZ, HP), pp. 1554–1565.
VLDBVLDB-2015-NagarkarCB
Compressed Spatial Hierarchical Bitmap (cSHB) Indexes for Efficiently Processing Spatial Range Query Workloads (PN, KSC, AB), pp. 1382–1393.
VLDBVLDB-2015-ParkMS #pipes and filters #probability #using
Processing of Probabilistic Skyline Queries Using MapReduce (YP, JKM, KS), pp. 1406–1417.
VLDBVLDB-2015-PottiP #approximate #named #paradigm
DAQ: A New Paradigm for Approximate Query Processing (NP, JMP), pp. 898–909.
VLDBVLDB-2015-WuHYY #evaluation #performance #visualisation
Efficient Evaluation of Object-Centric Exploration Queries for Visualization (YW, BH, JY, CY), pp. 1752–1763.
VLDBVLDB-2015-WylotCG #web
A Demonstration of TripleProv: Tracking and Querying Provenance over Web Data (MW, PCM, PTG), pp. 1992–2003.
VLDBVLDB-2015-YangCLW #analysis #nearest neighbour
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis (SY, MAC, XL, WW), pp. 605–616.
ITiCSEITiCSE-2015-AhadiPBL #sql
A Quantitative Study of the Relative Difficulty for Novices of Writing Seven Different Types of SQL Queries (AA, JCP, VB, RL), pp. 201–206.
ITiCSEITiCSE-2015-Tudor #learning #optimisation #xml
Virtual Learning Laboratory about Query Optimization against XML Data (LNT), p. 348.
ICSMEICSME-2015-Balachandran #repository #scalability
Query by example in large-scale code repositories (VB), pp. 467–476.
ICSMEICSME-2015-NagyC #fault #mining #sql #stack overflow
Mining Stack Overflow for discovering error patterns in SQL queries (CN, AC), pp. 516–520.
SANERSANER-2015-JiangSPLZ #comprehension #developer #interactive #natural language
Understanding developers’ natural language queries with interactive clarification (SJ, LS, XP, ZL, WZ), pp. 13–22.
SANERSANER-2015-LuSWLD #code search #effectiveness
Query expansion via WordNet for effective code search (ML, XS, SW, DL, YD), pp. 545–549.
SANERSANER-2015-NagyMC #approach #concept #sql
Where was this SQL query executed? a static concept location approach (CN, LM, AC), pp. 580–584.
SCAMSCAM-2015-LemosPSL #code search #question #scalability #using
Can the use of types and query expansion help improve large-scale code search? (OALL, ACdP, HS, CVL), pp. 41–50.
CIAACIAA-J-2013-DebarbieuxGNSZ15 #automaton #word #xml #xpath
Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.
ICALPICALP-v1-2015-GawrychowskiMW #matrix
Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.
ICALPICALP-v1-2015-KaniewskiLW #complexity
Query Complexity in Expectation (JK, TL, RdW), pp. 761–772.
ICALPICALP-v1-2015-KannanM0 #complexity #graph
Near-Linear Query Complexity for Graph Inference (SK, CM, HZ), pp. 773–784.
CHICHI-2015-ZgraggenDFD #regular expression #sequence #visual notation
(s|qu)eries: Visual Regular Expressions for Querying and Exploring Event Sequences (EZ, SMD, DF, RD), pp. 2683–2692.
HCIHIMI-IKC-2015-ZengCLSHC #framework #mobile
Scene Feature Recognition-Enabled Framework for Mobile Service Information Query System (YCZ, YHC, TYL, MJS, PYH, GLC), pp. 64–74.
ICEISICEIS-v1-2015-MeisenKMRJ #named #online
TIDAQL — A Query Language Enabling on-Line Analytical Processing of Time Interval Data (PM, DK, TM, MR, SJ), pp. 54–66.
ICEISICEIS-v1-2015-MendoncaMSS #approach #named
CORE — A Context-based Approach for Rewriting User Queries (AM, PM, DS, ACS), pp. 391–398.
ICEISICEIS-v1-2015-SirohiS #multitenancy #optimisation #performance #sql
Context-sensitive Indexes in RDBMS for Performance Optimization of SQL Queries in Multi-tenant/Multi-application Environments (AKS, VS), pp. 259–270.
ICEISICEIS-v2-2015-MaranMAWO #information management
Proactive Domain Data Querying based on Context Information in Ambient Assisted Living Environments (VM, AM, IA, LKW, JPMdO), pp. 610–617.
ICEISICEIS-v3-2015-LozanoCPA #named #ontology
RockQuery — An Ontology-based Data Querying Tool (JL, JLC, MP, MA), pp. 25–33.
CIKMCIKM-2015-AwadallahKOJ #predict
Characterizing and Predicting Voice Query Reformulation (AHA, RGK, UO, RJ), pp. 543–552.
CIKMCIKM-2015-BhowmickDCA #feedback #paradigm #semistructured data #visual notation
Interruption-Sensitive Empty Result Feedback: Rethinking the Visual Query Feedback Paradigm for Semistructured Data (SSB, CED, BC, MHA), pp. 723–732.
CIKMCIKM-2015-ChenZSW #approach #eye tracking #modelling #realtime #topic
A Real-Time Eye Tracking Based Query Expansion Approach via Latent Topic Modeling (YC, PZ0, DS0, BW), pp. 1719–1722.
CIKMCIKM-2015-ChoromanskiRS #algorithm #database #online #statistics
An Optimal Online Algorithm For Retrieving Heavily Perturbed Statistical Databases In The Low-Dimensional Querying Model (KMC, AR, US), pp. 1381–1390.
CIKMCIKM-2015-JamilJ #relational #web
A Structured Query Model for the Deep Relational Web (HMJ, HVJ), pp. 1679–1682.
CIKMCIKM-2015-KantereOKS #data flow #semistructured data
Query Relaxation across Heterogeneous Data Sources (VK, GO, AK, TKS), pp. 473–482.
CIKMCIKM-2015-KholghiSZN #case study #information management #learning
External Knowledge and Query Strategies in Active Learning: a Study in Clinical Information Extraction (MK, LS, GZ, ANN), pp. 143–152.
CIKMCIKM-2015-KhudaBukhshBW #case study #classification #detection #effectiveness #self
Building Effective Query Classifiers: A Case Study in Self-harm Intent Detection (ARK, PNB, RWW), pp. 1735–1738.
CIKMCIKM-2015-KleisarchakiACC #multi
Querying Temporal Drifts at Multiple Granularities (SK, SAY, ADC, VC), pp. 1531–1540.
CIKMCIKM-2015-LimsopathamMO #documentation #modelling
Modelling the Usefulness of Document Collections for Query Expansion in Patient Search (NL, CM, IO), pp. 1739–1742.
CIKMCIKM-2015-Lv #case study #heuristic #information retrieval
A Study of Query Length Heuristics in Information Retrieval (YL), pp. 1747–1750.
CIKMCIKM-2015-MitraC
Query Auto-Completion for Rare Prefixes (BM, NC), pp. 1755–1758.
CIKMCIKM-2015-MoffatSTB #evaluation
Pooled Evaluation Over Query Variations: Users are as Diverse as Systems (AM, FS, PT0, PB), pp. 1759–1762.
CIKMCIKM-2015-NuttPS #implementation #reasoning
Implementing Query Completeness Reasoning (WN, SP0, OS), pp. 733–742.
CIKMCIKM-2015-Pasca
The Role of Query Sessions in Interpreting Compound Noun Phrases (MP), pp. 1121–1129.
CIKMCIKM-2015-PradhanDL
Atypical Queries in eCommerce (NP, VD, KL), pp. 1767–1770.
CIKMCIKM-2015-SchuhmacherDP #ranking #web
Ranking Entities for Web Queries Through Text and Knowledge (MS, LD, SPP), pp. 1461–1470.
CIKMCIKM-2015-SheinCL #named #optimisation
F1: Accelerating the Optimization of Aggregate Continuous Queries (AUS, PKC, AL), pp. 1151–1160.
CIKMCIKM-2015-SordoniBVLSN #generative
A Hierarchical Recurrent Encoder-Decoder for Generative Context-Aware Query Suggestion (AS, YB, HV, CL, JGS, JYN), pp. 553–562.
CIKMCIKM-2015-VolskeBHLS #what
What Users Ask a Search Engine: Analyzing One Billion Russian Question Queries (MV, PB, MH, GL, BS0), pp. 1571–1580.
CIKMCIKM-2015-WangCWD #ontology #owl #scalability #towards
Towards Scalable and Complete Query Explanation with OWL 2 EL Ontologies (ZW0, MC, KW, JD), pp. 743–752.
CIKMCIKM-2015-WilkieA #bias #performance
Query Length, Retrievability Bias and Performance (CW, LA), pp. 1787–1790.
CIKMCIKM-2015-XiongC #documentation #named
EsdRank: Connecting Query and Documents through External Semi-Structured Data (CX, JC), pp. 951–960.
CIKMCIKM-2015-ZhangJRXCY #graph #learning #modelling
Learning Entity Types from Query Logs via Graph-Based Modeling (JZ, LJ, AR, SX, YC, PSY), pp. 603–612.
CIKMCIKM-2015-ZhukovskiyKGS #framework #optimisation #similarity
An Optimization Framework for Propagation of Query-Document Features by Query Similarity Functions (MZ, TK, GG, PS), pp. 981–990.
ECIRECIR-2015-BouchouchaLN #towards
Towards Query Level Resource Weighting for Diversified Query Expansion (AB, XL, JYN), pp. 1–12.
ECIRECIR-2015-EdwardsKA #design #interface #performance
The Impact of Query Interface Design on Stress, Workload and Performance (AE, DK, LA), pp. 691–702.
ECIRECIR-2015-PRBM #web
Entity Linking for Web Search Queries (DP, SR, PB, SM), pp. 394–399.
ECIRECIR-2015-VerberneSJK #interactive #personalisation #simulation
User Simulations for Interactive Search: Evaluating Personalized Query Suggestion (SV, MS, KJ, WK), pp. 678–690.
KDDKDD-2015-MottinBG #graph
Graph Query Reformulation with Diversity (DM, FB, FG), pp. 825–834.
KDDKDD-2015-RuchanskyCT #matrix
Matrix Completion with Queries (NR, MC, ET), pp. 1025–1034.
KDDKDD-2015-ZoumpatianosLPG
Query Workloads for Data Series Indexes (KZ, YL, TP, JG), pp. 1603–1612.
MLDMMLDM-2015-SejalSTAVIP #graph #similarity
Query Click and Text Similarity Graph for Query Suggestions (DS, KGS, VT, DA, KRV, SSI, LMP), pp. 328–341.
SEKESEKE-2015-ChavezM #information retrieval #ontology #using
An Information Retrieval Model using Query Expansion based on Ontologies in the Computer Science Domain (BGCC, AM), pp. 652–655.
SIGIRSIGIR-2015-Baeza-Yates #incremental
Incremental Sampling of Query Logs (RABY), pp. 1093–1096.
SIGIRSIGIR-2015-EickhoffDT
An Eye-Tracking Study of Query Reformulation (CE, SD, VT), pp. 13–22.
SIGIRSIGIR-2015-GrbovicDRSB
Context- and Content-aware Embeddings for Query Rewriting in Sponsored Search (MG, ND, VR, FS, NB), pp. 383–392.
SIGIRSIGIR-2015-GuptaB #information retrieval
Information Retrieval with Verbose Queries (MG, MB), pp. 1121–1124.
SIGIRSIGIR-2015-HarelY #clustering #identification
Modularity-Based Query Clustering for Identifying Users Sharing a Common Condition (MGOH, EYT), pp. 819–822.
SIGIRSIGIR-2015-HarveyHE #learning
Learning by Example: Training Users with High-quality Query Suggestions (MH, CH, DE), pp. 133–142.
SIGIRSIGIR-2015-Hasanuzzaman0DF #comprehension
Understanding Temporal Query Intent (MH, SS, GD, SF), pp. 823–826.
SIGIRSIGIR-2015-LiDDCZB #behaviour #markov #process
Analyzing User’s Sequential Behavior in Query Auto-Completion via Markov Processes (LL, HD, AD, YC, HZ, RABY), pp. 123–132.
SIGIRSIGIR-2015-MehrotraY #learning #rank #using
Representative & Informative Query Selection for Learning to Rank using Submodular Functions (RM, EY), pp. 545–554.
SIGIRSIGIR-2015-Mitra #distributed #using
Exploring Session Context using Distributed Representations of Queries and Reformulations (BM), pp. 3–12.
SIGIRSIGIR-2015-OardSWJH
A Test Collection for Spoken Gujarati Queries (DWO, RS, JW, AJ, CH), pp. 919–922.
SIGIRSIGIR-2015-OdijkMSR #modelling
Dynamic Query Modeling for Related Content Finding (DO, EM, IS, MdR), pp. 33–42.
SIGIRSIGIR-2015-SantoMMO
Comparing Approaches for Query Autocompletion (GDS, RM, CM, IO), pp. 775–778.
SIGIRSIGIR-2015-ShokouhiG #ranking #recommendation
From Queries to Cards: Re-ranking Proactive Card Recommendations Based on Reactive Search History (MS, QG), pp. 695–704.
SIGIRSIGIR-2015-VuurensVBM #ad hoc #online
Online News Tracking for Ad-Hoc Queries (JBPV, APdV, RB, PM), pp. 1047–1048.
SIGIRSIGIR-2015-ZhangGKDDCGH #adaptation #feedback #named
adaQAC: Adaptive Query Auto-Completion via Implicit Negative Feedback (AZ, AG, WK, HD, AD, YC, CAG, JH), pp. 143–152.
OOPSLAOOPSLA-2015-GveroK #java
Synthesizing Java expressions from free-form queries (TG, VK), pp. 416–432.
ASEASE-2015-MartieLH #named
CodeExchange: Supporting Reformulation of Internet-Scale Code Queries in Context (T) (LM, TDL, AvdH), pp. 24–35.
ESEC-FSEESEC-FSE-2015-Prasetya #generative #java #named #testing
T3i: a tool for generating and querying test suites for Java (ISWBP), pp. 950–953.
ICSEICSE-v2-2015-GveroK #interactive #synthesis #using
Interactive Synthesis Using Free-Form Queries (TG, VK), pp. 689–692.
ICSEICSE-v2-2015-Stevens #declarative
A Declarative Foundation for Comprehensive History Querying (RS), pp. 907–910.
SACSAC-2015-AissiGSS #evaluation #framework #personalisation #recommendation
Personalized recommendation of SOLAP queries: theoretical framework and experimental evaluation (SA, MSG, TS, LBS), pp. 1008–1014.
SACSAC-2015-BritoE #branch #named #performance
BranchGuide: an indexing technique for efficient, lossless processing of branching path queries (TBV, GEdS), pp. 1086–1092.
SACSAC-2015-HogenboomNJFV #distributed #optimisation #rdf
RDF chain query optimization in a distributed environment (AH, EN, MJ, FF, DV), pp. 353–359.
SACSAC-2015-HsiehNKC #approximate #performance #recommendation
Efficient approximate thompson sampling for search query recommendation (CCH, JN, TK, JC), pp. 740–746.
SACSAC-2015-RychnovskyH #generative #xml #xpath
Generating XML data for XPath queries (DR, IH), pp. 724–731.
SACSAC-2015-Schlotterer
From context to query (JS), pp. 1108–1109.
GPCEGPCE-2015-NogueraJ #modelling
Model querying with query models (CN, VJ), pp. 181–184.
HPCAHPCA-2015-HsuZLMWMTD #named
Adrenaline: Pinpointing and reining in tail queries with quick voltage boosting (CHH, YZ, MAL, DM, TFW, JM, LT, RGD), pp. 271–282.
ESOPESOP-2015-GordonRSBRGT #probability #source code #spreadsheet
Probabilistic Programs as Spreadsheet Queries (ADG, CVR, MS, JB, NR, TG, DT), pp. 1–25.
STOCSTOC-2015-ChenDST #adaptation #testing
Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (XC, AD, RAS, LYT), pp. 519–528.
STOCSTOC-2015-DinurHK #composition #fault
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (ID, PH, GK), pp. 267–276.
CAVCAV-2015-RandourRS #markov #multi #process
Percentile Queries in Multi-dimensional Markov Decision Processes (MR, JFR, OS), pp. 123–139.
CSLCSL-2015-BovaM #finite #first-order
First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.
ICLPICLP-J-2015-MannaRT #consistency #scalability
Taming primary key violations to query large inconsistent data via ASP (MM, FR, GT), pp. 696–710.
LICSLICS-2015-AmarilliB #finite #strict
Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.
LICSLICS-2015-BienvenuKP #complexity #owl
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (MB, SK, VVP), pp. 317–328.
LICSLICS-2015-FigueiraL #graph #logic #performance
Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
LICSLICS-2015-GogaczM #decidability
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (TG, JM), pp. 281–292.
ICSTSAT-2015-KullmannM
Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.
PODSPODS-2014-ArenasGP #semantics #web
Expressive languages for querying the semantic web (MA, GG, AP), pp. 14–26.
PODSPODS-2014-Barcelo0V #evaluation #question
Does query evaluation tractability help query containment? (PB, MR, MYV), pp. 188–199.
PODSPODS-2014-BeameKS #parallel
Skew in parallel query processing (PB, PK, DS), pp. 212–223.
PODSPODS-2014-DurandSS #database #first-order
Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.
PODSPODS-2014-FanGL #big data #independence #on the
On scale independence for querying big data (WF, FG, LL), pp. 51–62.
PODSPODS-2014-FinkO #database #probability
A dichotomy for non-repeating queries with negation in probabilistic databases (RF, DO), pp. 144–155.
PODSPODS-2014-GrecoS #hybrid
Counting solutions to conjunctive queries: structural and hybrid tractability (GG, FS), pp. 132–143.
PODSPODS-2014-PatilTSNV #category theory
Categorical range maxima queries (MP, SVT, RS, YN, JSV), pp. 266–277.
SIGMODSIGMOD-2014-AgarwalMKTJMMS #approximate #performance #reliability
Knowing when you’re wrong: building fast and reliable approximate query processing systems (SA, HM, AK, AT, MIJ, SM, BM, IS), pp. 481–492.
SIGMODSIGMOD-2014-AmsterdamerDMNS #mining #named
OASSIS: query driven crowd mining (YA, SBD, TM, SN, AS), pp. 589–600.
SIGMODSIGMOD-2014-AntovaESGPW #optimisation
Optimizing queries over partitioned tables in MPP systems (LA, AEH, MAS, ZG, MP, FW), pp. 373–384.
SIGMODSIGMOD-2014-ArasuEKR
Querying encrypted data (AA, KE, RK, RR), pp. 1259–1261.
SIGMODSIGMOD-2014-BinnigSZ #named
DoomDB: kill the query (CB, AS, EZ), pp. 913–916.
SIGMODSIGMOD-2014-CheneyLW #evaluation #multi #performance #relational
Query shredding: efficient relational evaluation of queries over nested multisets (JC, SL, PW), pp. 1027–1038.
SIGMODSIGMOD-2014-ChenLWXML #algorithm #network #performance
Efficient algorithms for optimal location queries in road networks (ZC, YL, RCWW, JX, GM, CL), pp. 123–134.
SIGMODSIGMOD-2014-CheungMS #database #lazy evaluation #named
Sloth: being lazy is a virtue (when issuing database queries) (AC, SM, ASL), pp. 931–942.
SIGMODSIGMOD-2014-DimitriadouPD #automation #data analysis #framework #interactive #named
Explore-by-example: an automatic query steering framework for interactive data exploration (KD, OP, YD), pp. 517–528.
SIGMODSIGMOD-2014-DuttH #estimation
Plan bouquets: query processing without selectivity estimation (AD, JRH), pp. 1039–1050.
SIGMODSIGMOD-2014-DyresonBG #using
Querying virtual hierarchies using virtual prefix-based numbers (CED, SSB, RG), pp. 791–802.
SIGMODSIGMOD-2014-FanWW #bound #graph
Querying big graphs within bounded resources (WF, XW, YW), pp. 301–312.
SIGMODSIGMOD-2014-FernandesBRAM #named #tuple
PackageBuilder: querying for packages of tuples (KF, MB, RR, AA, AM), pp. 1613–1614.
SIGMODSIGMOD-2014-GhodsniaBN #optimisation #parallel
Parallel I/O aware query optimization (PG, ITB, AN), pp. 349–360.
SIGMODSIGMOD-2014-HuangCQTY #community #graph #scalability
Querying k-truss community in large and dynamic graphs (XH, HC, LQ, WT, JXY), pp. 1311–1322.
SIGMODSIGMOD-2014-IleanaCDK #constraints
Complete yet practical search for minimal query reformulations under constraints (II, BC, AD, YK), pp. 1015–1026.
SIGMODSIGMOD-2014-KaranasosBKOEXJ #optimisation #platform #scalability
Dynamically optimizing queries over large scale data platforms (KK, AB, MK, , VE, CX, JJ), pp. 943–954.
SIGMODSIGMOD-2014-KarnagelHLHLHM #performance
Demonstrating efficient query processing in heterogeneous environments (TK, MH, ML, DH, WL, MH, VM), pp. 693–696.
SIGMODSIGMOD-2014-KhanYDK #towards
Towards indexing functions: answering scalar product queries (AK, PY, BD, DK), pp. 241–252.
SIGMODSIGMOD-2014-LeFevreSHTPC14a #big data #multi #named
MISO: souping up big data query processing with a multistore system (JL, JS, HH, JT, NP, MJC), pp. 1591–1602.
SIGMODSIGMOD-2014-LeisBK0 #evaluation #framework #manycore #parallel
Morsel-driven parallelism: a NUMA-aware query evaluation framework for the many-core age (VL, PAB, AK, TN), pp. 743–754.
SIGMODSIGMOD-2014-LiJ #database #interactive #interface #named #natural language #relational
NaLIR: an interactive natural language interface for querying relational databases (FL, HVJ), pp. 709–712.
SIGMODSIGMOD-2014-MondalD #graph #named #scalability
EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs (JM, AD), pp. 1335–1346.
SIGMODSIGMOD-2014-MottinLVP
Searching with XQ: the exemplar query search engine (DM, ML, YV, TP), pp. 901–904.
SIGMODSIGMOD-2014-MottinMRDPV #interactive #named #problem
IQR: an interactive query relaxation system for the empty-answer problem (DM, AM, SBR, GD, TP, YV), pp. 1095–1098.
SIGMODSIGMOD-2014-NikolicEK #incremental #maintenance #named
LINVIEW: incremental view maintenance for complex analytical queries (MN, ME, CK), pp. 253–264.
SIGMODSIGMOD-2014-PsaroudakisAOA #concurrent
Reactive and proactive sharing across concurrent analytical queries (IP, MA, MO, AA), pp. 889–892.
SIGMODSIGMOD-2014-RanuHS #database #graph
Answering top-k representative queries on graph databases (SR, MXH, AKS), pp. 1163–1174.
SIGMODSIGMOD-2014-RoyS #approach #database #formal method
A formal approach to finding explanations for database queries (SR, DS), pp. 1579–1590.
SIGMODSIGMOD-2014-ShenCCDN #tuple
Discovering queries based on example tuples (YS, KC, SC, BD, LN), pp. 493–504.
SIGMODSIGMOD-2014-SimitsisWBW #named
VQA: vertica query analyzer (AS, KW, JB, JW), pp. 701–704.
SIGMODSIGMOD-2014-SolimanAREGSCGRPWNKB #architecture #big data #composition #named
Orca: a modular query optimizer architecture for big data (MAS, LA, VR, AEH, ZG, ES, GCC, CGA, FR, MP, FW, SN, KK, RB), pp. 337–348.
SIGMODSIGMOD-2014-TrummerK #approximate #optimisation
Approximation schemes for many-objective query optimization (IT, CK), pp. 1299–1310.
SIGMODSIGMOD-2014-WangKFGKM #framework #performance
A sample-and-clean framework for fast and accurate query processing on dirty data (JW, SK, MJF, KG, TK, TM), pp. 469–480.
SIGMODSIGMOD-2014-WongKCLY #database
Secure query processing with data interoperability in a cloud database environment (WKW, BK, DWLC, RL, SMY), pp. 1395–1406.
SIGMODSIGMOD-2014-WuJZ #graph #nearest neighbour #performance #random #scalability
Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
SIGMODSIGMOD-2014-XiongHN #approach #distributed #network #performance
A software-defined networking based approach for performance management of analytical queries on distributed data stores (PX, HH, JFN), pp. 955–966.
SIGMODSIGMOD-2014-YangXWWSWY #graph #named
SLQ: a user-friendly graph querying system (SY, YX, YW, TW, HS, JW, XY), pp. 893–896.
SIGMODSIGMOD-2014-ZengGGMZ #approximate #named #scalability
ABS: a system for scalable approximate queries with accuracy guarantees (KZ, SG, JG, BM, CZ), pp. 1067–1070.
SIGMODSIGMOD-2014-ZengGMZ #approximate #estimation #fault #performance
The analytical bootstrap: a new method for fast error estimation in approximate query processing (KZ, SG, BM, CZ), pp. 277–288.
SIGMODSIGMOD-2014-ZhangDI #complexity #on the #optimisation
On complexity and optimization of expensive queries in complex event processing (HZ, YD, NI), pp. 217–228.
SIGMODSIGMOD-2014-ZhuLWX #approach #graph #order #reachability #scalability
Reachability queries on large dynamic graphs: a total order approach (ADZ, WL, SW, XX), pp. 1323–1334.
VLDBVLDB-2014-AfratiDPU
Storing and Querying Tree-Structured Records in Dremel (FNA, DD, MP, JDU), pp. 1131–1142.
VLDBVLDB-2014-AlaviZPC #in the cloud #named #performance
RASP-QS: Efficient and Confidential Query Services in the Cloud (ZA, LZ, JP, KC), pp. 1685–1688.
VLDBVLDB-2014-BenediktLT #named
PDQ: Proof-driven Query Answering over Web-based Data (MB, JL, ET), pp. 1553–1556.
VLDBVLDB-2014-BonifatiCS #interactive
Interactive Join Query Inference with JIM (AB, RC, SS), pp. 1541–1544.
VLDBVLDB-2014-CaoFWY #bound
Bounded Conjunctive Queries (YC, WF, TW, WY), pp. 1231–1242.
VLDBVLDB-2014-DuttNH #approach #named #robust
QUEST: An Exploratory Approach to Robust Query Processing (AD, SN, JRH), pp. 1585–1588.
VLDBVLDB-2014-GrecoPW #consistency #database
Certain Query Answering in Partially Consistent Databases (SG, FP, JW), pp. 353–364.
VLDBVLDB-2014-GuarnieriB
Optimal Security-Aware Query Processing (MG, DAB), pp. 1307–1318.
VLDBVLDB-2014-JayachandranTKN #execution #interactive
Combining User Interaction, Speculative Query Execution and Sampling in the DICE System (PJ, KT, NK, AN), pp. 1697–1700.
VLDBVLDB-2014-JiangFWX #distance #network
Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks (MJ, AWCF, RCWW, YX), pp. 1203–1214.
VLDBVLDB-2014-KarpathiotakisBAA #adaptation
Adaptive Query Processing on RAW Data (MK, MB, IA, AA), pp. 1119–1130.
VLDBVLDB-2014-KlonatosKRC #performance
Building Efficient Query Engines in a High-Level Language (YK, CK, TR, HC), pp. 853–864.
VLDBVLDB-2014-KlonatosKRC14a #performance
Errata for “Building Efficient Query Engines in a High-Level Language” (PVLDB 7(10): 853-864) (YK, CK, TR, HC), p. 1784.
VLDBVLDB-2014-LeiZRE #big data #framework
Redoop Infrastructure for Recurring Big Data Queries (CL, ZZ, EAR, MYE), pp. 1589–1592.
VLDBVLDB-2014-LiHMW #algorithm #difference #privacy
A Data- and Workload-Aware Query Answering Algorithm for Range Queries Under Differential Privacy (CL, MH, GM, YW), pp. 341–352.
VLDBVLDB-2014-LiLWB #in the cloud #performance #privacy
Fast Range Query Processing with Strong Privacy Protection for Cloud Computing (RL, AXL, ALW, BB), pp. 1953–1964.
VLDBVLDB-2014-LinK #on the
On Arbitrage-free Pricing for General Data Queries (BRL, DK), pp. 757–768.
VLDBVLDB-2014-MottinLVP #what
Exemplar Queries: Give me an Example of What You Need (DM, ML, YV, TP), pp. 365–376.
VLDBVLDB-2014-NagelBV #code generation #performance
Code Generation for Efficient Query Processing in Managed Runtimes (FN, GMB, SDV), pp. 1095–1106.
VLDBVLDB-2014-NtarmosPT #database #rank
Rank Join Queries in NoSQL Databases (NN, IP, PT), pp. 493–504.
VLDBVLDB-2014-ShanbhagS #optimisation
Optimizing Join Enumeration in Transformation-based Query Optimizers (AS, SS), pp. 1243–1254.
VLDBVLDB-2014-VartakMPP #automation #generative #named #visualisation
SEEDB: Automatically Generating Query Visualizations (MV, SM, AGP, NP), pp. 1581–1584.
VLDBVLDB-2014-WangZYMLD0 #concurrent
Concurrent Analytical Query Processing with GPUs (KW, KZ, YY, SM, RL, XD, XZ), pp. 1011–1022.
VLDBVLDB-2014-WeiYLJ #approach #independence #permutation #reachability
Reachability Querying: An Independent Permutation Labeling Approach (HW, JXY, CL, RJ), pp. 1191–1202.
VLDBVLDB-2014-WuWHN #execution #nondeterminism #predict
Uncertainty Aware Query Execution Time Prediction (WW, XW, HH, JFN), pp. 1857–1868.
VLDBVLDB-2014-XiaLYMQ #benchmark #metric #named #social #social media
BSMA: A Benchmark for Analytical Queries over Social Media Data (FX, YL, CY, HM, WQ), pp. 1573–1576.
VLDBVLDB-2014-XiongH #distributed #named #network #performance
Pronto: A Software-Defined Networking based System for Performance Management of Analytical Queries on Distributed Data Stores (PX, HH), pp. 1661–1664.
VLDBVLDB-2014-YangWSY #graph
Schemaless and Structureless Graph Querying (SY, YW, HS, XY), pp. 565–576.
VLDBVLDB-2014-ZhangJK
Reverse k-Ranks Query (ZZ, CJ, QK), pp. 785–796.
VLDBVLDB-2015-ChandramouliGBDPTW14 #incremental #named
Trill: A High-Performance Incremental Query Processor for Diverse Analytics (BC, JG, MB, RD, JCP, JFT, JW), pp. 401–412.
VLDBVLDB-2015-GicevaARH14 #deployment #multi
Deployment of Query Plans on Multicores (JG, GA, TR, TH), pp. 233–244.
VLDBVLDB-2015-HeZH14 #architecture #cpu #gpu
In-Cache Query Co-Processing on Coupled CPU-GPU Architectures (JH, SZ, BH), pp. 329–340.
VLDBVLDB-2015-Li0QYZ014 #set #using
Processing Moving kNN Queries Using Influential Neighbor Sets (CL, YG, JQ, GY, RZ, WY), pp. 113–124.
VLDBVLDB-2015-SunWQZL14 #approximate #named #nearest neighbour
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index (YS, WW, JQ, YZ, XL), pp. 1–12.
VLDBVLDB-2015-TrummerK14 #multi #optimisation #parametricity
Multi-Objective Parametric Query Optimization (IT, CK), pp. 221–232.
ITiCSEITiCSE-2014-MI #bound
A method to prove query lower bounds (JM, SI), pp. 81–86.
SANERCSMR-WCRE-2014-GeSDM #how #recommendation
How the Sando search tool recommends queries (XG, DCS, KD, ERMH), pp. 425–428.
SANERCSMR-WCRE-2014-HillRFM #case study #code search #refinement #user study
NL-based query refinement and contextualized code search results: A user study (EH, MRV, JAF, GM), pp. 34–43.
SANERCSMR-WCRE-2014-UjhelyiHVCSVF #comparison #detection
Anti-pattern detection with model queries: A comparison of approaches (ZU, ÁH, DV, NIC, GS, LV, RF), pp. 293–302.
ICSMEICSME-2014-EddyK #code search #source code #using
Using Structured Queries for Source Code Search (BPE, NAK), pp. 431–435.
ICSMEICSME-2014-Haiduc #re-engineering #retrieval
Supporting Query Formulation for Text Retrieval Applications in Software Engineering (SH), pp. 657–662.
ICSMEICSME-2014-StevensR #using
Querying the History of Software Projects Using QWALKEKO (RS, CDR), pp. 585–588.
MSRMSR-2014-LemosPZL #automation #code search #interface
Thesaurus-based automatic query expansion for interface-driven code search (OALL, ACdP, FCZ, CVL), pp. 212–221.
DLTDLT-J-2013-TanV14 #graph #regular expression
Regular Expressions for Querying Data graphs (TT, DV), pp. 971–986.
ICALPICALP-v1-2014-Ben-SassonV
Short PCPs with Projection Queries (EBS, EV), pp. 163–173.
ICALPICALP-v1-2014-FeigeJ #preprocessor
Demand Queries with Preprocessing (UF, SJ), pp. 477–488.
ICALPICALP-v1-2014-GawrychowskiMW #matrix
Improved Submatrix Maximum Queries in Monge Matrices (PG, SM, OW), pp. 525–537.
ICALPICALP-v1-2014-WimmerWZ #complexity #matrix
Optimal Query Complexity for Estimating the Trace of a Matrix (KW, YW, PZ), pp. 1051–1062.
CHICHI-2014-CraggsSA #crowdsourcing #named #semantics #video #web
ThumbReels: query sensitive web video previews based on temporal, crowdsourced, semantic tagging (BC, MKS, JA), pp. 1217–1220.
HCIDUXU-DI-2014-Davis #design #image #interactive #retrieval
Interfacing CBIR: Designing Interactive Widgets to Query Attribute Data in Face Image Retrieval (TD), pp. 425–434.
HCIHIMI-DE-2014-CunhaFPS #modelling #spreadsheet #visual notation
Graphical Querying of Model-Driven Spreadsheets (JC, JPF, RP, JS), pp. 419–430.
HCIHIMI-DE-2014-GombosK #dataset #recommendation
SPARQL Query Writing with Recommendations Based on Datasets (GG, AK), pp. 310–319.
ICEISICEIS-v1-2014-BrodskyHL #named
DG-Query: An XQuery-based Decision Guidance Query Language (AB, SGH, JL), pp. 152–163.
ICEISICEIS-v1-2014-FreireCSS #process #semantics
Preserving the Original Query Semantics in Routing Processes (CF, NC, DS, ACS), pp. 70–80.
CIKMCIKM-2014-AnandMBB #optimisation
Phrase Query Optimization on Inverted Indexes (AA, IM, SJB, KB), pp. 1807–1810.
CIKMCIKM-2014-BottcherLZ #equivalence
Pulling Conjunctive Query Equivalence out of the Bag (SB, SL, LZ), pp. 41–50.
CIKMCIKM-2014-CaiLR #personalisation
Time-sensitive Personalized Query Auto-Completion (FC, SL, MdR), pp. 1599–1608.
CIKMCIKM-2014-CamposDJN #named
GTE-Rank: Searching for Implicit Temporal Query Results (RC, GD, AMJ, CN), pp. 2081–2083.
CIKMCIKM-2014-GuptaB #identification
Identifying Time Intervals of Interest to Queries (DG, KB), pp. 1835–1838.
CIKMCIKM-2014-HofmannMRS #interactive
An Eye-tracking Study of User Interactions with Query Auto Completion (KH, BM, FR, MS), pp. 549–558.
CIKMCIKM-2014-Huo0LM #performance
Improving Tail Query Performance by Fusion Model (SH, MZ, YL, SM), pp. 559–568.
CIKMCIKM-2014-KimC14a #named
TensorDB: In-Database Tensor Manipulation with Tensor-Relational Query Plans (MK, KSC), pp. 2039–2041.
CIKMCIKM-2014-MengCS #analysis #approximate #keyword #semantics
Semantic Approximate Keyword Query Based on Keyword and Query Coupling Relationship Analysis (XM, LC, JS), pp. 529–538.
CIKMCIKM-2014-OzdemirayA #performance #predict
Query Performance Prediction for Aspect Weighting in Search Result Diversification (AMO, ISA), pp. 1871–1874.
CIKMCIKM-2014-PaikO #fixpoint
A Fixed-Point Method for Weighting Terms in Verbose Informational Queries (JHP, DWO), pp. 131–140.
CIKMCIKM-2014-ShaoKTG #case study #complexity #distance #navigation #network
Travel distance versus navigation complexity: a study on different spatial queries on road networks (JS, LK, ET, LG), pp. 1791–1794.
CIKMCIKM-2014-SongG #difference #named #privacy
Aroma: A New Data Protection Method with Differential Privacy and Accurate Query Answering (CS, TG), pp. 1569–1578.
CIKMCIKM-2014-SongWCW #comprehension
Transfer Understanding from Head Queries to Tail Queries (YS, HW, WC, SW), pp. 1299–1308.
CIKMCIKM-2014-SpirinHDKB #analysis #facebook #graph #network #online #people #scalability #social
People Search within an Online Social Network: Large Scale Analysis of Facebook Graph Search Query Logs (NVS, JH, MD, KGK, MB), pp. 1009–1018.
CIKMCIKM-2014-TanC #social #social media
Succinct Queries for Linking and Tracking News in Social Media (LT, CLAC), pp. 1883–1886.
CIKMCIKM-2014-TaoW #performance #predict
Query Performance Prediction By Considering Score Magnitude and Variance Together (YT, SW), pp. 1891–1894.
CIKMCIKM-2014-VermaY
Entity Oriented Task Extraction from Query Logs (MV, EY), pp. 1975–1978.
CIKMCIKM-2014-VouzoukidouAC #named #ranking #realtime
MeowsReader: Real-Time Ranking and Filtering of News with Generalized Continuous Top-k Queries (NV, BA, VC), pp. 2066–2068.
CIKMCIKM-2014-WuF #documentation #scalability
Document Prioritization for Scalable Query Processing (HW, HF), pp. 1609–1618.
CIKMCIKM-2014-WuF14a #modelling #performance
Analytical Performance Modeling for Top-K Query Processing (HW, HF), pp. 1619–1628.
CIKMCIKM-2014-YuanW0 #graph #nondeterminism #scalability
Pattern Match Query in a Large Uncertain Graph (YY, GW, LC), pp. 519–528.
CIKMCIKM-2014-ZengBLLL #identification #keyword #named #relational
ExpressQ: Identifying Keyword Context and Search Target in Relational Keyword Queries (ZZ, ZB, TNL, MLL, TWL), pp. 31–40.
CIKMCIKM-2014-Zhang0T #collaboration #framework #named #probability
MaC: A Probabilistic Framework for Query Answering with Machine-Crowd Collaboration (CJZ, LC, YT), pp. 11–20.
CIKMCIKM-2014-ZhaoCCY
Query Augmentation based Intent Matching in Retail Vertical Ads (HZ, YC, JFC, TWY), pp. 619–628.
ECIRECIR-2014-BouchouchaLN #multi
Integrating Multiple Resources for Diversified Query Expansion (AB, XL, JYN), pp. 437–442.
ECIRECIR-2014-BueyGETIM #named #semantics
SQX-Lib: Developing a Semantic Query Expansion System in a Media Group (MGB, ALG, SE, RT, SI, EM), pp. 780–783.
ECIRECIR-2014-CamposDJN #clustering #interface #named
GTE-Cluster: A Temporal Search Interface for Implicit Temporal Queries (RC, GD, AMJ, CN), pp. 775–779.
ECIRECIR-2014-CraveiroMM
Query Expansion with Temporal Segmented Texts (OC, JM, HM), pp. 612–617.
ECIRECIR-2014-KabaryS #gesture #retrieval #sketching #specification #using #video
Using Hand Gestures for Specifying Motion Queries in Sketch-Based Video Retrieval (IAK, HS), pp. 733–736.
ECIRECIR-2014-KazaiS #difference #evaluation #information retrieval #performance
Dissimilarity Based Query Selection for Efficient Preference Based IR Evaluation (GK, HS), pp. 172–183.
ECIRECIR-2014-LiuYF #interactive #named
EntEXPO: An Interactive Search System for Entity-Bearing Queries (XL, PY, HF), pp. 784–788.
ECIRECIR-2014-NguyenK #topic
Leveraging Dynamic Query Subtopics for Time-Aware Search Result Diversification (TNN, NK), pp. 222–234.
ECIRECIR-2014-ThumaRO #detection #retrieval
Detecting Missing Content Queries in an SMS-Based HIV/AIDS FAQ Retrieval System (ET, SR, IO), pp. 247–259.
ECIRECIR-2014-VerberneSK
Query Term Suggestion in Academic Search (SV, MS, WK), pp. 560–566.
ECIRECIR-2014-YangPSS #case study #e-commerce #scalability #using
A Study of Query Term Deletion Using Large-Scale E-commerce Search Logs (BY, NP, GS, NS), pp. 235–246.
ICMLICML-c1-2014-GiesekeHOI #nearest neighbour
Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs (FG, JH, CEO, CI), pp. 172–180.
ICMLICML-c2-2014-GaboardiAHRW
Dual Query: Practical Private Query Release for High Dimensional Data (MG, EJGA, JH, AR, ZSW), pp. 1170–1178.
ICPRICPR-2014-ChatbriKK #approach #documentation #image #independence
An Application-Independent and Segmentation-Free Approach for Spotting Queries in Document Images (HC, PWK, KK), pp. 2891–2896.
ICPRICPR-2014-PuigcerverTV #keyword
Word-Graph-Based Handwriting Keyword Spotting of Out-of-Vocabulary Queries (JP, AHT, EV), pp. 2035–2040.
KDDKDD-2014-Cohen #distance #performance
Distance queries from sampled data: accurate and efficient (EC), pp. 681–690.
KDDKDD-2014-FengGBEHM #big data #database #experience #in memory
Management and analytic of biomedical big data with cloud-based in-memory database and dynamic querying: a hands-on experience with real-world data (MF, MG, TB, JE, IH, RM), p. 1970.
KDDKDD-2014-SarawagiC #modelling #web
Open-domain quantity queries on web tables: annotation, response, and consensus models (SS, SC), pp. 711–720.
KDIRKDIR-2014-Bradford #ad hoc
Incorporating Ad Hoc Phrases in LSI Queries (RBB), pp. 61–70.
KDIRKDIR-2014-PlansangketG #evaluation #performance #retrieval #state of the art
Performance Evaluation of State-of-the-Art Ranked Retrieval Methods and Their Combinations for Query Suggestion (SP, JQG), pp. 141–148.
KDIRKDIR-2014-SourourL #information retrieval
Association Rules Between Terms Appreciated by EII for Query Expansion in IR (BRS, CL), pp. 381–387.
KEODKEOD-2014-DogmusPE #natural language #ontology
Answering Natural Language Queries about Rehabilitation Robotics Ontology on the Cloud (ZD, VP, EE), pp. 75–83.
KRKR-2014-BienvenuCOS #logic
Nested Regular Path Queries in Description Logics (MB, DC, MO, MS).
KRKR-2014-BotoevaKRWZ #knowledge base #logic
Query Inseparability for Description Logic Knowledge Bases (EB, RK, VR, FW, MZ).
KRKR-2014-EckePT #concept #similarity
Answering Instance Queries Relaxed by Concept Similarity (AE, RP, AYT).
SIGIRSIGIR-2014-AlonsoS #crowdsourcing
Building a query log via crowdsourcing (OA, MS), pp. 939–942.
SIGIRSIGIR-2014-ArifDL #collaboration #information management
Examining collaborative query reformulation: a case of travel information searching (ASMA, JTD, IL), pp. 875–878.
SIGIRSIGIR-2014-CarterCP #community #enterprise #modelling
Latent community discovery through enterprise user search query modeling (KMC, RSC, BP), pp. 871–874.
SIGIRSIGIR-2014-DaltonDA #knowledge base #using
Entity query feature expansion using knowledge base links (JD, LD, JA), pp. 365–374.
SIGIRSIGIR-2014-EfronWS #learning
Learning sufficient queries for entity filtering (ME, CW, GS), pp. 1091–1094.
SIGIRSIGIR-2014-GiangrecoKS #database #information retrieval #multi #named #scalability
ADAM: a system for jointly providing ir and database queries in large-scale multimedia retrieval (IG, IAK, HS), pp. 1257–1258.
SIGIRSIGIR-2014-GoeuriotKL #analysis #information retrieval
An analysis of query difficulty for information retrieval in the medical domain (LG, LK, JL), pp. 1007–1010.
SIGIRSIGIR-2014-GuptaBBCR #information retrieval
Query expansion for mixed-script information retrieval (PG, KB, REB, MC, PR), pp. 677–686.
SIGIRSIGIR-2014-JiangA
Necessary and frequent terms in queries (JJ, JA), pp. 1167–1170.
SIGIRSIGIR-2014-JiangKCC #behaviour #learning
Learning user reformulation behavior for query auto-completion (JYJ, YYK, PYC, PJC), pp. 445–454.
SIGIRSIGIR-2014-KatoYOT
Investigating users’ query formulations for cognitive search intents (MPK, TY, HO, KT), pp. 577–586.
SIGIRSIGIR-2014-KatzSKSR #performance #predict
Wikipedia-based query performance prediction (GK, AS, OK, BS, LR), pp. 1235–1238.
SIGIRSIGIR-2014-KimC #documentation
Diversifying query suggestions based on query documents (YK, WBC), pp. 891–894.
SIGIRSIGIR-2014-LiDWDCZ #2d
A two-dimensional click model for query auto-completion (YL, AD, HW, HD, YC, CZ), pp. 455–464.
SIGIRSIGIR-2014-LiWRM #classification #interactive #named #retrieval
ReQ-ReC: high recall retrieval with query pooling and interactive classification (CL, YW, PR, QM), pp. 163–172.
SIGIRSIGIR-2014-MaLWSBWW #named #policy #web
PAAP: prefetch-aware admission policies for query results cache in web search engines (HM, WL, BW, LS, XB, LW, BW), pp. 983–986.
SIGIRSIGIR-2014-MitraSRH #interactive #on the
On user interactions with query auto-completion (BM, MS, FR, KH), pp. 1055–1058.
SIGIRSIGIR-2014-MorenoDC #clustering #web
Query log driven web search results clustering (JGM, GD, GC), pp. 777–786.
SIGIRSIGIR-2014-PerezJ #microblog #performance #predict #retrieval
Predicting query performance in microblog retrieval (JARP, JMJ), pp. 1183–1186.
SIGIRSIGIR-2014-RavivKC #performance #predict #retrieval
Query performance prediction for entity retrieval (HR, OK, DC), pp. 1099–1102.
SIGIRSIGIR-2014-RoyVGC #segmentation #sequence #using
Improving unsupervised query segmentation using parts-of-speech sequence information (RSR, YV, NG, MC), pp. 935–938.
SIGIRSIGIR-2014-ShokouhiJORD #mobile
Mobile query reformulations (MS, RJ, UO, KR, FD), pp. 1011–1014.
SIGIRSIGIR-2014-SokolovHR #learning
Learning to translate queries for CLIR (AS, FH, SR), pp. 1179–1182.
SIGIRSIGIR-2014-StantonIM
Circumlocution in diagnostic medical queries (IS, SI, NM), pp. 133–142.
SIGIRSIGIR-2014-ZhangCT #keyword
Processing spatial keyword query as a top-k aggregation query (DZ, CYC, KLT), pp. 355–364.
AMTAMT-2014-GholizadehDM #approach #model transformation
A Query Structured Approach for Model Transformation (HG, ZD, TSEM), pp. 54–63.
ECMFAECMFA-2014-BarmpisK #modelling #scalability #towards
Towards Scalable Querying of Large-Scale Models (KB, DSK), pp. 35–50.
MODELSMoDELS-2014-SzarnyasIRHBV #distributed #framework #in the cloud #incremental #named
IncQuery-D: A Distributed Incremental Model Query Framework in the Cloud (GS, BI, IR, DH, GB, DV), pp. 653–669.
PEPMPEPM-2014-CheneyLRW #effectiveness
Effective quotation: relating approaches to language-integrated query (JC, SL, GR, PW), pp. 15–26.
PLDIPLDI-2014-SousaDVDG
Consolidation of queries with user-defined functions (MS, ID, DV, TD, CG), p. 56.
PPDPPPDP-2014-CheneyAA #database
Database Queries that Explain their Work (JC, AA, UAA), pp. 271–282.
RERE-2014-PruskiLAOARC #named #natural language #towards
TiQi: Towards natural language trace queries (PP, SL, RA, GO, SA, AR, JCH), pp. 123–132.
FSEFSE-2014-SunZLZWZK #re-engineering
Querying sequential software engineering data (CS, HZ, JGL, HZ, QW, DZ, SCK), pp. 700–710.
SACSAC-2014-AudehBB #information retrieval
Exploring query reformulation for named entity expansion in information retrieval (BA, PB, MB), pp. 929–930.
SACSAC-2014-HalderZC #analysis #database #information management
Information leakage analysis of database query languages (RH, MZ, AC), pp. 813–820.
SACSAC-2014-LinWCC
Finding targets with the nearest favor neighbor and farthest disfavor neighbor by a skyline query (YWL, ETW, CFC, ALPC), pp. 821–826.
SACSAC-2014-MesmoudiH #declarative #framework #scalability
A test framework for large scale declarative queries: preliminary results (AM, MSH), pp. 858–859.
SACSAC-2014-NgoPLS #image #named #recommendation
Recommend-Me: recommending query regions for image search (TDN, SP, DDL, SS), pp. 913–918.
CGOCGO-2014-WuDSABGY #execution #relational
Red Fox: An Execution Environment for Relational Query Processing on GPUs (HW, GFD, TS, MA, SB, MG, SY), p. 44.
HPDCHPDC-2014-AlamKW #distributed #scalability
A scalable distributed skip list for range queries (SA, HK, AW), pp. 315–318.
PDPPDP-2014-AliJS #distributed #rdf #towards
Towards Load Balancing and Parallelizing of RDF Query Processing in P2P Based Distributed RDF Data Stores (LA, TJ, CS), pp. 307–311.
PDPPDP-2014-SilvestriLOJ
GPU-Based Computing of Repeated Range Queries over Moving Objects (CS, FL, SO, CSJ), pp. 640–647.
STOCSTOC-2014-Babichenko #approximate #complexity #nash
Query complexity of approximate nash equilibria (YB), pp. 535–544.
STOCSTOC-2014-Chechik #approximate #constant #distance
Approximate distance oracles with constant query time (SC), pp. 654–663.
TACASTACAS-2014-HerreraWP #network #reduction
Quasi-Equal Clock Reduction: More Networks, More Queries (CH, BW, AP), pp. 295–309.
LICSLICS-CSL-2014-Chen #first-order #set
The tractability frontier of graph-like first-order query sets (HC), p. 9.
LICSLICS-CSL-2014-ChenM #classification #complexity #graph
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.
LICSLICS-CSL-2014-KikotKPZ #on the #ontology
On the succinctness of query rewriting over shallow ontologies (SK, RK, VVP, MZ), p. 10.
LICSLICS-CSL-2014-LosemannM
MSO queries on trees: enumerating answers under updates (KL, WM), p. 10.
JCDLJCDL-2013-SchererLS #multi #repository #research #using
Visual-interactive querying for multivariate research data repositories using bag-of-words (MS, TvL, TS), pp. 285–294.
PODSPODS-2013-AbouziedAPHS #learning #quantifier #verification
Learning and verifying quantified boolean queries by example (AA, DA, CHP, JMH, AS), pp. 49–60.
PODSPODS-2013-Baeza #database #graph
Querying graph databases (PBB), pp. 175–188.
PODSPODS-2013-BaganBG #graph
A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.
PODSPODS-2013-BeameKS #communication #parallel
Communication steps for parallel query processing (PB, PK, DS), pp. 273–284.
PODSPODS-2013-ChenM #classification #complexity
The fine classification of conjunctive queries and parameterized logarithmic space complexity (HC, MM), pp. 309–320.
PODSPODS-2013-KazanaS #bound #first-order
Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.
PODSPODS-2013-LibkinRV #adaptation #graph #rdf
Trial for RDF: adapting graph query languages for RDF data (LL, JLR, DV), pp. 201–212.
PODSPODS-2013-RudolphK #data access
Flag & check: data access with monadically defined queries (SR, MK), pp. 151–162.
PODSPODS-2013-Wijsen
Charting the tractability frontier of certain conjunctive query answering (JW), pp. 189–200.
SIGMODSIGMOD-2013-AkibaIY #distance #network #performance #scalability
Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.
SIGMODSIGMOD-2013-BykauRV #evolution
A query answering system for data with evolution relationships (SB, FR, YV), pp. 989–992.
SIGMODSIGMOD-2013-ChenCC #performance
An efficient query indexing mechanism for filtering geo-textual data (LC, GC, XC), pp. 749–760.
SIGMODSIGMOD-2013-ChengHWF #graph #named #reachability #scalability
TF-Label: a topological-folding labeling scheme for reachability querying in a large graph (JC, SH, HW, AWCF), pp. 193–204.
SIGMODSIGMOD-2013-CurrimSSZJY
DBMS metrology: measuring query time (SC, RTS, YKS, RZ, MWJ, CY), pp. 421–432.
SIGMODSIGMOD-2013-DeWittHNSAAFG
Split query processing in polybase (DJD, AH, RVN, SS, JAS, AA, MF, JG), pp. 1255–1266.
SIGMODSIGMOD-2013-DoKPPPD #challenge
Query processing on smart SSDs: opportunities and challenges (JD, YSK, JMP, CP, KP, DJD), pp. 1221–1230.
SIGMODSIGMOD-2013-Hartig #execution #linked data #named #open data #traversal #web
SQUIN: a traversal based query execution system for the web of linked data (OH), pp. 1081–1084.
SIGMODSIGMOD-2013-HungBTCZ #named #network #scalability #visual notation
QUBLE: blending visual subgraph query formulation with query processing on large networks (HHH, SSB, BQT, BC, SZ), pp. 1097–1100.
SIGMODSIGMOD-2013-KaufmannMVFKFM #data type #timeline
Timeline index: a unified data structure for processing queries on temporal data in SAP HANA (MK, AAM, PV, PMF, DK, FF, NM), pp. 1173–1184.
SIGMODSIGMOD-2013-KissingerSHL
Query processing on prefix trees live (TK, BS, DH, WL), pp. 1105–1108.
SIGMODSIGMOD-2013-KonstantinouKTK #cost analysis #in the cloud #named #self
COCCUS: self-configured cost-based query services in the cloud (IK, VK, DT, NK), pp. 1041–1044.
SIGMODSIGMOD-2013-KoutrisUBHS #towards
Toward practical query pricing with QueryMarket (PK, PU, MB, BH, DS), pp. 613–624.
SIGMODSIGMOD-2013-LapeineHHG #data analysis #interactive #mobile
Mobile interaction and query optimizationin a protein-ligand data analysis system (ML, KGH, EH, NMG), pp. 1291–1292.
SIGMODSIGMOD-2013-LimB #execution #optimisation
Execution and optimization of continuous queries with cyclops (HL, SB), pp. 1069–1072.
SIGMODSIGMOD-2013-LongWWF #approach #distance #keyword
Collective spatial keyword queries: a distance owner-driven approach (CL, RCWW, KW, AWCF), pp. 689–700.
SIGMODSIGMOD-2013-MishneDLSL #architecture #big data #performance #realtime #twitter
Fast data in the era of big data: Twitter’s real-time related query suggestion architecture (GM, JD, ZL, AS, JL), pp. 1147–1158.
SIGMODSIGMOD-2013-PapadopoulosCDG #algebra #authentication #data type #lightweight #linear
Lightweight authentication of linear algebraic queries on data streams (SP, GC, AD, MNG), pp. 881–892.
SIGMODSIGMOD-2013-RullBSKMT #sql
Query containment in entity SQL (GR, PAB, IGdS, YK, SM, ET), pp. 1169–1172.
SIGMODSIGMOD-2013-VlachouDNK #algorithm #bound
Branch-and-bound algorithm for reverse top-k queries (AV, CD, KN, YK), pp. 481–492.
SIGMODSIGMOD-2013-YuHLCZ #database #estimation #named
CS2: a new database synopsis for query estimation (FY, WCH, CL, DC, MZ), pp. 469–480.
SIGMODSIGMOD-2013-ZhangEPS #reverse engineering
Reverse engineering complex join queries (MZ, HE, CMP, DS), pp. 809–820.
SIGMODSIGMOD-2013-ZhuMXLTZ #distance #network #theory and practice #towards
Shortest path and distance queries on road networks: towards bridging theory and practice (ADZ, HM, XX, SL, YT, SZ), pp. 857–868.
TPDLTPDL-2013-JesperCH
Regional Effects on Query Reformulation Patterns (SJ, PDC, MMH), pp. 382–385.
VLDBVLDB-2013-0002M #named
Scorpion: Explaining Away Outliers in Aggregate Queries (EW, SM), pp. 553–564.
VLDBVLDB-2013-0007TR #effectiveness #graph #keyword #performance #probability
Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data (LZ, TT, AR), pp. 1642–1653.
VLDBVLDB-2013-ArmenatzoglouPP #framework
A General Framework for Geo-Social Query Processing (NA, SP, DP), pp. 913–924.
VLDBVLDB-2013-BajajS #authentication #named #sql
CorrectDB: SQL Engine with Practical Query Authentication (SB, RS), pp. 529–540.
VLDBVLDB-2013-BotheKV #named
eSkyline: Processing Skyline Queries over Encrypted Data (SB, PK, AV), pp. 1338–1341.
VLDBVLDB-2013-Bress #gpu #hybrid #performance #why
Why it is time for a HyPE: A Hybrid Query Processing Engine for Efficient GPU Coprocessing in DBMS (SB), pp. 1398–1403.
VLDBVLDB-2013-BrunoJZ #optimisation
Continuous Cloud-Scale Query Optimization and Processing (NB, SJ, JZ), pp. 961–972.
VLDBVLDB-2013-CaoB #implementation #performance #quantifier #relational
Efficient Implementation of Generalized Quantification in Relational Query Languages (BC, AB), pp. 241–252.
VLDBVLDB-2013-ChenCJW #evaluation #keyword
Spatial Keyword Query Processing: An Experimental Evaluation (LC, GC, CSJ, DW), pp. 217–228.
VLDBVLDB-2013-ChiHHN #scheduling
Distribution-Based Query Scheduling (YC, HH, WPH, JFN), pp. 673–684.
VLDBVLDB-2013-DengF #complexity #on the
On the Complexity of Query Result Diversification (TD, WF), pp. 577–588.
VLDBVLDB-2013-FanGN #big data #preprocessor
Making Queries Tractable on Big Data with Preprocessing (WF, FG, FN), pp. 685–696.
VLDBVLDB-2013-FarnanLCY #named
PAQO: A Preference-Aware Query Optimizer for PostgreSQL (NLF, AJL, PKC, TY), pp. 1334–1337.
VLDBVLDB-2013-FuWCW #distance #named
IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying (AWCF, HW, JC, RCWW), pp. 457–468.
VLDBVLDB-2013-GarofalakisKS #distributed #geometry #monitoring #sketching
Sketch-based Geometric Monitoring of Distributed Stream Queries (MNG, DK, VS), pp. 937–948.
VLDBVLDB-2013-GuptaRM #data flow #distributed
Ratio Threshold Queries over Distributed Data Sources (RG, KR, MKM), pp. 565–576.
VLDBVLDB-2013-HendawiBM #framework #named #network #predict #scalability
iRoad: A Framework For Scalable Predictive Query Processing On Road Networks (AMH, JB, MFM), pp. 1262–1265.
VLDBVLDB-2013-JiangMN #database #interface #multi #named
GestureQuery: A Multitouch Database Query Interface (LJ, MM, AN), pp. 1342–1345.
VLDBVLDB-2013-KaplanLMN
Answering Planning Queries with the Crowd (HK, IL, TM, SN), pp. 697–708.
VLDBVLDB-2013-KaufmannVFKF #interactive
Comprehensive and Interactive Temporal Query Processing with SAP HANA (MK, PV, PMF, DK, FF), pp. 1210–1213.
VLDBVLDB-2013-KolaitisPT #consistency #database #integer #performance #programming
Efficient Querying of Inconsistent Databases with Binary Integer Programming (PGK, EP, WCT), pp. 397–408.
VLDBVLDB-2013-LeeL #clustering #graph #rdf #scalability #semantics
Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning (KL, LL), pp. 1894–1905.
VLDBVLDB-2013-LiC #performance
Efficient Indexing for Diverse Query Results (LL, CYC), pp. 745–756.
VLDBVLDB-2013-LiuSW #performance
A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets (GL, AS, LW), pp. 505–516.
VLDBVLDB-2013-Madaan #documentation #multi #repository
Domain Specific Multi-stage Query Language for Medical Document Repositories (AM), pp. 1410–1415.
VLDBVLDB-2013-NajafiSJ #flexibility
Flexible Query Processor on FPGAs (MN, MS, HAJ), pp. 1310–1313.
VLDBVLDB-2013-OgdenTP #automaton #parallel #scalability #transducer #using #xml
Scalable XML Query Processing using Parallel Pushdown Transducers (PO, DBT, PP), pp. 1738–1749.
VLDBVLDB-2013-ParkMS #parallel #pipes and filters #using
Parallel Computation of Skyline and Reverse Skyline Queries Using MapReduce (YP, JKM, KS), pp. 2002–2013.
VLDBVLDB-2013-ParkW #crowdsourcing #optimisation
Query Optimization over Crowdsourced Data (HP, JW), pp. 781–792.
VLDBVLDB-2013-PsaroudakisAA #concurrent
Sharing Data and Work Across Concurrent Analytical Queries (IP, MA, AA), pp. 637–648.
VLDBVLDB-2013-SametAFLS #database #interface #named
PhotoStand: A Map Query Interface for a Database of News Photos (HS, MDA, BCF, MDL, JS), pp. 1350–1353.
VLDBVLDB-2013-SarwatEHM #declarative #distributed #graph #reachability
Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs (MS, SE, YH, MFM), pp. 1918–1929.
VLDBVLDB-2013-SatheO0A #framework #named #platform
EnviroMeter: A Platform for Querying Community-Sensed Data (SS, AO, DC, KA), pp. 1294–1297.
VLDBVLDB-2013-SavkovicPTN #approximate
Complete Approximations of Incomplete Queries (OS, PM, AT, WN), pp. 1378–1381.
VLDBVLDB-2013-ShkapskyZZ #datalog #graph
Graph Queries in a Next-Generation Datalog System (AS, KZ, CZ), pp. 1258–1261.
VLDBVLDB-2013-SmitsPG #fuzzy #named
ReqFlex: Fuzzy Queries for Everyone (GS, OP, TG), pp. 1206–1209.
VLDBVLDB-2013-TranBD #big data #design #problem
Designing Query Optimizers for Big Data Problems of The Future (NT, SB, JD), pp. 1168–1169.
VLDBVLDB-2013-TuKMZ
Processing Analytical Queries over Encrypted Data (ST, MFK, SM, NZ), pp. 289–300.
VLDBVLDB-2013-Viglas #compilation #sql
Just-in-time compilation for SQL query processing (SV), pp. 1190–1191.
VLDBVLDB-2013-WuCHN #concurrent #database #execution #predict #towards
Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads (WW, YC, HH, JFN), pp. 925–936.
VLDBVLDB-2013-WuYSIY #graph #keyword
Summarizing Answer Graphs Induced by Keyword Queries (YW, SY, MS, AI, XY), pp. 1774–1785.
VLDBVLDB-2013-XiaoQ0ITS #performance
Efficient Error-tolerant Query Autocompletion (CX, JQ, WW, YI, KT, KS), pp. 373–384.
VLDBVLDB-2013-YanZITY #feedback #integration #keyword #search-based
Actively Soliciting Feedback for Query Answers in Keyword Search-Based Data Integration (ZY, NZ, ZGI, PPT, CY), pp. 205–216.
VLDBVLDB-2013-YuanL0 #gpu
The Yin and Yang of Processing Data Warehousing Queries on GPU Devices (YY, RL, XZ), pp. 817–828.
VLDBVLDB-2013-ZhangHHL #architecture #cpu #gpu #named #parallel #performance #towards
OmniDB: Towards Portable and Efficient Query Processing on Parallel CPU/GPU Architectures (SZ, JH, BH, ML), pp. 1374–1377.
VLDBVLDB-2014-CaoR13 #clustering #performance
High Performance Stream Query Processing With Correlation-Aware Partitioning (LC, EAR), pp. 265–276.
VLDBVLDB-2014-ChenHX13 #authentication
Authenticating Top-k Queries in Location-based Services with Confidentiality (QC, HH, JX), pp. 49–60.
VLDBVLDB-2014-GyssensPGWW13 #approach #case study #symmetry #towards
An Approach towards the Study of Symmetric Queries (MG, JP, DVG, JW, YW), pp. 25–36.
VLDBVLDB-2014-NandiJM13 #gesture #specification
Gestural Query Specification (AN, LJ, MM), pp. 289–300.
VLDBVLDB-2014-NiedermayerZERM0K13 #nearest neighbour #nondeterminism #probability
Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories (JN, AZ, TE, MR, NM, LC, HPK), pp. 205–216.
VLDBVLDB-2014-OnizukaKHNH13 #optimisation #pipes and filters
Optimization for iterative queries on MapReduce (MO, HK, SH, KN, ZH), pp. 241–252.
CSMRCSMR-2013-NerellaMW #approach #optimisation #using
An Approach for Optimization of Object Queries on Collections Using Annotations (VKSN, SKM, TW), pp. 273–282.
CSMRCSMR-2013-StevensRNJ #detection #multi #refactoring
A History Querying Tool and Its Application to Detect Multi-version Refactorings (RS, CDR, CN, VJ), pp. 335–338.
ICSMEICSM-2013-Roldan-VegaMHF #code search #named #refinement
CONQUER: A Tool for NL-Based Query Refinement and Contextualizing Code Search Results (MRV, GM, EH, JAF), pp. 512–515.
MSRMSR-2013-SismanK #automation #code search #debugging #locality
Assisting code search with automatic query reformulation for bug localization (BS, ACK), pp. 309–318.
CIAACIAA-2013-DebarbieuxGNSZ #automaton #word #xml #xpath
Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.
DLTDLT-2013-LibkinTV #database #graph #regular expression #word
Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
ICALPICALP-v2-2013-ChenM #quantifier
Block-Sorted Quantified Conjunctive Queries (HC, DM), pp. 125–136.
ICALPICALP-v2-2013-GottlobPT #transitive
Querying the Guarded Fragment with Transitivity (GG, AP, LT), pp. 287–298.
CEFPCEFP-2013-CunhaFMPS #design #implementation #modelling #spreadsheet
Design and Implementation of Queries for Model-Driven Spreadsheets (JC, JPF, JM, RP, JS), pp. 459–478.
ICFPICFP-2013-CheneyLW
A practical theory of language-integrated query (JC, SL, PW), pp. 403–416.
ICFPICFP-2013-HidakaAHKN #graph #order #recursion
Structural recursion for querying ordered graphs (SH, KA, ZH, HK, KN), pp. 305–318.
CHICHI-2013-AgapieGQ #people
Leading people to longer queries (EA, GG, PQ), pp. 3019–3022.
CHICHI-2013-MonroeLOSPM #approach #challenge #specification #visual notation
The challenges of specifying intervals and absences in temporal queries: a graphical language approach (MM, RL, JMdO, BS, CP, JM), pp. 2349–2358.
HCIDUXU-WM-2013-Kim13a #analysis
Analysis of Query Entries of a Job Search Engine (YK), pp. 203–211.
HCIHCI-IMT-2013-WuOMS #design #information management #visual notation
Design of a Visual Query Language for Geographic Information System on a Touch Screen (SW, SO, GM, MS), pp. 530–539.
HCIHIMI-D-2013-NitscheN13a #named
QUEST: Querying Complex Information by Direct Manipulation (MN, AN), pp. 240–249.
ICEISICEIS-J-2013-RudraGA13a #approximate
Estimating Sufficient Sample Sizes for Approximate Decision Support Queries (AR, RPG, NRA), pp. 85–99.
ICEISICEIS-v1-2013-IsmailHQDE #clustering #evaluation #simulation #using
Clustering using Hypergraph for P2P Query Routing — Simulation and Evaluation (AI, MH, MQ, ND, MES), pp. 247–254.
ICEISICEIS-v1-2013-MagalhaesMVMMPC #distributed #linked data #named #open data
QEF-LD — A Query Engine for Distributed Query Processing on Linked Data (RPM, JMM, VMPV, JAFdM, MM, FP, MAC), pp. 185–192.
ICEISICEIS-v1-2013-RudraGA #approximate
Selecting Adequate Samples for Approximate Decision Support Queries (AR, RPG, NRA), pp. 46–55.
CIKMCIKM-2013-AyadiTDJH #correlation #image #modelling #retrieval #using
Correlating medical-dependent query features with image retrieval models using association rules (HA, MT, MD, MBJ, JXH), pp. 299–308.
CIKMCIKM-2013-ChenCC #network
Spatial-temporal query homogeneity for KNN object search on road networks (YJC, KTC, MSC), pp. 1019–1028.
CIKMCIKM-2013-FiondaP #graph
Querying graphs with preferences (VF, GP), pp. 929–938.
CIKMCIKM-2013-GhoreishiS #predict
Predicting event-relatedness of popular queries (SNG, AS), pp. 1193–1196.
CIKMCIKM-2013-Lian0 #database #nondeterminism #probability
Causality and responsibility: probabilistic queries revisited in uncertain databases (XL, LC), pp. 349–358.
CIKMCIKM-2013-MullangiR #named #performance #reachability #scalability
SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies (PRM, LR), pp. 799–804.
CIKMCIKM-2013-PalBP #named
RCached-tree: an index structure for efficiently answering popular queries (MP, AB, DP), pp. 1173–1176.
CIKMCIKM-2013-ParikhSH #on the #segmentation
On segmentation of eCommerce queries (NP, PS, MAH), pp. 1137–1146.
CIKMCIKM-2013-QianSYZL #mining
Dynamic query intent mining from a search log stream (YnQ, TS, JY, QZ, CL), pp. 1205–1208.
CIKMCIKM-2013-StrotgenG #proximity #ranking
Proximity2-aware ranking for textual, temporal, and geographic queries (JS, MG), pp. 739–744.
CIKMCIKM-2013-SymondsZKBS #perspective
Term associations in query expansion: a structural linguistic perspective (MS, GZ, BK, PB, LS), pp. 1189–1192.
CIKMCIKM-2013-TeymorianFM #distributed #energy
Rank-energy selective query forwarding for distributed search systems (AYT, OF, MAM), pp. 389–398.
CIKMCIKM-2013-ThostVS #recommendation
Query matching for report recommendation (VT, KV, DS), pp. 1391–1400.
CIKMCIKM-2013-TianCZ #approach #database #hybrid #mobile #privacy
A hybrid approach for privacy-preserving processing of knn queries in mobile database systems (ST, YC, QZ), pp. 1161–1164.
CIKMCIKM-2013-Zhang0D #corpus #mining
Mining a search engine’s corpus without a query pool (MZ, NZ, GD), pp. 29–38.
ECIRECIR-2013-0001S #game studies #refinement
Comparing Crowd-Based, Game-Based, and Machine-Based Approaches in Initial Query and Query Refinement Tasks (CGH, PS), pp. 495–506.
ECIRECIR-2013-CarpinetoR #concept #graph #semantics
Semantic Search Log k-Anonymization with Generalized k-Cores of Query Concept Graph (CC, GR), pp. 110–121.
ECIRECIR-2013-FreireMTOC #hybrid #scheduling
Hybrid Query Scheduling for a Replicated Search Engine (AF, CM, NT, IO, FC), pp. 435–446.
ECIRECIR-2013-KumarC #feedback #twitter
Time Based Feedback and Query Expansion for Twitter Search (NK, BAC), pp. 734–737.
ECIRECIR-2013-LimsopathamMO13a #documentation #representation
A Task-Specific Query and Document Representation for Medical Records Search (NL, CM, IO), pp. 747–751.
ECIRECIR-2013-PCK #problem #repository
Query Suggestions for Textual Problem Solution Repositories (DP, SC, DK), pp. 569–581.
ECIRECIR-2013-Ramirez #named #retrieval
WANTED: Focused Queries for Focused Retrieval (GR), pp. 788–791.
ECIRECIR-2013-ZhuGCLN #graph #recommendation
Recommending High Utility Query via Session-Flow Graph (XZ, JG, XC, YL, WN), pp. 642–655.
KDDKDD-2013-ChenLYSY #clustering #optimisation
Query clustering based on bid landscape for sponsored search auction optimization (YC, WL, JY, AS, TWY), pp. 1150–1158.
KDDKDD-2013-WangY #learning
Querying discriminative and representative samples for batch mode active learning (ZW, JY), pp. 158–166.
KDDKDD-2013-ZhuXWL #distance #graph #performance #scalability
Efficient single-source shortest path and distance queries on large graphs (ADZ, XX, SW, WL), pp. 998–1006.
KDIRKDIR-KMIS-2013-MeiselBI #mining
Mining the Long Tail of Search Queries — Finding Profitable Patterns (MM, MB, AI), pp. 225–229.
RecSysRecSys-2013-VahabiALBL #orthogonal #recommendation
Orthogonal query recommendation (HV, MA, DL, RABY, ALO), pp. 33–40.
SIGIRSIGIR-2013-AzzopardiKB #behaviour #how
How query cost affects search behavior (LA, DK, KB), pp. 23–32.
SIGIRSIGIR-2013-DemidovaZN #performance #scalability
Efficient query construction for large scale data (ED, XZ, WN), pp. 573–582.
SIGIRSIGIR-2013-DimopoulosNS #performance
A candidate filtering mechanism for fast top-k query processing on modern cpus (CD, SN, TS), pp. 723–732.
SIGIRSIGIR-2013-Efron #information retrieval #representation
Query representation for cross-temporal information retrieval (ME), pp. 383–392.
SIGIRSIGIR-2013-FeildA #recommendation
Task-aware query recommendation (HAF, JA), pp. 83–92.
SIGIRSIGIR-2013-FreitasFOC #approach #graph #linked data #natural language #open data #semantics
Answering natural language queries over linked data graphs: a distributional semantics approach (AF, FFdF, SO, EC), pp. 1107–1108.
SIGIRSIGIR-2013-GaoCLC #comprehension #towards
Mapping queries to questions: towards understanding users’ information needs (YG, LC, RL, GC), pp. 977–980.
SIGIRSIGIR-2013-GaoXX #random #using
Query expansion using path-constrained random walks (JG, GX, JX), pp. 563–572.
SIGIRSIGIR-2013-GuanZY
Utilizing query change for session search (DG, SZ, HY), pp. 453–462.
SIGIRSIGIR-2013-Hasibi
Indexing and querying overlapping structures (FH), p. 1144.
SIGIRSIGIR-2013-HassanWW #self #towards #using
Toward self-correcting search engines: using underperforming queries to improve search (AHA, RWW, YMW), pp. 263–272.
SIGIRSIGIR-2013-HeBV #multi
Characterizing stages of a multi-session complex search task through direct and indirect query modifications (JH, MB, APdV), pp. 897–900.
SIGIRSIGIR-2013-HuangGCHC
Commodity query by snapping (HH, YG, KC, QH, LC), pp. 985–988.
SIGIRSIGIR-2013-JiangJH #fault #how
How do users respond to voice input errors?: lexical and phonetic query reformulation in voice search (JJ, WJ, DH), pp. 143–152.
SIGIRSIGIR-2013-KharitonovMSO #evaluation #metric #modelling
User model-based metrics for offline query suggestion evaluation (EK, CM, PS, IO), pp. 633–642.
SIGIRSIGIR-2013-KongA
Extracting query facets from search results (WK, JA), pp. 93–102.
SIGIRSIGIR-2013-Leveling #coordination #generative
Interpretation of coordinations, compound generation, and result fusion for query variants (JL), pp. 805–808.
SIGIRSIGIR-2013-Limsopatham #comprehension #framework
A query and patient understanding framework for medical records search (NL), p. 1145.
SIGIRSIGIR-2013-MahdabiGHC #ambiguity #concept #proximity #retrieval #using
Leveraging conceptual lexicon: query disambiguation using proximity information for patent retrieval (PM, SG, JXH, FC), pp. 113–122.
SIGIRSIGIR-2013-MaxwellC #topic #using
Compact query term selection using topically related text (KTM, WBC), pp. 583–592.
SIGIRSIGIR-2013-MiyanishiS
Time-aware structured query suggestion (TM, TS), pp. 809–812.
SIGIRSIGIR-2013-QvarfordtGDA
Looking ahead: query preview in exploratory search (PQ, GG, TD, EA), pp. 243–252.
SIGIRSIGIR-2013-RossiMCS #performance #using
Fast document-at-a-time query processing using two-tier indexes (CR, ESdM, ALC, ASdS), pp. 183–192.
SIGIRSIGIR-2013-Shokouhi #learning #personalisation
Learning to personalize query auto-completion (MS), pp. 103–112.
SIGIRSIGIR-2013-SondakSK #predict
Estimating query representativeness for query-performance prediction (MS, AS, OK), pp. 853–856.
SIGIRSIGIR-2013-WestWH #predict #process
Here and there: goals, activities, and predictions about location from geotagged queries (RW, RWW, EH), pp. 817–820.
SIGIRSIGIR-2013-YangWH
Pursuing insights about healthcare utilization via geocoded search queries (SHY, RWW, EH), pp. 993–996.
SIGIRSIGIR-2013-ZhangGY #feedback
Query change as relevance feedback in session search (SZ, DG, HY), pp. 821–824.
ECMFAECMFA-2013-Storrle #ad hoc #declarative #named
MOCQL: A Declarative Language for Ad-Hoc Model Querying (HS), pp. 3–19.
ICMTICMT-2013-Horn
Model Querying with FunnyQT — (TH), pp. 56–57.
MODELSMoDELS-2013-SemerathHV #constraints #domain-specific language #graph #validation
Validation of Derived Features and Well-Formedness Constraints in DSLs — By Mapping Graph Queries to an SMT-Solver (OS, ÁH, DV), pp. 538–554.
PLDIPLDI-2013-CheungSM #optimisation #synthesis
Optimizing database-backed applications with query synthesis (AC, ASL, SM), pp. 3–14.
ASEASE-2013-DietrichCS #effectiveness #learning #requirements #retrieval
Learning effective query transformations for enhanced requirements trace retrieval (TD, JCH, YS), pp. 586–591.
ASEASE-2013-IzsoSBHR #graph #metric #performance #precise #predict #towards
Towards precise metrics for predicting graph query performance (BI, ZS, GB, ÁH, IR), pp. 421–431.
ASEASE-2013-ZhangS #automation #sql
Automatically synthesizing SQL queries from input-output examples (SZ, YS), pp. 224–234.
ICSEICSE-2013-HaiducBMOLM #automation #re-engineering #retrieval
Automatic query reformulations for text retrieval in software engineering (SH, GB, AM, RO, ADL, TM), pp. 842–851.
ICSEICSE-2013-HaiducRBOLM #code search #predict #quality #source code
Query quality prediction and reformulation for source code search: the refoqus tool (SH, GDR, GB, RO, ADL, AM), pp. 1307–1310.
ICSEICSE-2013-SmitSSL #development #in the cloud
Supporting application development with structured queries in the cloud (MS, BS, MS, ML), pp. 1213–1216.
SACSAC-2013-BellatrecheBCM #algorithm #clustering #incremental
Horizontal partitioning of very-large data warehouses under dynamically-changing query workloads via incremental algorithms (LB, RB, AC, SM), pp. 208–210.
SACSAC-2013-BlancoR #recommendation
Inferring user utility for query revision recommendation (HB, FR), pp. 245–252.
SACSAC-2013-CamposFHV #personalisation #ranking #using #xml
XML search personalization strategies using query expansion, reranking and a search engine modification (LMdC, JMFL, JFH, EVL), pp. 872–877.
SACSAC-2013-CeccarelliGLNP #recommendation #semantics
When entities meet query recommender systems: semantic search shortcuts (DC, SG, CL, FMN, RP), pp. 933–938.
SACSAC-2013-HalderC #database #slicing
Abstract program slicing of database query languages (RH, AC), pp. 838–845.
SACSAC-2013-MaiaB #modelling #network #performance #predict
Sensor-field modeling based on in-network data prediction: an efficient strategy for answering complex queries in wireless sensor networks (JEBM, AB), pp. 554–559.
SACSAC-2013-OyamadaKK #concurrent
Continuous query processing with concurrency control: reading updatable resources consistently (MO, HK, HK), pp. 788–794.
SACSAC-2013-TheodouliG #adaptation #data-driven #web #web service
Adaptive memory-aware chunk sizing techniques for data-intensive queries over web services (AT, AG), pp. 826–831.
SACSAC-2013-UmemotoYNT #behaviour #predict
Predicting query reformulation type from user behavior (KU, TY, SN, KT), pp. 894–901.
HPDCHPDC-2013-LakshminarasimhanBPZJVPS #encoding #scalability
Scalable in situ scientific data encoding for analytical query processing (SL, DABI, SVP, XZ, JJ, VV, MEP, NFS), pp. 1–12.
PDPPDP-2013-PetridesDCT #database #manycore #performance #scalability
Scalability and Efficiency of Database Queries on Future Many-Core Systems (PP, AD, CC, PT), pp. 24–28.
STOCSTOC-2013-Ullman #difference #privacy
Answering n{2+o(1)} counting queries with differential privacy is hard (JU), pp. 361–370.
CAVCAV-2013-UhlerD #automation #named #smt #symbolic computation
Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries (RU, ND), pp. 678–683.
LICSLICS-2013-FereeHG #complexity #on the
On the Query Complexity of Real Functionals (HF, MH, WG), pp. 103–112.
LICSLICS-2013-Fontaine #consistency #question #why
Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? (GF), pp. 550–559.
HTHT-2012-HartigF #execution #linked data #open data #traversal
Foundations of traversal based query execution over linked data (OH, JCF), pp. 43–52.
HTHT-2012-HartigH #linked data #modelling #open data #predict
Query prediction with context models for populating personal linked data caches (OH, TH), pp. 325–326.
JCDLJCDL-2012-TanapaisankitWS #personalisation
Personalized query expansion in the QIC system (PT, LWd, MS), pp. 259–262.
PODSPODS-2012-BarceloLR #approximate #performance
Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.
PODSPODS-2012-KostylevRS #classification
Classification of annotation semirings over query containment (EVK, JLR, AZS), pp. 237–248.
PODSPODS-2012-LetelierPPS #optimisation #semantics #static analysis #web
Static analysis and optimization of semantic web queries (AL, JP, RP, SS), pp. 89–100.
SIGMODSIGMOD-2012-0002S #optimisation
Holistic optimization by prefetching query results (KR, SS), pp. 133–144.
SIGMODSIGMOD-2012-AlagiannisBBIA #execution #named #performance
NoDB: efficient query execution on raw data files (IA, RB, MB, SI, AA), pp. 241–252.
SIGMODSIGMOD-2012-ChengKCC #approach #distance #graph #performance #scalability
Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.
SIGMODSIGMOD-2012-FanLWW #graph
Query preserving graph compression (WF, JL, XW, YW), pp. 157–168.
SIGMODSIGMOD-2012-GhazalSCA #adaptation #optimisation #recursion
Adaptive optimizations of recursive queries in teradata (AG, DYS, AC, MAK), pp. 851–860.
SIGMODSIGMOD-2012-JinRXL #approach #distance #graph #scalability
A highway-centric labeling approach for answering distance queries on large sparse graphs (RJ, NR, YX, VEL), pp. 445–456.
SIGMODSIGMOD-2012-KokkalisVZSKI #named
Logos: a system for translating queries into narratives (AK, PV, AZ, AS, GK, YEI), pp. 673–676.
SIGMODSIGMOD-2012-MeliouS #database #named
Tiresias: the database oracle for how-to queries (AM, DS), pp. 337–348.
SIGMODSIGMOD-2012-MeliouSS #named
Tiresias: a demonstration of how-to queries (AM, YS, DS), pp. 709–712.
SIGMODSIGMOD-2012-OrdonezGC #optimisation #sql
Dynamic optimization of generalized SQL queries with horizontal aggregations (CO, JGG, ZC), pp. 637–640.
SIGMODSIGMOD-2012-ShankarNACEHRSDG #optimisation #sql
Query optimization in microsoft SQL server PDW (SS, RVN, JAS, AC, ME, AH, ER, MSS, DJD, CAGL), pp. 767–776.
SIGMODSIGMOD-2012-SidlauskasSJ #in memory #parallel
Parallel main-memory indexing for moving-object query and update workloads (DS, SS, CSJ), pp. 37–48.
SIGMODSIGMOD-2012-SinghNJ #agile #named #relational
Skimmer: rapid scrolling of relational query results (MS, AN, HVJ), pp. 181–192.
SIGMODSIGMOD-2012-YuAY #scalability
Processing a large number of continuous preference top-k queries (AY, PKA, JY), pp. 397–408.
TPDLTPDL-2012-KapidakisMP #using
Query Expansion of Zero-Hit Subject Searches: Using a Thesaurus in Conjunction with NLP Techniques (SK, AM, MP), pp. 433–438.
TPDLTPDL-2012-LukeSM #retrieval
Improving Retrieval Results with Discipline-Specific Query Expansion (TL, PS, PM), pp. 408–413.
VLDBVLDB-2012-AbouziedHS #specification
Playful Query Specification with DataPlay (AA, JMH, AS), pp. 1938–1941.
VLDBVLDB-2012-AgarwalPMIMS #interactive #scalability
Blink and It’s Done: Interactive Queries on Very Large Data (SA, AP, BM, API, SM, IS), pp. 1902–1905.
VLDBVLDB-2012-AlagiannisBBIA #adaptation
NoDB in Action: Adaptive Query Processing on Raw Data (IA, RB, MB, SI, AA), pp. 1942–1945.
VLDBVLDB-2012-AlyAO
Spatial Queries with Two kNN Predicates (AMA, WGA, MO), pp. 1100–1111.
VLDBVLDB-2012-BakibayevOZ #database #named #relational
FDB: A Query Engine for Factorised Relational Databases (NB, DO, JZ), pp. 1232–1243.
VLDBVLDB-2012-BakibayevOZ12a #database
Demonstration of the FDB Query Engine for Factorised Databases (NB, DO, JZ), pp. 1950–1953.
VLDBVLDB-2012-BaranyCO
Queries with Guarded Negation (VB, BtC, MO), pp. 1328–1339.
VLDBVLDB-2012-BenediktBL #strict
Querying Schemas With Access Restrictions (MB, PB, CL), pp. 634–645.
VLDBVLDB-2012-CautisK #complexity #probability #using #xml
Answering Queries using Views over Probabilistic XML: Complexity and Tractability (BC, EK), pp. 1148–1159.
VLDBVLDB-2012-ChubakR #performance
Efficient Indexing and Querying over Syntactically Annotated Trees (PC, DR), pp. 1316–1327.
VLDBVLDB-2012-FanWW #distributed #performance #reachability
Performance Guarantees for Distributed Reachability Queries (WF, XW, YW), pp. 1304–1315.
VLDBVLDB-2012-GawadeK #analysis #execution #framework #interactive #named #platform #visual notation
Stethoscope: A platform for interactive visual analysis of query execution plans (MG, MLK), pp. 1926–1929.
VLDBVLDB-2012-GiannikisAK #named
SharedDB: Killing One Thousand Queries With One Stone (GG, GA, DK), pp. 526–537.
VLDBVLDB-2012-LiKNC #estimation #robust #sql #statistics #using
Robust Estimation of Resource Consumption for SQL Queries using Statistical Techniques (JL, ACK, VRN, SC), pp. 1555–1566.
VLDBVLDB-2012-LiM #adaptation #difference #privacy
An Adaptive Mechanism for Accurate Query Answering under Differential Privacy (CL, GM), pp. 514–525.
VLDBVLDB-2012-PapapetrouGD #data type #distributed #sketching
Sketch-based Querying of Distributed Sliding-Window Data Streams (OP, MNG, AD), pp. 992–1003.
VLDBVLDB-2012-PimplikarS #keyword #using #web
Answering Table Queries on the Web using Column Keywords (RP, SS), pp. 908–919.
VLDBVLDB-2012-Shirani-MehrKS #dataset #evaluation #performance #reachability #scalability
Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets (HSM, FBK, CS), pp. 848–859.
VLDBVLDB-2012-TaliusDDK #fault #transaction
Transaction Log Based Application Error Recovery and Point In-Time Query (TT, RD, AD, HK), pp. 1781–1789.
VLDBVLDB-2012-TauheedHSMA #named
SCOUT: Prefetching for Latent Feature Following Queries (FT, TH, FS, HM, AA), pp. 1531–1542.
VLDBVLDB-2012-WenzelEMK
Complex Preference Queries Supporting Spatial Applications for User Groups (FW, ME, SM, WK), pp. 1946–1949.
VLDBVLDB-2012-WuMS
A Demonstration of DBWipes: Clean as You Query (EW, SM, MS), pp. 1894–1897.
VLDBVLDB-2012-WuXDCZZ #distance #evaluation #network
Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation (LW, XX, DD, GC, ADZ, SZ), pp. 406–417.
VLDBVLDB-2012-XuG
Manage and Query Generic Moving Objects in SECONDO (JX, RHG), pp. 2002–2005.
VLDBVLDB-2012-XuTW #database #energy #named #optimisation
PET: Reducing Database Energy Cost via Query Optimization (ZX, YCT, XW), pp. 1954–1957.
VLDBVLDB-2012-YuanZWXYH #difference #optimisation #privacy #rank
Low-Rank Mechanism: Optimizing Batch Queries under Differential Privacy (GY, ZZ, MW, XX, YY, ZH), pp. 1352–1363.
VLDBVLDB-2012-ZengJZ #logic
Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data (QZ, XJ, HZ), pp. 728–739.
VLDBVLDB-2013-CalvaneseGLV12 #database #graph #relational
Query Processing under GLAV Mappings for Relational and Graph Databases (DC, GDG, ML, MYV), pp. 61–72.
VLDBVLDB-2013-MouratidisP12
Computing Immutable Regions for Subspace Top-k Queries (KM, HP), pp. 73–84.
ICPCICPC-2012-NogueraRKJ #uml
Code querying by UML (CN, CDR, AK, VJ), pp. 229–238.
WCREWCRE-2012-KimF #android #named
AQUA: Android QUery Analyzer (CJK, PF), pp. 395–404.
ICALPICALP-v1-2012-FarzanMR #orthogonal
Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (AF, JIM, RR), pp. 327–338.
ICALPICALP-v1-2012-JefferyKM #complexity #graph #matrix #multi #quantum #using
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.
ICALPICALP-v2-2012-KikotKPZ #bound #exponential
Exponential Lower Bounds and Separation for Query Rewriting (SK, RK, VVP, MZ), pp. 263–274.
FLOPSFLOPS-2012-RoseVS #data flow #hybrid #programming language
A Data Flow Language for Hybrid Query and Programming Languages (KHR, LV, NS), pp. 228–242.
CHICHI-2012-BernsteinTDLH
Direct answers for search queries in the long tail (MSB, JT, STD, DJL, EH), pp. 237–246.
ICEISICEIS-v1-2012-Ali #data flow #integration #optimisation #web
Optimizing Data Integration Queries over Web Data Sources (OPTIQ) (MIA), pp. 163–168.
ICEISICEIS-v1-2012-HudecS #fuzzy #set
Construction of Fuzzy Sets and Applying Aggregation Operators for Fuzzy Queries (MH, FS), pp. 253–258.
ICEISICEIS-v1-2012-KosorusBK #semantics #similarity #taxonomy #using
Semantic Similarity between Queries in QA System using a Domain-specific Taxonomy (HK, AB, JK), pp. 241–246.
ICEISICEIS-v1-2012-RudraGA #approximate #performance
An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries (AR, RPG, NA), pp. 16–26.
CIKMCIKM-2012-AltingovdeBCOSU #web
Characterizing web search queries that match very few or no results (ISA, RB, BBC, RO, ES, ÖU), pp. 2000–2004.
CIKMCIKM-2012-ArvanitisDV #performance #research
Efficient influence-based processing of market research queries (AA, AD, YV), pp. 1193–1202.
CIKMCIKM-2012-BalogN12a #identification
Hierarchical target type identification for entity-oriented queries (KB, RN), pp. 2391–2394.
CIKMCIKM-2012-BaoKWZS #performance #relational
Efficient provenance storage for relational queries (ZB, HK, LW, XZ, SWS), pp. 1352–1361.
CIKMCIKM-2012-BarbosaPG #algorithm
Generically extending anonymization algorithms to deal with successive queries (MB, AP, BG), pp. 1362–1371.
CIKMCIKM-2012-BhatiaHHS #approach #scalability
A scalable approach for performing proximal search for verbose patent search queries (SB, BH, QH, WSS), pp. 2603–2606.
CIKMCIKM-2012-ChengTH #database #effectiveness #keyword #predict
Predicting the effectiveness of keyword queries on databases (SC, AT, VH), pp. 1213–1222.
CIKMCIKM-2012-ChoiLKLM #named #parallel #xml
HadoopXML: a suite for parallel processing of massive XML data with multiple twig pattern queries (HC, KHL, SHK, YJL, BM), pp. 2737–2739.
CIKMCIKM-2012-DangKT #web
Domain dependent query reformulation for web search (VD, GK, ADT), pp. 1045–1054.
CIKMCIKM-2012-DuanKZ #empirical #representation
Click patterns: an empirical representation of complex query intents (HD, EK, CZ), pp. 1035–1044.
CIKMCIKM-2012-EmrichKNRSZ #graph #monte carlo #nondeterminism #probability
Exploration of monte-carlo based probabilistic query processing in uncertain graphs (TE, HPK, JN, MR, AS, AZ), pp. 2728–2730.
CIKMCIKM-2012-GollapudiIK
Structured query reformulations in commerce search (SG, SI, AK), pp. 1890–1894.
CIKMCIKM-2012-HagenPBS #segmentation #towards
Towards optimum query segmentation: in doubt without (MH, MP, AB, BS), pp. 1015–1024.
CIKMCIKM-2012-HanFJ
Schema-free structured querying of DBpedia data (LH, TF, AJ), pp. 2090–2093.
CIKMCIKM-2012-HasanMTK
Diversifying query results on semi-structured data (MH, AM, VJT, EJK), pp. 2099–2103.
CIKMCIKM-2012-HuangLTF #keyword #performance
Efficient safe-region construction for moving top-K spatial keyword queries (WH, GL, KLT, JF), pp. 932–941.
CIKMCIKM-2012-JiangHHYN #evaluation #simulation
Contextual evaluation of query reformulations in a search session by user simulation (JJ, DH, SH, ZY, CN), pp. 2635–2638.
CIKMCIKM-2012-JinCKLZ #protocol
A filter-based protocol for continuous queries over imprecise location data (YJ, RC, BK, KyL, YZ), pp. 365–374.
CIKMCIKM-2012-KanhabuaN #learning #rank
Learning to rank search results for time-sensitive queries (NK, KN), pp. 2463–2466.
CIKMCIKM-2012-KanhabuaN12a #predict #retrieval
Estimating query difficulty for news prediction retrieval (NK, KN), pp. 2623–2626.
CIKMCIKM-2012-KimYK #equation #retrieval #using #word
Mathematical equation retrieval using plain words as a query (SK, SY, YK), pp. 2407–2410.
CIKMCIKM-2012-KustarevUMS #performance #predict
Session-based query performance prediction (AK, YU, AM, PS), pp. 2563–2566.
CIKMCIKM-2012-Lehrack #database #probability
Applying weighted queries on probabilistic databases (SL), pp. 2209–2213.
CIKMCIKM-2012-LiKBCL #approach #named #probability #recommendation
DQR: a probabilistic approach to diversified query recommendation (RL, BK, BB, RC, EL), pp. 16–25.
CIKMCIKM-2012-LinXCB #algorithm #performance
Efficient algorithms for generalized subgraph query processing (WL, XX, JC, SSB), pp. 325–334.
CIKMCIKM-2012-LiuFCW #enterprise
Entity centric query expansion for enterprise search (XL, HF, FC, MW), pp. 1955–1959.
CIKMCIKM-2012-LiWXCS #network #social
Spatial-aware interest group queries in location-based social networks (YL, DW, JX, BC, WS), pp. 2643–2646.
CIKMCIKM-2012-LowZ #matrix #performance #similarity
Fast top-k similarity queries via matrix compression (YL, AXZ), pp. 2070–2074.
CIKMCIKM-2012-LvZ #generative
Query likelihood with negative query generation (YL, CZ), pp. 1799–1803.
CIKMCIKM-2012-MacdonaldSO #learning #on the #rank
On the usefulness of query features for learning to rank (CM, RLTS, IO), pp. 2559–2562.
CIKMCIKM-2012-MarkovitsSKC #performance #predict #retrieval
Predicting query performance for fusion-based retrieval (GM, AS, OK, DC), pp. 813–822.
CIKMCIKM-2012-NuttR #database #sql
Completeness of queries over SQL databases (WN, SR), pp. 902–911.
CIKMCIKM-2012-OliveiraGBBAZG #automation #recommendation
Automatic query expansion based on tag recommendation (VCdO, GdCMG, FB, WCB, JMA, NZ, MAG), pp. 1985–1989.
CIKMCIKM-2012-OrangS #approach #correlation #nondeterminism #probability
A probabilistic approach to correlation queries in uncertain time series data (MO, NS), pp. 2229–2233.
CIKMCIKM-2012-PanZ #correlation #data type #graph #named
CGStream: continuous correlated graph query for data streams (SP, XZ), pp. 1183–1192.
CIKMCIKM-2012-PanZ12a #graph
Continuous top-k query for graph streams (SP, XZ), pp. 2659–2662.
CIKMCIKM-2012-PoundHIW #keyword #knowledge base #web
Interpreting keyword queries over web knowledge bases (JP, AKH, IFI, GEW), pp. 305–314.
CIKMCIKM-2012-SakrEH #graph #hybrid #named #scalability
G-SPARQL: a hybrid engine for querying large attributed graphs (SS, SE, YH), pp. 335–344.
CIKMCIKM-2012-ShiMWG #in the cloud #online
You can stop early with COLA: online processing of aggregate queries in the cloud (YS, XM, FW, YG), pp. 1223–1232.
CIKMCIKM-2012-SouihliS #predict #probability #xml
Demonstrating ProApproX 2.0: a predictive query engine for probabilistic XML (AS, PS), pp. 2734–2736.
CIKMCIKM-2012-StuparM
Being picky: processing top-k queries with set-defined selections (AS, SM), pp. 912–921.
CIKMCIKM-2012-SunSL #learning #multi #performance
Fast multi-task learning for query spelling correction (XS, AS, PL), pp. 285–294.
CIKMCIKM-2012-TeymorianQF #distributed #energy #named
RESQ: rank-energy selective query forwarding for distributed search systems (AYT, XQ, OF), pp. 2579–2582.
CIKMCIKM-2012-TorresHWS #recommendation
Query recommendation for children (SDT, DH, IW, PS), pp. 2010–2014.
CIKMCIKM-2012-VouzoukidouAC
Processing continuous text queries featuring non-homogeneous scoring functions (NV, BA, VC), pp. 1065–1074.
CIKMCIKM-2012-YamamotoSIYWT #clustering #mining
The wisdom of advertisers: mining subgoals via query clustering (TY, TS, MI, CY, JRW, KT), pp. 505–514.
CIKMCIKM-2012-YanZN12a #nearest neighbour
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces (DY, ZZ, WN), pp. 942–951.
CIKMCIKM-2012-YueJHH #analysis #collaboration #web
Where do the query terms come from?: an analysis of query reformulation in collaborative web search (ZY, JJ, SH, DH), pp. 2595–2598.
CIKMCIKM-2012-YungLY #authentication
Authentication of moving range queries (DY, EL, MLY), pp. 1372–1381.
CIKMCIKM-2012-YuR #identification
Role-explicit query identification and intent role annotation (HY, FR), pp. 1163–1172.
CIKMCIKM-2012-ZhengWLS #database #ontology #semantics
Enabling ontology based semantic queries in biomedical database systems (SZ, FW, JJL, JHS), pp. 2651–2654.
CIKMCIKM-2012-ZhouLZ12a #collaboration #ranking
Collaborative ranking: improving the relevance for tail queries (KZ, XL, HZ), pp. 1900–1904.
CIKMCIKM-2012-ZhuGCL #behaviour #mining #recommendation
More than relevance: high utility query recommendation by mining users’ search behaviors (XZ, JG, XC, YL), pp. 1814–1818.
ECIRECIR-2012-AlbakourKNASFR #analysis #web
Analysis of Query Reformulations in a Search Engine of a Local Web Site (MDA, UK, NN, IA, DS, MF, ANDR), pp. 517–521.
ECIRECIR-2012-AliciAOCU #adaptation #web
Adaptive Time-to-Live Strategies for Query Result Caching in Web Search Engines (SA, ISA, RO, BBC, ÖU), pp. 401–412.
ECIRECIR-2012-BortnikovDKL #modelling #transaction
Modeling Transactional Queries via Templates (EB, PD, AK, RL), pp. 13–24.
ECIRECIR-2012-BoudinND #predict #using
Using a Medical Thesaurus to Predict Query Difficulty (FB, JYN, MD), pp. 480–484.
ECIRECIR-2012-ChelaruAS
Analyzing the Polarity of Opinionated Queries (SC, ISA, SS), pp. 463–467.
ECIRECIR-2012-DiriyeKH #interactive #web
Interactive Search Support for Difficult Web Queries (AD, GK, JH), pp. 37–49.
ECIRECIR-2012-DiriyeTB #interactive #process
A Little Interaction Can Go a Long Way: Enriching the Query Formulation Process (AD, AT, AB), pp. 531–534.
ECIRECIR-2012-HarveyE #email
Exploring Query Patterns in Email Search (MH, DE), pp. 25–36.
ECIRECIR-2012-HollinkHV
Explaining Query Modifications — An Alternative Interpretation of Term Addition and Removal (VH, JH, APdV), pp. 1–12.
ECIRECIR-2012-MantrachR12a #multi #using
A Mailbox Search Engine Using Query Multi-modal Expansion and Community-Based Smoothing (AM, JMR), pp. 576–577.
ECIRECIR-2012-NawabSC #documentation #using
Retrieving Candidate Plagiarised Documents Using Query Expansion (RMAN, MS, PDC), pp. 207–218.
ECIRECIR-2012-PeetzMRW #adaptation #modelling
Adaptive Temporal Query Modeling (MHP, EM, MdR, WW), pp. 455–458.
ECIRECIR-2012-ZhouCHLJ #predict #web
Assessing and Predicting Vertical Intent for Web Queries (KZ, RC, MH, ML, JMJ), pp. 499–502.
ICPRICPR-2012-CaoCZL #clustering
Locating high-density clusters with noisy queries (CC, SC, CZ, JL), pp. 3537–3540.
ICPRICPR-2012-GuoWYLG
Query by humming via hierarchical filters (ZG, QW, LY, GL, JG), pp. 3021–3024.
ICPRICPR-2012-PanZF #correlation #data type
Top-k correlated subgraph query for data streams (SP, XZ, MF), pp. 2906–2909.
ICPRICPR-2012-WangGLLG #multi
Tempo variation based multilayer filters for query by humming (QW, ZG, BL, GL, JG), pp. 3034–3037.
ICPRICPR-2012-YangGAZW #classification #clustering
Iterative clustering and support vectors-based high-confidence query selection for motor imagery EEG signals classification (HY, CG, KKA, HZ, CW), pp. 2169–2172.
KDDKDD-2012-BawabMC #personalisation #recommendation #topic
Finding trending local topics in search queries for personalization of a recommendation system (ZAB, GHM, JFC), pp. 397–405.
KDDKDD-2012-YangSLC #network #on the #social
On socio-spatial group query for location-based social networks (DNY, CYS, WCL, MSC), pp. 949–957.
KDIRKDIR-2012-ZanonACG #algorithm
A New Query Suggestion Algorithm for Taxonomy-based Search Engines (RZ, SA, MC, IG), pp. 151–156.
KEODKEOD-2012-AygulCC #multi #natural language #ontology
Natural Language Query Processing in Multimedia Ontologies (FAA, NKC, IC), pp. 66–75.
KEODKEOD-2012-MatskanisAMMR #approach #linked data #open data #research
A Linked Data Approach for Querying Heterogeneous Sources — Assisting Researchers in Finding Answers to Complex Clinical Questions (NM, VA, PM, KM, JR), pp. 411–414.
KRKR-2012-BienvenuLW #logic
Query Containment in Description Logics Reconsidered (MB, CL, FW).
KRKR-2012-CalvaneseOSS #complexity
The Complexity of Explaining Negative Query Answers in DL-Lite (DC, MO, MS, GS).
KRKR-2012-GottlobS #datalog #ontology #recursion #source code
Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
KRKR-2012-GrauHKKMMW #logic
Acyclicity Conditions and their Application to Query Answering in Description Logics (BCG, IH, MK, CK, DM, BM, ZW).
KRKR-2012-KikotKZ #owl
Conjunctive Query Answering with OWL 2 QL (SK, RK, MZ).
KRKR-2012-LutzW #complexity #logic
Non-Uniform Data Complexity of Query Answering in Description Logics (CL, FW).
KRKR-2012-Rodriguez-MuroC #ontology #performance
High Performance Query Answering over DL-Lite Ontologies (MRM, DC).
KRKR-2012-ThomazoBMR #algorithm #set
A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).
KRKR-2012-WuHTW #knowledge base
Assertion Absorption in Object Queries over Knowledge Bases (JW, AKH, DT, GEW).
SIGIRSIGIR-2012-AdeyanjuSAKRF #adaptation #concept #recommendation
Adaptation of the concept hierarchy model with search logs for query recommendation on intranets (IAA, DS, MDA, UK, ANDR, MF), pp. 5–14.
SIGIRSIGIR-2012-AlasiryLP #detection
Detecting candidate named entities in search queries (AA, ML, AP), pp. 1049–1050.
SIGIRSIGIR-2012-BenderskyC #dependence #higher-order #information retrieval #modelling #using
Modeling higher-order term dependencies in information retrieval using query hypergraphs (MB, WBC), pp. 941–950.
SIGIRSIGIR-2012-BilgicB #learning
Active query selection for learning rankers (MB, PNB), pp. 1033–1034.
SIGIRSIGIR-2012-BlancoB #multi
Extending BM25 with multiple query operators (RB, PB), pp. 921–930.
SIGIRSIGIR-2012-BonchiPSVV #performance #recommendation
Efficient query recommendations in the long tail via center-piece subgraphs (FB, RP, FS, HV, RV), pp. 345–354.
SIGIRSIGIR-2012-CarmelK #information retrieval #performance #predict
Query performance prediction for IR (DC, OK), pp. 1196–1197.
SIGIRSIGIR-2012-ChuklinS #how
How query extensions reflect search result abandonments (AC, PS), pp. 1087–1088.
SIGIRSIGIR-2012-FreireMTOC #scheduling
Scheduling queries across replicas (AF, CM, NT, IO, FC), pp. 1139–1140.
SIGIRSIGIR-2012-HosseiniCMSY #evaluation #information retrieval
An uncertainty-aware query selection model for evaluation of IR systems (MH, IJC, NMF, MS, EY), pp. 901–910.
SIGIRSIGIR-2012-HuQLJPZ #mining #topic
Mining query subtopics from search log data (YH, YnQ, HL, DJ, JP, QZ), pp. 305–314.
SIGIRSIGIR-2012-JonassenCS
Prefetching query results and its impact on search engines (SJ, BBC, FS), pp. 631–640.
SIGIRSIGIR-2012-KoumpouriS #effectiveness #feedback #retrieval
Queries without clicks: evaluating retrieval effectiveness based on user feedback (AK, VS), pp. 1133–1134.
SIGIRSIGIR-2012-LiDZ #markov
A generalized hidden Markov model with discriminative training for query spelling correction (YL, HD, CZ), pp. 611–620.
SIGIRSIGIR-2012-LiuSCNW #adaptation
Adaptive query suggestion for difficult queries (YL, RS, YC, JYN, JRW), pp. 15–24.
SIGIRSIGIR-2012-LiWLF #performance
Supporting efficient top-k queries in type-ahead search (GL, JW, CL, JF), pp. 355–364.
SIGIRSIGIR-2012-MacdonaldTO #learning #online #predict #scheduling
Learning to predict response times for online query scheduling (CM, NT, IO), pp. 621–630.
SIGIRSIGIR-2012-MaCSSLW #assessment
New assessment criteria for query suggestion (ZM, YC, RS, TS, JL, JRW), pp. 1109–1110.
SIGIRSIGIR-2012-MahdabiAKC #automation #concept #predict #refinement #using
Automatic refinement of patent queries using concept importance predictors (PM, LA, MK, FC), pp. 505–514.
SIGIRSIGIR-2012-MaW #web
User-aware caching and prefetching query results in web search engines (HM, BW), pp. 1163–1164.
SIGIRSIGIR-2012-OzertemCDV #framework #machine learning #ranking
Learning to suggest: a machine learning framework for ranking query suggestions (UO, OC, PD, EV), pp. 25–34.
SIGIRSIGIR-2012-RoyGCL #evaluation #framework #segmentation #web
An IR-based evaluation framework for web search query segmentation (RSR, NG, MC, SL), pp. 881–890.
SIGIRSIGIR-2012-ShokouhiR
Time-sensitive query auto-completion (MS, KR), pp. 601–610.
SIGIRSIGIR-2012-SongYXLLW #multi #summary
Multi-aspect query summarization by composite query (WS, QY, ZX, TL, SL, JRW), pp. 325–334.
SIGIRSIGIR-2012-WuKH #evaluation #quality
User evaluation of query quality (WCW, DK, KH), pp. 215–224.
SIGIRSIGIR-2012-XueC #generative
Generating reformulation trees for complex queries (XX, WBC), pp. 525–534.
SIGIRSIGIR-2012-ZhangSCC #keyword #named #performance
See-to-retrieve: efficient processing of spatio-visual keyword queries (CZ, LS, KC, GC), pp. 681–690.
SIGIRSIGIR-2012-ZhaoC #automation
Automatic term mismatch diagnosis for selective query expansion (LZ, JC), pp. 515–524.
AMTAMT-2012-UjhelyiSRV #visualisation
Developing and visualizing live model queries (ZU, TS, IR, DV), pp. 35–40.
ECMFAECMFA-2012-GoldschmidtM #domain-specific language
An Internal Domain-Specific Language for Constructing OPC UA Queries and Event Filters (TG, WM), pp. 62–73.
ECMFAECMFA-2012-RathHV #emf
Derived Features for EMF by Integrating Advanced Model Queries (IR, ÁH, DV), pp. 102–117.
PLATEAUPLATEAU-2012-UrmaM #evolution #programming language #source code
Programming language evolution via source code query languages (RGU, AM), pp. 35–38.
TOOLSTOOLS-EUROPE-2012-BergmannHHRUV #emf #performance #state of the art #tool support
Integrating Efficient Model Queries in State-of-the-Art EMF Tools (GB, ÁH, ÁH, IR, ZU, DV), pp. 1–8.
REFSQREFSQ-2012-Cleland-HuangHHLM #assurance #requirements #safety
Trace Queries for Safety Requirements in High Assurance Systems (JCH, MPEH, JHH, RRL, PM), pp. 179–193.
ASEASE-2012-HaiducBOLM #assessment #automation #performance #retrieval
Automatic query performance assessment during the retrieval of software artifacts (SH, GB, RO, ADL, AM), pp. 90–99.
ICSEICSE-2012-HaiducBOML #re-engineering #retrieval
Evaluating the specificity of text retrieval queries to support software engineering tasks (SH, GB, RO, AM, ADL), pp. 1273–1276.
SACSAC-2012-ObaidAMS #database #execution #mobile
Query execution on a mobile database system (AO, AMA, HM, NS), pp. 569–571.
SACSAC-2012-PetitLR #data type
Revisiting formal ordering in data stream querying (LP, CL, CR), pp. 813–818.
SACSAC-2012-PozzaniC #named #sql
ST4SQL: a spatio-temporal query language dealing with granularities (GP, CC), pp. 23–25.
SACSAC-2012-SioutasPKT #named #network #probability
SART: dynamic P2P query processing in sensor networks with probabilistic guarantees (SS, AP, IK, DT), pp. 847–852.
SACSAC-2012-TriaLT #approximate #evaluation #metric
Metrics for approximate query engine evaluation (FDT, EL, FT), pp. 885–887.
SACSAC-2012-VerheijKFVH #framework #ranking
Querying and ranking news items in the hermes framework (AV, AK, FF, DV, FH), pp. 672–679.
OSDIOSDI-2012-NarayanH #database #distributed #named
DJoin: Differentially Private Join Queries over Distributed Databases (AN, AH), pp. 149–162.
FASEFASE-2012-DiskinMC #category theory
Intermodeling, Queries, and Kleisli Categories (ZD, TSEM, KC), pp. 163–177.
FoSSaCSFoSSaCS-2012-CaliGOP #diagrams #uml
Querying UML Class Diagrams (AC, GG, GO, AP), pp. 1–25.
STOCSTOC-2012-BhaskaraDKT #linear
Unconditional differentially private mechanisms for linear queries (AB, DD, RK, KT), pp. 1269–1284.
STOCSTOC-2012-DobzinskiV #complexity
From query complexity to computational complexity (SD, JV), pp. 1107–1116.
CSLCSL-2012-Brault-Baron
A Negative Conjunctive Query is Easy if and only if it is β-Acyclic (JBB), pp. 137–151.
ICLPICLP-2012-BryS #semistructured data #simulation #unification
Simulation Unification: Beyond Querying Semistructured Data (FB, SS), pp. 1–13.
ICSTICST-2012-McMinnSS #data type #generative #search-based #string #using #web
Search-Based Test Input Generation for String Data Types Using the Results of Web Queries (PM, MS, MS), pp. 141–150.
ICTSSICTSS-2012-YangHF #embedded #logic #parametricity
Querying Parametric Temporal Logic Properties on Embedded Systems (HY, BH, GEF), pp. 136–151.
IJCARIJCAR-2012-ChekolEGL
SPARQL Query Containment under RDFS Entailment Regime (MWC, JE, PG, NL), pp. 134–148.
HTHT-2011-DaiQD #web
Bridging link and query intent to enhance web search (ND, XQ, BDD), pp. 17–26.
ICDARICDAR-2011-ZanibbiY #documentation #image #using
Math Spotting: Retrieving Math in Technical Documents Using Handwritten Query Images (RZ, LY), pp. 446–451.
JCDLJCDL-2011-TonniesKB #library #personalisation
Taking chemistry to the task: personalized queries for chemical digital libraries (ST, BK, WTB), pp. 325–334.
PODSPODS-2011-AmsterdamerDT
Provenance for aggregate queries (YA, DD, VT), pp. 153–164.
PODSPODS-2011-ArenasP #semantics #web
Querying semantic web data with SPARQL (MA, JP), pp. 305–316.
PODSPODS-2011-BarceloLR #graph
Querying graph patterns (PB, LL, JLR), pp. 199–210.
PODSPODS-2011-KoutrisS #evaluation #parallel
Parallel evaluation of conjunctive queries (PK, DS), pp. 223–234.
PODSPODS-2011-WeiY #summary
Beyond simple aggregates: indexing for summary queries (ZW, KY), pp. 117–128.
SIGMODSIGMOD-2011-Bajda-PawlikowskiASP #execution #performance
Efficient processing of data warehousing queries in a split execution environment (KBP, DJA, AS, EP), pp. 1165–1176.
SIGMODSIGMOD-2011-BalesDV #algebra #optimisation
Score-consistent algebraic optimization of full-text search queries with GRAFT (NB, AD, VV), pp. 769–780.
SIGMODSIGMOD-2011-CaoCJO #keyword
Collective spatial keyword querying (XC, GC, CSJ, BCO), pp. 373–384.
SIGMODSIGMOD-2011-DamaggioDZ #behaviour #contract #database
Querying contract databases based on temporal behavior (ED, AD, DZ), pp. 397–408.
SIGMODSIGMOD-2011-ElmeleegyEL #generative
Leveraging query logs for schema mapping generation in U-MAP (HE, AKE, JL), pp. 121–132.
SIGMODSIGMOD-2011-EsmailiSFT
Changing flights in mid-air: a model for safely modifying continuous queries (KSE, TS, PMF, NT), pp. 613–624.
SIGMODSIGMOD-2011-FinkHOR #named #nondeterminism #web
SPROUT2: a squared query engine for uncertain web data (RF, AH, DO, SR), pp. 1299–1302.
SIGMODSIGMOD-2011-FranklinKKRX #crowdsourcing #named
CrowdDB: answering queries with crowdsourcing (MJF, DK, TK, SR, RX), pp. 61–72.
SIGMODSIGMOD-2011-GuptaKBRGK #coordination
Coordination through querying in the youtopia system (NG, LK, GB, SR, JG, CK), pp. 1331–1334.
SIGMODSIGMOD-2011-GuptaKRBGK #coordination #data-driven #declarative
Entangled queries: enabling declarative data-driven coordination (NG, LK, SR, GB, JG, CK), pp. 673–684.
SIGMODSIGMOD-2011-HerodotouBB #optimisation
Query optimization techniques for partitioned tables (HH, NB, SB), pp. 49–60.
SIGMODSIGMOD-2011-HoweCKB #ad hoc #automation #database
Automatic example queries for ad hoc databases (BH, GC, NK, LB), pp. 1319–1322.
SIGMODSIGMOD-2011-JinBXCZ #named #visual notation
GBLENDER: visual subgraph query formulation meets query processing (CJ, SSB, XX, BC, SZ), pp. 1327–1330.
SIGMODSIGMOD-2011-JinP #evaluation #performance
Efficient and generic evaluation of ranked queries (WJ, JMP), pp. 601–612.
SIGMODSIGMOD-2011-KanagalLD #analysis #database #evaluation #probability #robust
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases (BK, JL, AD), pp. 841–852.
SIGMODSIGMOD-2011-KantereDGA #predict
Predicting cost amortization for query services (VK, DD, GG, AA), pp. 325–336.
SIGMODSIGMOD-2011-KashyapP #agile #dataset #development #interface #xml
Rapid development of web-based query interfacesfor XML datasets with QURSED (AK, MP), pp. 1339–1342.
SIGMODSIGMOD-2011-KaushikR #performance #sql
Efficient auditing for complex SQL queries (RK, RR), pp. 697–708.
SIGMODSIGMOD-2011-KonstantinidisA #approach #graph #scalability
Scalable query rewriting: a graph-based approach (GK, JLA), pp. 97–108.
SIGMODSIGMOD-2011-LianC #graph #performance #probability #rdf
Efficient query answering in probabilistic RDF graphs (XL, LC), pp. 157–168.
SIGMODSIGMOD-2011-LiuRGGWAM #analysis #multi #named #sequence #using
E-Cube: multi-dimensional event sequence analysis using hierarchical pattern query sharing (ML, EAR, KG, CG, SW, IA, AM), pp. 889–900.
SIGMODSIGMOD-2011-LuADT #named #probability
Schema-as-you-go: on probabilistic tagging and querying of wide tables (ML, DA, BTD, AKHT), pp. 181–192.
SIGMODSIGMOD-2011-MarcusWKMM
Demonstration of Qurk: a query processor for humanoperators (AM, EW, DRK, SM, RCM), pp. 1315–1318.
SIGMODSIGMOD-2011-QinWLXL #performance #similarity #symmetry
Efficient exact edit similarity query processing with the asymmetric signature scheme (JQ, WW, YL, CX, XL), pp. 1033–1044.
SIGMODSIGMOD-2011-SenellartS #approximate #lightweight #named #probability
ProApproX: a lightweight approximation query processor over probabilistic trees (PS, AS), pp. 1295–1298.
SIGMODSIGMOD-2011-TekleL #datalog #performance #set
More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.
SIGMODSIGMOD-2011-UpadhyayaKB #fault tolerance #latency #online #parallel
A latency and fault-tolerance optimizer for online parallel query plans (PU, YK, MB), pp. 241–252.
SIGMODSIGMOD-2011-VlachouDP
Skyline query processing over joins (AV, CD, NP), pp. 73–84.
SIGMODSIGMOD-2011-YangWCK #constraints #nondeterminism
Querying uncertain data with aggregate constraints (MY, HW, HC, WSK), pp. 817–828.
SIGMODSIGMOD-2011-ZhouFSTHILS #declarative #distributed #framework #maintenance #named #platform
NetTrails: a declarative platform for maintaining and querying provenance in distributed systems (WZ, QF, SS, TT, AH, ZGI, BTL, MS), pp. 1323–1326.
TPDLTPDL-2011-CeccarelliGLNT #experience #using
Improving Europeana Search Experience Using Query Logs (DC, SG, CL, FMN, GT), pp. 384–395.
TPDLTPDL-2011-HubertCSP
Query Operators Shown Beneficial for Improving Search Results (GH, GC, CS, DP), pp. 118–129.
VLDBVLDB-2011-BenouaretBHB #composition #fuzzy #named #web #web service
FuDoCS: A Web Service Composition System Based on Fuzzy Dominance for Preference Query Answering (KB, DB, AH, MB), pp. 1430–1433.
VLDBVLDB-2011-BerneckerEKRZZ #nearest neighbour #nondeterminism #performance #probability
Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data (TB, TE, HPK, MR, SZ, AZ), pp. 669–680.
VLDBVLDB-2011-CaoSDS #distributed #monitoring
Distributed inference and query processing for RFID tracking and monitoring (ZC, CAS, YD, PJS), pp. 326–337.
VLDBVLDB-2011-FengFKKMRWX #named
CrowdDB: Query Processing with the VLDB Crowd (AF, MJF, DK, TK, SM, SR, AW, RX), pp. 1387–1390.
VLDBVLDB-2011-FontouraJLVZZ #evaluation
Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes (MF, VJ, JL, SV, XZ, JYZ), pp. 1213–1224.
VLDBVLDB-2011-FunkeKN #transaction
HyPer-sonic Combined Transaction AND Query Processing (FF, AK, TN), pp. 1367–1370.
VLDBVLDB-2011-Gatterbauer #database #visualisation
Databases will Visualize Queries too (WG), pp. 1498–1501.
VLDBVLDB-2011-HuangAR #graph #rdf #scalability
Scalable SPARQL Querying of Large RDF Graphs (JH, DJA, KR), pp. 1123–1134.
VLDBVLDB-2011-KerstenIML #database #research
The Researcher’s Guide to the Data Deluge: Querying a Scientific Database in Just a Few Seconds (MLK, SI, SM, EL), pp. 1474–1477.
VLDBVLDB-2011-KhannaRT #database #difference #probability
Queries with Difference on Probabilistic Databases (SK, SR, VT), pp. 1051–1062.
VLDBVLDB-2011-LiuNC #clustering
Query Expansion Based on Clustered Results (ZL, SN, YC), pp. 350–361.
VLDBVLDB-2011-MoerkotteN
Accelerating Queries with Group-By and Join by Groupjoin (GM, TN), pp. 843–851.
VLDBVLDB-2011-Neumann #compilation #hardware #performance
Efficiently Compiling Efficient Query Plans for Modern Hardware (TN0), pp. 539–550.
VLDBVLDB-2011-OrsiP #constraints #ontology #optimisation
Optimizing Query Answering under Ontological Constraints (GO, AP), pp. 1004–1015.
VLDBVLDB-2011-PengDL #nondeterminism #optimisation #probability
Optimizing Probabilistic Query Processing on Continuous Uncertain Data (LP, YD, AL), pp. 1169–1180.
VLDBVLDB-2011-RazniewskiN #database #semistructured data
Completeness of Queries over Incomplete Databases (SR, WN), pp. 749–760.
VLDBVLDB-2011-RenLKZC #evolution #graph #on the #sequence
On Querying Historical Evolving Graph Sequences (CR, EL, BK, XZ, RC), pp. 726–737.
VLDBVLDB-2011-VieiraRBHSTT #named
DivDB: A System for Diversifying Query Results (MRV, HLR, MCNB, MH, DS, CTJ, VJT), pp. 1395–1398.
VLDBVLDB-2011-YangCLC #constraints #on the
On Social-Temporal Group Query with Acquaintance Constraint (DNY, YLC, WCL, MSC), pp. 397–408.
VLDBVLDB-2011-ZeitlerR
Massive Scale-out of Expensive Continuous Queries (EZ, TR), pp. 1181–1188.
VLDBVLDB-2011-ZouMCOZ #named
gStore: Answering SPARQL Queries via Subgraph Matching (LZ, JM, LC, MTÖ, DZ), pp. 482–493.
VLDBVLDB-2012-ArmbrustCKFFP11 #in the cloud #named
PIQL: Success-Tolerant Query Processing in the Cloud (MA, KC, TK, AF, MJF, DAP), pp. 181–192.
VLDBVLDB-2012-LinJZXL11 #performance #privacy
A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy (DL, CSJ, RZ, LX, JL), pp. 37–48.
VLDBVLDB-2012-RanuS11
Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions (SR, AKS), pp. 169–180.
VLDBVLDB-2012-ZhaoAW11 #estimation #graph #named #sketching
gSketch: On Query Estimation in Graph Streams (PZ, CCA, MW), pp. 193–204.
ICPCICPC-2011-HaiducM #concept #on the
On the Effect of the Query in IR-based Concept Location (SH, AM), pp. 234–237.
ICPCICPC-2011-PanchenkoKPZ #database #precise #scalability #source code #using
Precise and Scalable Querying of Syntactical Source Code Patterns Using Sample Code Snippets and a Database (OP, JK, HP, AZ), pp. 41–50.
ICSMEICSM-2011-NogueraRKJ
Program querying with a SOUL: The BARISTA tool suite (CN, CDR, AK, VJ), pp. 582–585.
SCAMSCAM-2011-AlvesHR #case study #comparative
A Comparative Study of Code Query Technologies (TLA, JH, PR), pp. 145–154.
DLTDLT-2011-Kasprzik #automaton #finite
Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
ICALPICALP-v1-2011-BrodalT
Dynamic Planar Range Maxima Queries (GSB, KT), pp. 256–267.
ICALPICALP-v2-2011-AndersonMSS #first-order #invariant #locality #logic
Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (MA, DvM, NS, LS), pp. 368–379.
CHICHI-2011-FourneyMT #analysis #interactive #usability
Characterizing the usability of interactive applications through query log analysis (AF, RM, MAT), pp. 1817–1826.
CHICHI-2011-JetterGZRM #collaboration #hybrid
Materializing the query with facet-streams: a hybrid surface for collaborative search on tabletops (HCJ, JG, MZ, HR, NMF), pp. 3013–3022.
CSCWCSCW-2011-MooreCK #interactive #internet
Three sequential positions of query repair in interactions with internet search engines (RJM, EFC, RGPK), pp. 415–424.
HCIHCI-DDA-2011-BirinciGG #feedback #image #retrieval
Dynamic Queries with Relevance Feedback for Content Based Image Retrieval (MB, EG, MG), pp. 547–554.
HCIHCI-UA-2011-BilalE #web
Evaluating Leading Web Search Engines on Children’s Queries (DB, RE), pp. 549–558.
ICEISICEIS-J-2011-AliPTD11a
Incorporating Data Concerns into Query Languages for Data Services (MIA, RP, HLT, SD), pp. 132–145.
ICEISICEIS-J-2011-NganBL11a #framework #learning #monitoring #multi
An Event-Based Service Framework for Learning, Querying and Monitoring Multivariate Time Series (CKN, AB, JL), pp. 208–223.
ICEISICEIS-v1-2011-AliPTD #integration
Data Concern Aware Querying for the Integration of Data Services (MIA, RP, HLT, SD), pp. 111–119.
ICEISICEIS-v1-2011-LuoYHJCH #algorithm #named
IRTA: An Improved Threshold Algorithm for Reverse Top-k Queries (CL, FY, WCH, ZJ, DC, SH), pp. 135–140.
ICEISICEIS-v1-2011-MakkiAGJ #evaluation #performance #semantics
Performance Evaluation of Query Trimming Strategies in Semantic Caching Environment (SKM, SA, YG, MSJ), pp. 169–176.
ICEISICEIS-v2-2011-NganBL #framework #learning #monitoring #multi
A Service Framework for Learning, Querying and Monitoring Multivariate Time Series (CKN, AB, JL), pp. 92–101.
ICEISICEIS-v3-2011-SchwinnKR #editing #information management #ontology #owl #visual notation
Ontology-based Knowledge Management — Graphical Query Editor for OWL Ontologies (MS, NK, SR), pp. 235–240.
CIKMCIKM-2011-AielloDOM #behaviour #clustering #topic
Behavior-driven clustering of queries into topics (LMA, DD, UO, FM), pp. 1373–1382.
CIKMCIKM-2011-AktolgaA #ranking
Reranking search results for sparse queries (EA, JA), pp. 173–182.
CIKMCIKM-2011-AmodeoAG #on the
On relevance, time and query expansion (GA, GA, GG), pp. 1973–1976.
CIKMCIKM-2011-AzzamRY #sql
Ranking-based processing of SQL queries (HA, TR, SY), pp. 231–236.
CIKMCIKM-2011-BianC #classification #taxonomy
A taxonomy of local search: semi-supervised query classification driven by information needs (JB, YC), pp. 2425–2428.
CIKMCIKM-2011-BingLW #social #topic #using
Using query log and social tagging to refine queries based on latent topics (LB, WL, TLW), pp. 583–592.
CIKMCIKM-2011-BykauMRV #evolution #using
Supporting queries spanning across phases of evolving artifacts using Steiner forests (SB, JM, FR, YV), pp. 1649–1658.
CIKMCIKM-2011-ChenCC #framework #hybrid #network
Coupling or decoupling for KNN search on road networks?: a hybrid framework on user query patterns (YJC, KTC, MSC), pp. 795–804.
CIKMCIKM-2011-ChenSNC #adaptation #classification #self
Improving context-aware query classification via adaptive self-training (MC, JTS, XN, YC), pp. 115–124.
CIKMCIKM-2011-ChristoforakiHDMS #performance
Text vs. space: efficient geo-search query processing (MC, JH, CD, AM, TS), pp. 423–432.
CIKMCIKM-2011-ChuiKLC #algorithm #sequence
I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system (CKC, BK, EL, RC), pp. 1619–1628.
CIKMCIKM-2011-DangXC #aspect-oriented #clustering #using
Inferring query aspects from reformulations using clustering (VD, XX, WBC), pp. 2117–2120.
CIKMCIKM-2011-DengLPCX #ad hoc #database #graph #predict #reachability
Predicting the optimal ad-hoc index for reachability queries on graph databases (JD, FL, YP, BC, JX), pp. 2357–2360.
CIKMCIKM-2011-DouHLSW
Finding dimensions for queries (ZD, SH, YL, RS, JRW), pp. 1311–1320.
CIKMCIKM-2011-DuanLZ #automation
Automatic query reformulation with syntactic operators to alleviate search difficulty (HD, RL, CZ), pp. 2037–2040.
CIKMCIKM-2011-FuLZZ #learning
Do they belong to the same class: active learning by querying pairwise label homogeneity (YF, BL, XZ, CZ), pp. 2161–2164.
CIKMCIKM-2011-GangulyLMJ #feedback #pseudo #reduction #using
Patent query reduction using pseudo relevance feedback (DG, JL, WM, GJFJ), pp. 1953–1956.
CIKMCIKM-2011-Garcia-AlvaradoO #database #documentation #web
Integrating and querying web databases and documents (CGA, CO), pp. 2369–2372.
CIKMCIKM-2011-GollapudiINP #performance #web
Efficient query rewrite for structured web queries (SG, SI, AN, SP), pp. 2417–2420.
CIKMCIKM-2011-GuirguisSCL #multi
Optimized processing of multiple aggregate continuous queries (SG, MAS, PKC, AL), pp. 1515–1524.
CIKMCIKM-2011-GuoCXZ #similarity
Intent-aware query similarity (JG, XC, GX, XZ), pp. 259–268.
CIKMCIKM-2011-HagenSR #detection
Query session detection as a cascade (MH, BS, TR), pp. 147–152.
CIKMCIKM-2011-HummelSML #keyword #multi #xml
Multiple keyword-based queries over XML streams (FdCH, ASdS, MMM, AHFL), pp. 1577–1582.
CIKMCIKM-2011-KacimiG
Diversifying search results of controversial queries (MK, JG), pp. 93–98.
CIKMCIKM-2011-KarimzadehganZ #documentation #modelling #retrieval
Improving retrieval accuracy of difficult queries through generalizing negative document language models (MK, CZ), pp. 27–36.
CIKMCIKM-2011-KiselevaAB #case study #mining
Mining query structure from click data: a case study of product queries (JK, EA, DB), pp. 2217–2220.
CIKMCIKM-2011-KotovZ #feedback #interactive
Interactive sense feedback for difficult queries (AK, CZ), pp. 163–172.
CIKMCIKM-2011-LinC #data fusion #learning
Query sampling for learning data fusion (TCL, PJC), pp. 141–146.
CIKMCIKM-2011-LinXH #authentication
Authentication of location-based skyline queries (XL, JX, HH), pp. 1583–1588.
CIKMCIKM-2011-LiuNSC #classification #comprehension #transaction
Unsupervised transactional query classification based on webpage form understanding (YL, XN, JTS, ZC), pp. 57–66.
CIKMCIKM-2011-LiuYS #dataset
Subject-oriented top-k hot region queries in spatial dataset (JL, GY, HS), pp. 2409–2412.
CIKMCIKM-2011-LiZTLG #data type #in the cloud
Continuous data stream query in the cloud (JL, PZ, JT, PL, LG), pp. 2389–2392.
CIKMCIKM-2011-MaZSDC
Matching query processing in high-dimensional space (CM, YZ, LS, DD, GC), pp. 1589–1594.
CIKMCIKM-2011-ONeilPA #behaviour #game studies #named
Fu-Finder: a game for studying querying behaviours (CO, JP, LA), pp. 2561–2564.
CIKMCIKM-2011-OrdonezG #data mining #database #mining #relational #sql
A data mining system based on SQL queries and UDFs for relational databases (CO, CGA), pp. 2521–2524.
CIKMCIKM-2011-ParkL #data type #detection #evaluation
A continuous query evaluation scheme for a detection-only query over data streams (HKP, WSL), pp. 2405–2408.
CIKMCIKM-2011-ParkSBY #distance #nearest neighbour
k-Nearest neighbor query processing method based on distance relation pattern (YP, DS, KB, JY), pp. 2413–2416.
CIKMCIKM-2011-Pasca #using #web #what
Asking what no one has asked before: using phrase similarities to generate synthetic web search queries (MP), pp. 1347–1352.
CIKMCIKM-2011-PelekisGVKT #privacy
Privacy-aware querying over sensitive trajectory data (NP, AGD, MV, DK, YT), pp. 895–904.
CIKMCIKM-2011-PuWLW #incremental #named #performance #rdf
AWETO: efficient incremental update and querying in rdf storage system (XP, JW, PL, MW), pp. 2445–2448.
CIKMCIKM-2011-ShanZHYYL #performance
Efficient phrase querying with flat position index (DS, WXZ, JH, RY, HY, XL), pp. 2001–2004.
CIKMCIKM-2011-TomasATV #named #scalability
RoSeS: a continuous query processor for large-scale RSS filtering and aggregation (JCT, BA, NT, DV), pp. 2549–2552.
CIKMCIKM-2011-TranCW #constraints #evaluation
Evaluation of set-based queries with aggregation constraints (QTT, CYC, GW), pp. 1495–1504.
CIKMCIKM-2011-TsangC #regular expression #robust
A robust index for regular expression queries (DT, SC), pp. 2365–2368.
CIKMCIKM-2011-UllegaddiV #category theory #learning #rank #web
Learning to rank categories for web queries (PU, VV), pp. 2065–2068.
CIKMCIKM-2011-WangA #data flow #effectiveness #web
Effective stratification for low selectivity queries on deep web data sources (FW, GA), pp. 1455–1464.
CIKMCIKM-2011-XueY #modelling #topic
Topic modeling for named entity queries (XX, XY), pp. 2009–2012.
CIKMCIKM-2011-YanGC #higher-order #learning #recommendation
Context-aware query recommendation by learning high-order relation in query logs (XY, JG, XC), pp. 2073–2076.
CIKMCIKM-2011-YangZJ #graph #multi #named
DELTA: indexing and querying multi-labeled graphs (JY, SZ, WJ), pp. 1765–1774.
CIKMCIKM-2011-YiA #web
Discovering missing click-through query language information for web search (XY, JA), pp. 153–162.
ECIRECIR-2011-AlbakourKNKSFR #evaluation #named #using
AutoEval: An Evaluation Methodology for Evaluating Query Suggestions Using Query Logs (MDA, UK, NN, YK, DS, MF, ANDR), pp. 605–610.
ECIRECIR-2011-BadrinathVM #summary #using
Improving Query Focused Summarization Using Look-Ahead Strategy (RB, SV, CEVM), pp. 641–652.
ECIRECIR-2011-EickhoffPGTG #web
Web Search Query Assistance Functionality for Young Audiences (CE, TP, KG, SDT, RG), pp. 776–779.
ECIRECIR-2011-FrommholzPLR #framework #information retrieval
Processing Queries in Session in a Quantum-Inspired IR Framework (IF, BP, ML, KvR), pp. 751–754.
ECIRECIR-2011-GyllstromM #topic
Clash of the Typings — Finding Controversies and Children’s Topics Within Queries (KG, MFM), pp. 80–91.
ECIRECIR-2011-HefnyDA #exclamation
Is a Query Worth Translating: Ask the Users! (AH, KD, AA), pp. 238–250.
ECIRECIR-2011-HerbertSG #information retrieval
Combining Query Translation Techniques to Improve Cross-Language Information Retrieval (BH, GS, IG), pp. 712–715.
ECIRECIR-2011-MassoudiTRW #microblog #quality
Incorporating Query Expansion and Quality Indicators in Searching Microblog Posts (KM, MT, MdR, WW), pp. 362–367.
KDDKDD-2011-RashidiC #induction #learning
Ask me better questions: active learning queries based on rule induction (PR, DJC), pp. 904–912.
KDIRKDIR-2011-AlouaouiTF #mining
Querying and Mining Spatiotemporal Association Rules (HA, SYT, SF), pp. 402–405.
KDIRKDIR-2011-ClariziaCSGN #graph #novel
A Novel Query Expansion Technique based on a Mixed Graph of Terms (FC, FC, MDS, LG, PN), pp. 84–93.
KDIRKDIR-2011-SethCRSB #analysis #similarity
A Tale of Two (Similar) Cities — Inferring City Similarity through Geo-spatial Query Log Analysis (RS, MC, DR, DS, SB), pp. 179–189.
KEODKEOD-2011-SeinturierMB #data transformation #knowledge-based #multimodal #representation
Knowledge-based Multimodal Data Representation and Querying (JS, EM, EB), pp. 152–158.
KMISKMIS-2011-AouichaFTH #automation
Structure-based Interrogation and Automatic Query Reformulation (MBA, IKF, MT, ABH), pp. 123–128.
KMISKMIS-2011-SchwinnKR #approach #editing #information management #ontology #visual notation
An Approach to a Graphical Query Editor — For Ontology-based Knowledge Management (MS, NK, SR), pp. 436–441.
SIGIRSIGIR-2011-BenderskyMC #concept
Parameterized concept weighting in verbose queries (MB, DM, WBC), pp. 605–614.
SIGIRSIGIR-2011-BhatiaMM
Query suggestions in the absence of query logs (SB, DM, PM), pp. 795–804.
SIGIRSIGIR-2011-BouadjenekHBD #personalisation #social #using
Personalized social query expansion using social bookmarking systems (MRB, HH, MB, JD), pp. 1113–1114.
SIGIRSIGIR-2011-CaiGZW #adaptation #education #ranking
Relevant knowledge helps in choosing right teacher: active query selection for ranking adaptation (PC, WG, AZ, KFW), pp. 115–124.
SIGIRSIGIR-2011-Campos #analysis #using #web
Using k-Top retrieved web snippets to date temporalimplicit queries based on web content analysis (RNTC), pp. 1325–1326.
SIGIRSIGIR-2011-CumminsJO #performance #predict #standard #using
Improved query performance prediction using standard deviation (RC, JMJ, CO), pp. 1089–1090.
SIGIRSIGIR-2011-DattaV
Tossing coins to trim long queries (SD, VV), pp. 1255–1256.
SIGIRSIGIR-2011-ElsweilerLTF #evaluation
Seeding simulated queries with user-study data forpersonal search evaluation (DE, DEL, JCT, RTF), pp. 25–34.
SIGIRSIGIR-2011-FangSSKM #analysis
Analysis of an expert search query log (YF, NS, LS, JK, APM), pp. 1189–1190.
SIGIRSIGIR-2011-Ghorab #adaptation #information retrieval #multi #personalisation
Improving query and result list adaptation in personalized multilingual information retrieval (MRG), pp. 1323–1324.
SIGIRSIGIR-2011-HeS #performance #version control
Faster temporal range queries over versioned text (JH, TS), pp. 565–574.
SIGIRSIGIR-2011-JainOV #web
Synthesizing high utility suggestions for rare web search queries (AJ, UO, EV), pp. 805–814.
SIGIRSIGIR-2011-Jiang #graph #semantics
Query expansion based on a semantic graph model (XJ), pp. 1315–1316.
SIGIRSIGIR-2011-JiYGHHZC #graph #learning #web
Learning search tasks in queries and web pages via graph regularization (MJ, JY, SG, JH, XH, WVZ, ZC), pp. 55–64.
SIGIRSIGIR-2011-KanhabuaN #performance #predict
Time-based query performance predictors (NK, KN), pp. 1181–1182.
SIGIRSIGIR-2011-KayaaslanCBJA #energy #multi #web
Energy-price-driven query processing in multi-center web search engines (EK, BBC, RB, FPJ, CA), pp. 983–992.
SIGIRSIGIR-2011-KimSC #automation
Automatic boolean query suggestion for professional search (YK, JS, WBC), pp. 825–834.
SIGIRSIGIR-2011-LiHZW #information retrieval #segmentation #using
Unsupervised query segmentation using clickthrough for information retrieval (YL, BJPH, CZ, KW), pp. 285–294.
SIGIRSIGIR-2011-LinLJY #approach #machine learning #social
Social annotation in query expansion: a machine learning approach (YL, HL, SJ, ZY), pp. 405–414.
SIGIRSIGIR-2011-PolajnarGA #named #taxonomy
JuSe: a picture dictionary query system for children (TP, RG, LA), pp. 1281–1282.
SIGIRSIGIR-2011-Shokouhi #analysis #detection
Detecting seasonal queries by time-series analysis (MS), pp. 1171–1172.
SIGIRSIGIR-2011-SinghPS #behaviour
User behavior in zero-recall ecommerce queries (GS, NP, NS), pp. 75–84.
SIGIRSIGIR-2011-SongZH
Post-ranking query suggestion by diversifying search results (YS, DZ, LwH), pp. 815–824.
SIGIRSIGIR-2011-SongZXLL #ranking
Query term ranking based on search results overlap (WS, YZ, YX, TL, SL), pp. 1253–1254.
SIGIRSIGIR-2011-SunDLC #network #semantics #social #visualisation
Visualizing and querying semantic social networks (AS, AD, EPL, KC), pp. 1271–1272.
SIGIRSIGIR-2011-WengLCZZYZ #approach #documentation #retrieval
Query by document via a decomposition-based two-level retrieval approach (LW, ZL, RC, YZ, YZ, LTY, LZ), pp. 505–514.
SIGIRSIGIR-2011-XueC #modelling #set
Modeling subset distributions for verbose queries (XX, WBC), pp. 1133–1134.
ECMFAECMFA-2011-BergmannHRV #emf #evaluation #incremental #modelling #tutorial
Incremental Evaluation of Model Queries over EMF Models: A Tutorial on EMF-IncQuery (GB, ÁH, IR, DV), pp. 389–390.
ICMTICMT-2011-BergmannURV #emf #graph #modelling
A Graph Query Language for EMF Models (GB, ZU, IR, DV), pp. 167–182.
ECOOPECOOP-2011-PothierT #debugging #scalability
Summarized Trace Indexing and Querying for Scalable Back-in-Time Debugging (GP, ÉT), pp. 558–582.
PEPMPEPM-J-2007-CunhaV11 #source code #xpath
Transformation of structure-shy programs with application to XPath queries and strategic functions (AC, JV), pp. 516–539.
PLDIPLDI-2011-MurrayIY #automation #declarative #named #optimisation
Steno: automatic optimization of declarative queries (DGM, MI, YY), pp. 121–131.
SASSAS-2011-AvniK #abstraction #framework
An Abstraction-Refinement Framework for Trigger Querying (GA, OK), pp. 263–279.
ASEASE-2011-Haiduc #automation #concept #detection #quality
Automatically detecting the quality of the query and its implications in IR-based concept location (SH), pp. 637–640.
ASEASE-2011-KimmigMM #natural language #source code
Querying source code with natural language (MK, MM, MM), pp. 376–379.
SACSAC-2011-AdaikkalavanP
Secure shared continuous query processing (RA, TP), pp. 1000–1005.
SACSAC-2011-DabringerE #performance #retrieval
Efficient top-k retrieval for user preference queries (CD, JE), pp. 1045–1052.
SACSAC-2011-GroppeG #database #scalability #semantics #web
Parallelizing join computations of SPARQL queries for large semantic web databases (JG, SG), pp. 1681–1686.
SACSAC-2011-Jamil #graph #unification #using
Computing subgraph isomorphic queries using structural unification and minimum graph structures (HMJ), pp. 1053–1058.
SACSAC-2011-LinC #towards
Towards communication-efficient private location dependent queries (KPL, MSC), pp. 433–438.
SACSAC-2011-LiuCC #network
Voronoi-based range query for trajectory data in spatial networks (SL, LC, GC), pp. 1022–1026.
SACSAC-2011-YeHL #approach #network
A Bayesian network approach to context sensitive query expansion (ZY, XH, HL), pp. 1138–1142.
SACSAC-2011-ZhengC #database
Determinacy and rewriting of conjunctive queries over unary database schemas (LZ, HC), pp. 1039–1044.
SLESLE-2011-KlingJWBC #domain-specific language #named #repository
MoScript: A DSL for Querying and Manipulating Model Repositories (WK, FJ, DW, MB, JC), pp. 180–200.
SOSPSOSP-2011-PopaRZB #named
CryptDB: protecting confidentiality with encrypted query processing (RAP, CMSR, NZ, HB), pp. 85–100.
STOCSTOC-2011-AryaFM #approximate
Approximate polytope membership queries (SA, GDdF, DMM), pp. 579–586.
STOCSTOC-2011-GuptaHRU #statistics
Privately releasing conjunctions and the statistical query barrier (AG, MH, AR, JU), pp. 803–812.
STOCSTOC-2011-Sherstov #communication #complexity #quantum #theorem
Strong direct product theorems for quantum communication and query complexity (AAS), pp. 41–50.
CADECADE-2011-ChortarasTS #owl
Optimized Query Rewriting for OWL 2 QL (AC, DT, GBS), pp. 192–206.
CSLCSL-2011-DurandS #complexity #higher-order #logic #problem
Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.
TPDLECDL-2010-AgostiCNMM #library #named
i-TEL-u: A Query Suggestion Tool for Integrating Heterogeneous Contexts in a Digital Library (MA, DC, GMDN, IM, MM), pp. 397–400.
TPDLECDL-2010-BillerbeckDFIK #ranking #using #web
Ranking Entities Using Web Search Query Logs (BB, GD, CSF, TI, RK), pp. 273–281.
TPDLECDL-2010-GergatsoulisBGP #integration #metadata
Query Transformation in a CIDOC CRM Based Cultural Metadata Integration Environment (MG, LB, PG, CP), pp. 38–45.
TPDLECDL-2010-HagenS
Capacity-Constrained Query Formulation (MH, BS), pp. 384–388.
TPDLECDL-2010-KanhabuaN #ranking
Determining Time of Queries for Re-ranking Search Results (NK, KN), pp. 261–272.
TPDLECDL-2010-MaurizioO #named #programming language
Manuzio: A Model for Digital Annotated Text and Its Query/Programming Language (MM, RO), pp. 478–481.
PODSPODS-2010-BarceloHLW
Expressive languages for path queries over graph-structured data (PB, CAH, LL, PTW), pp. 3–14.
PODSPODS-2010-BenediktPV #higher-order
Positive higher-order queries (MB, GP, HV), pp. 27–38.
PODSPODS-2010-DalviSS #algebra #probability
Computing query probability with incidence algebras (NND, KS, DS), pp. 203–214.
PODSPODS-2010-DavidLM #xml
Certain answers for XML queries (CD, LL, FM), pp. 191–202.
PODSPODS-2010-DeutchKM #fixpoint #markov #on the #probability
On probabilistic fixpoint and Markov chain query languages (DD, CK, TM), pp. 215–226.
PODSPODS-2010-FaginKLRV #comprehension #database
Understanding queries in a search database system (RF, BK, YL, SR, SV), pp. 273–284.
PODSPODS-2010-Koch #database #evaluation #incremental
Incremental query evaluation in a ring of databases (CK), pp. 87–98.
PODSPODS-2010-LiHRMM #difference #linear #optimisation #privacy
Optimizing linear counting queries under differential privacy (CL, MH, VR, GM, AM), pp. 123–134.
PODSPODS-2010-MeierSWL #optimisation #semantics
Semantic query optimization in the presence of types (MM, MS, FW, GL), pp. 111–122.
PODSPODS-2010-Wijsen #database #first-order #nondeterminism #on the
On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases (JW), pp. 179–190.
SIGMODSIGMOD-2010-AgrawalCCGKX #generative #web
Query portals: dynamically generating portals for entity-oriented web queries (SA, KC, SC, VG, ACK, DX), pp. 1171–1174.
SIGMODSIGMOD-2010-ArmbrustTFFPLTT #named #performance
PIQL: a performance insightful query language (MA, ST, AF, MJF, DAP, NL, BT, JT), pp. 1207–1210.
SIGMODSIGMOD-2010-ChaudhuriLN #optimisation
Variance aware optimization of parameterized queries (SC, HL, VRN), pp. 531–542.
SIGMODSIGMOD-2010-ChenMK #database #probability
GRN model of probabilistic databases: construction, transition and querying (RC, YM, IK), pp. 291–302.
SIGMODSIGMOD-2010-CondieCAHGTES #online #pipes and filters
Online aggregation and continuous query support in MapReduce (TC, NC, PA, JMH, JG, JT, KE, RS), pp. 1115–1118.
SIGMODSIGMOD-2010-CurtmolaDRS #community #online #privacy
Load-balanced query dissemination in privacy-aware online communities (EC, AD, KKR, DS), pp. 471–482.
SIGMODSIGMOD-2010-JinBXCC #database #graph #named #towards #visual notation
GBLENDER: towards blending visual query formulation and query processing in graph databases (CJ, SSB, XX, JC, BC), pp. 111–122.
SIGMODSIGMOD-2010-KarvounarakisIT
Querying data provenance (GK, ZGI, VT), pp. 951–962.
SIGMODSIGMOD-2010-LianCS #consistency #database #probability
Consistent query answers in inconsistent probabilistic databases (XL, LC, SS), pp. 303–314.
SIGMODSIGMOD-2010-MeyerDGM #optimisation
Optimizing schema-last tuple-store queries in graphd (SMM, JD, JG, BM), pp. 1047–1056.
SIGMODSIGMOD-2010-MoonCZ #architecture #evolution #optimisation #scalability #transaction
Scalable architecture and query optimization fortransaction-time DBs with evolving schemas (HJM, CC, CZ), pp. 207–218.
SIGMODSIGMOD-2010-PerezAJ #evaluation #probability
Evaluation of probabilistic threshold queries in MCDB (LLP, SA, CMJ), pp. 687–698.
SIGMODSIGMOD-2010-PoundIW #flexibility #keyword
Expressive and flexible access to web-extracted data: a keyword-based structured query language (JP, IFI, GEW), pp. 423–434.
SIGMODSIGMOD-2010-QiJSP #nondeterminism #optimisation
Threshold query optimization for uncertain data (YQ, RJ, SS, SP), pp. 315–326.
SIGMODSIGMOD-2010-RaghavanR #framework #generative #multi #named
ProgXe: progressive result generation framework for multi-criteria decision support queries (VR, EAR), pp. 1135–1138.
SIGMODSIGMOD-2010-SarkasPT #web
Structured annotations of web queries (NS, SP, PT), pp. 771–782.
SIGMODSIGMOD-2010-SternBB #approach #network
Processing continuous join queries in sensor networks: a filtering approach (MS, KB, EB), pp. 267–278.
SIGMODSIGMOD-2010-VartakRR #assurance #generative #named
QRelX: generating meaningful queries that provide cardinality assurance (MV, VR, EAR), pp. 1215–1218.
SIGMODSIGMOD-2010-Wei #graph #named #performance
TEDI: efficient shortest path query answering on graphs (FW0), pp. 99–110.
SIGMODSIGMOD-2010-WuOT #multi #online
Continuous sampling for online aggregation over multiple queries (SW, BCO, KLT), pp. 651–662.
SIGMODSIGMOD-2010-ZhouCC #named #prototype #type system
DoCQS: a prototype system for supporting data-oriented content query (MZ, TC, KCCC), pp. 1211–1214.
SIGMODSIGMOD-2010-ZhouSTLLM #maintenance #network #performance
Efficient querying and maintenance of network provenance at internet-scale (WZ, MS, TT, XL, BTL, YM), pp. 615–626.
VLDBVLDB-2010-AbdessalemCD #lightweight #named #web
ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data (TA, BC, ND), pp. 1585–1588.
VLDBVLDB-2010-AkdereCU #predict #streaming
Database-support for Continuous Prediction Queries over Streaming Data (MA, , EU), pp. 1291–1301.
VLDBVLDB-2010-BrunoNR #slicing
Slicing Long-Running Queries (NB, VRN, RR), pp. 530–541.
VLDBVLDB-2010-CaliGP #ontology
Advanced Processing for Ontological Queries (AC, GG, AP), pp. 554–565.
VLDBVLDB-2010-CanimKHM #database #relational
Building Disclosure Risk Aware Query Optimizers for Relational Databases (MC, MK, BH, SM), pp. 13–24.
VLDBVLDB-2010-DeutchMPY #evaluation #process
Optimal Top-K Query Evaluation for Weighted Business Processes (DD, TM, NP, TY), pp. 940–951.
VLDBVLDB-2010-FabbriLZ #named
PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting (DF, KL, QZ), pp. 36–47.
VLDBVLDB-2010-Haritsa #database #visualisation
The Picasso Database Query Optimizer Visualizer (JRH), pp. 1517–1520.
VLDBVLDB-2010-HerodotouB #named
Xplus: A SQL-Tuning-Aware Query Optimizer (HH, SB), pp. 1149–1160.
VLDBVLDB-2010-HerschelH
Explaining Missing Answers to SPJUA Queries (MH, MAH), pp. 185–196.
VLDBVLDB-2010-IoannouNNV #on the fly
On-the-Fly Entity-Aware Query Processing in the Presence of Linkage (EI, WN, CN, YV), pp. 429–438.
VLDBVLDB-2010-KazemitabarDAAS #sql #using
Geospatial Stream Query Processing using Microsoft SQL Server StreamInsight (SJK, UD, MHA, AA, CS), pp. 1537–1540.
VLDBVLDB-2010-LoCH #database #generative
Generating Databases for Query Workloads (EL, NC, WKH), pp. 848–859.
VLDBVLDB-2010-ManethN #optimisation #xpath
XPath Whole Query Optimization (SM, KN), pp. 882–893.
VLDBVLDB-2010-MozafariZZ #execution #regular expression #relational #sequence #word #xml
From Regular Expressions to Nested Words: Unifying Languages and Query Execution for Relational and XML Sequences (BM, KZ, CZ), pp. 150–161.
VLDBVLDB-2010-NeumannW #consistency #database #named #performance #rdf
x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases (TN, GW), pp. 256–263.
VLDBVLDB-2010-NykielPMKK #multi #named #pipes and filters
MRShare: Sharing Across Multiple Queries in MapReduce (TN, MP, CM, GK, NK), pp. 494–505.
VLDBVLDB-2010-PangDX #privacy
Embellishing Text Search Queries To Protect User Privacy (HP, XD, XX), pp. 598–607.
VLDBVLDB-2010-PestiLBIW #mobile #named #network #scalability
RoadTrack: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness (PP, LL, BB, AI, MW), pp. 1493–1504.
VLDBVLDB-2010-PramanikWML
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access (SP, AW, CRM, AXL), pp. 409–416.
VLDBVLDB-2010-QinYC #keyword #parallel
Ten Thousand SQLs: Parallel Keyword Queries Computing (LQ, JXY, LC), pp. 58–69.
VLDBVLDB-2010-SenDG #database #evaluation #probability
Read-Once Functions and Query Evaluation in Probabilistic Databases (PS, AD, LG), pp. 1068–1079.
VLDBVLDB-2010-SharifzadehS #diagrams #named #nearest neighbour #performance
VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries (MS, CS), pp. 1231–1242.
VLDBVLDB-2010-TzoumasDJ #clustering #correlation
Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing (KT, AD, CSJ), pp. 542–553.
VLDBVLDB-2010-VlachouDNK #identification
Identifying the Most Influential Data Objects with Reverse Top-k Queries (AV, CD, KN, YK), pp. 364–372.
VLDBVLDB-2010-VoCO #towards #transaction
Towards Elastic Transactional Cloud Storage with Range Query Support (HTV, CC, BCO), pp. 506–517.
VLDBVLDB-2010-WangFGH #information management #probability
Querying Probabilistic Information Extraction (DZW, MJF, MNG, JMH), pp. 1057–1067.
VLDBVLDB-2010-WuBMPS
Processing Top-k Join Queries (MW, LBE, AM, CMP, DS), pp. 860–870.
VLDBVLDB-2010-ZhaoH #graph #network #on the #optimisation #scalability
On Graph Query Optimization in Large Networks (PZ, JH), pp. 340–351.
VLDBVLDB-2010-ZouWSHAGW #distributed #relational
From a Stream of Relational Queries to Distributed Stream Processing (QZ, HW, RS, MH, HA, BG, KLW), pp. 1394–1405.
VLDBVLDB-2011-MeliouGMS #complexity
The Complexity of Causality and Responsibility for Query Answers and non-Answers (AM, WG, KFM, DS), pp. 34–45.
VLDBVLDB-2011-OroRS10 #documentation #named #towards #web #xpath
SXPath — Extending XPath towards Spatial Querying on Web Documents (EO, MR, SS), pp. 129–140.
VLDBVLDB-2011-RiceT10 #graph #network #strict
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions (MNR, VJT), pp. 69–80.
VLDBVLDB-2011-Rocha-JuniorVDN10 #performance
Efficient Processing of Top-k Spatial Preference Queries (JBRJ, AV, CD, KN), pp. 93–104.
VLDBVLDB-2011-SagyKSS10 #difference #distributed #representation
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation (GS, DK, IS, AS), pp. 46–57.
EDMEDM-2010-MostowT #named
AutoJoin: Generalizing an Example into an EDM query (JM, BH(T), pp. 307–308.
CIAACIAA-2010-TirnaucaT #automaton #identification
Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (CT, CIT), pp. 272–281.
SEFMSEFM-2010-KatzK #refinement #specification
User Queries for Specification Refinement Treating Shared Aspect Join Points (EK, SK), pp. 73–82.
CHICHI-2010-ChoKJSS #distance #interface #proximity
Dynamic query interface for spatial proximity query with degree-of-interest varied by distance to query point (MC, BHK, DKJ, YGS, JS), pp. 693–702.
CHICHI-2010-KellyCDNG #information management #quality
Effects of popularity and quality on the usage of query suggestions during information search (DK, AC, MD, XN, KG), pp. 45–54.
CAiSECAiSE-2010-StecherCNN #integration #ranking
Query Ranking in Information Integration (RS, SC, CN, WN), pp. 230–235.
ICEISICEIS-DISI-2010-LemosCV #relational #sql #using #xml
Using SQL/XML for Efficiently Translating Queries over XML View of Relational Data (FCL, CC, VMPV), pp. 269–274.
ICEISICEIS-DISI-2010-PanZH #library #open source #retrieval #using
An Open Source Software based Library Catalogue System using Soundexing Retrieval and Query Caching (ZP, YZ, JH), pp. 182–189.
ICEISICEIS-ISAS-2010-ClariziaGN #identification #web
A New Technique for Identification of Relevant Web Pages in Informational Queries Results (FC, LG, PN), pp. 70–79.
ICEISICEIS-J-2010-BorovskiyKZ10a #api #data access #enterprise
Business Object Query Language as Data Access API in ERP Systems (VB, WK, AZ), pp. 135–148.
CIKMCIKM-2010-BenderskyCS #feedback #pseudo #using
Structural annotation of search queries using pseudo-relevance feedback (MB, WBC, DAS), pp. 1537–1540.
CIKMCIKM-2010-CaiP #graph #named #reachability #scalability
Path-hop: efficiently indexing large graphs for reachability queries (JC, CKP), pp. 119–128.
CIKMCIKM-2010-CarmanCHB #modelling #personalisation #topic #towards #using
Towards query log based personalization using topic models (MJC, FC, MH, MB), pp. 1849–1852.
CIKMCIKM-2010-CartrightALM #approximate #modelling #performance #using
Fast query expansion using approximations of relevance models (MAC, JA, VL, AM), pp. 1573–1576.
CIKMCIKM-2010-ChenLZY #energy #network
Energy-efficient top-k query processing in wireless sensor networks (BC, WL, RZ, JXY), pp. 329–338.
CIKMCIKM-2010-ChongQSBNZ #evaluation #rdf #streaming
Open user schema guided evaluation of streaming RDF queries (ZC, GQ, HS, JB, WN, AZ), pp. 1281–1284.
CIKMCIKM-2010-ChrysakisCP #algorithm #evaluation #network #peer-to-peer #using
Evaluation of top-k queries in peer-to-peer networks using threshold algorithms (IC, CC, DP), pp. 1305–1308.
CIKMCIKM-2010-DeyJ #approach #database #graph #reachability #scalability
A hierarchical approach to reachability query answering in very large graph databases (SKD, HMJ), pp. 1377–1380.
CIKMCIKM-2010-GaoYW #mining #multi #named
SEQUEL: query completion via pattern mining on multi-column structural data (CG, QY, JW), pp. 1955–1956.
CIKMCIKM-2010-Garcia-AlvaradoCO #recommendation
OLAP-based query recommendation (CGA, ZC, CO), pp. 1353–1356.
CIKMCIKM-2010-GuoCXS #approach #recommendation #social
A structured approach to query recommendation with social annotation data (JG, XC, GX, HS), pp. 619–628.
CIKMCIKM-2010-GuptaGNM #using
Efficiently querying archived data using Hadoop (RG, HG, UN, MKM), pp. 1301–1304.
CIKMCIKM-2010-HauffKA #comparison #performance #predict
A comparison of user and system query performance predictions (CH, DK, LA), pp. 979–988.
CIKMCIKM-2010-HouleOQ #similarity
Active caching for similarity queries based on shared-neighbor information (MEH, VO, UQ), pp. 669–678.
CIKMCIKM-2010-HuangSN #graph #refinement #using #word
Query model refinement using word graphs (YH, LS, JYN), pp. 1453–1456.
CIKMCIKM-2010-JainM #web
Organizing query completions for web search (AJ, GM), pp. 1169–1178.
CIKMCIKM-2010-KaluarachchiVBWPF #evolution #retrieval
Incorporating terminology evolution for query translation in text retrieval with association rules (ACK, ASV, SJB, GW, JP, AF), pp. 1789–1792.
CIKMCIKM-2010-KashyapHP #named
FACeTOR: cost-driven exploration of faceted query results (AK, VH, MP), pp. 719–728.
CIKMCIKM-2010-KhalefaML #nondeterminism
Skyline query processing for uncertain data (MEK, MFM, JJL), pp. 1293–1296.
CIKMCIKM-2010-KotovKDC #profiling #ranking #web
Temporal query log profiling to improve web search ranking (AK, PK, LD, YC), pp. 1149–1158.
CIKMCIKM-2010-LevandoskiMK #evaluation
Preference query evaluation over expensive attributes (JJL, MFM, MEK), pp. 319–328.
CIKMCIKM-2010-LiH #integration #ontology #optimisation
Query optimization for ontology-based information integration (YL, JH), pp. 1369–1372.
CIKMCIKM-2010-LiLY #named #semantics #using
EntityEngine: answering entity-relationship queries using shallow semantics (XL, CL, CY), pp. 1925–1926.
CIKMCIKM-2010-LinYC #probability
Selective data acquisition for probabilistic K-NN query (YCL, DNY, MSC), pp. 1357–1360.
CIKMCIKM-2010-ParkSYRY #network #performance
An efficient data-centric storage scheme considering storage and query hot-spots in sensor networks (YP, DS, JY, CTR, JY), pp. 1325–1328.
CIKMCIKM-2010-PobleteBMB #graph #image #retrieval #semantic gap #using #web
Visual-semantic graphs: using queries to reduce the semantic gap in web image retrieval (BP, BB, MM, JMB), pp. 1553–1556.
CIKMCIKM-2010-XueHC #set #using
Improving verbose queries using subset distribution (XX, SH, WBC), pp. 1059–1068.
ECIRECIR-2010-ArampatzisK #empirical
An Empirical Study of Query Specificity (AA, JK), pp. 594–597.
ECIRECIR-2010-BalogBR #modelling
Category-Based Query Modeling for Entity Search (KB, MB, MdR), pp. 319–331.
ECIRECIR-2010-Collins-ThompsonB #classification #performance #predict
Predicting Query Performance via Classification (KCT, PNB), pp. 140–152.
ECIRECIR-2010-CoxZFH #approximate #correctness #using
Improving Query Correctness Using Centralized Probably Approximately Correct (PAC) Search (IJC, JZ, RF, LKH), pp. 265–280.
ECIRECIR-2010-GoharianFYM #peer-to-peer #using
Enriching Peer-to-Peer File Descriptors Using Association Rules on Query Logs (NG, OF, WGY, JM), pp. 636–639.
ECIRECIR-2010-HauffAHJ #effectiveness #evaluation #performance #predict
Query Performance Prediction: Evaluation Contrasted with Effectiveness (CH, LA, DH, FdJ), pp. 204–216.
ECIRECIR-2010-KellyJ #independence #retrieval
Biometric Response as a Source of Query Independent Scoring in Lifelog Retrieval (LK, GJFJ), pp. 520–531.
ECIRECIR-2010-MendozaMFP #learning #web
Learning to Distribute Queries into Web Search Nodes (MM, MM, FF, BP), pp. 281–292.
ECIRECIR-2010-PascaARMH #web
The Role of Query Sessions in Extracting Instance Attributes from Web Search Queries (MP, EA, ERA, RMB, KBH), pp. 62–74.
ECIRECIR-2010-RudinacLH #consistency #retrieval
Exploiting Result Consistency to Select Query Expansions for Spoken Content Retrieval (SR, ML, AH), pp. 645–648.
ECIRECIR-2010-SahibTR #elicitation #interactive
Enabling Interactive Query Expansion through Eliciting the Potential Effect of Expansion Terms (NGS, AT, IR), pp. 532–543.
ECIRECIR-2010-SaralegiL #web
Estimating Translation Probabilities from the Web for Structured Queries on CLIR (XS, MLdL), pp. 586–589.
ECIRECIR-2010-XingZH #image #predict #retrieval
Query Difficulty Prediction for Contextual Image Retrieval (XX, YZ, MH), pp. 581–585.
ECIRECIR-2010-ZhengF #information retrieval
Query Aspect Based Term Weighting Regularization in Information Retrieval (WZ, HF), pp. 344–356.
ICPRICPR-2010-HarmanciH #adaptation #image
Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries (OH, IH), pp. 1582–1585.
KDDKDD-2010-LaoC #execution #modelling #performance #random #retrieval
Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.
KDDKDD-2010-MaserratP #network #social
Neighbor query friendly compression of social networks (HM, JP), pp. 533–542.
KDIRKDIR-2010-AsfariDBS #web
A Context-based Model for Web Query Reformulation (OA, BLD, YB, JPS), pp. 288–293.
KDIRKDIR-2010-CamposFHM #approach #feedback
A Content-Bsed Approach to Relevance Feedback in XML-IR for Content and Structure Queries (LMdC, JMFL, JFH, CJMD), pp. 418–427.
KDIRKDIR-2010-Codina-FilbaN #analysis #behaviour #internet #web
Collective Behaviour in Internet — Tendency Analysis of the Frequency of User Web Queries (JCF, DFN), pp. 168–175.
KDIRKDIR-2010-JedrzejczakW #generative #using
Integrated Candidate Generation in Processing Batches of Frequent Itemset Queries using Apriori (PJ, MW), pp. 487–490.
KDIRKDIR-2010-KleizaKT #approach #documentation #identification #semantics #similarity #visualisation #word
Semantic Identification and Visualization of Significant Words within Documents — Approach to Visualize Relevant Words within Documents to a Search Query by Word Similarity Computation (KK, PK, KDT), pp. 481–486.
KDIRKDIR-2010-SharmaV #enterprise #wiki
Query Processing for Enterprise Search with Wikipedia Link Structure (NS, VV), pp. 243–248.
KDIRKDIR-2010-SinghMG #feedback #realtime
Dynamic Query Expansion based on User’s Real Time Implicit Feedback (SRS, HAM, TAG), pp. 112–121.
KRKR-2010-BaaderBLW #logic
Query and Predicate Emptiness in Description Logics (FB, MB, CL, FW).
KRKR-2010-GlimmR #decidability
Status QIO: Conjunctive Query Entailment Is Decidable (BG, SR).
KRKR-2010-KontchakovLTWZ #approach
The Combined Approach to Query Answering in DL-Lite (RK, CL, DT, FW, MZ).
KRKR-2010-RosatiA #ontology
Improving Query Answering over DL-Lite Ontologies (RR, AA).
RecSysRecSys-2010-Baeza-Yates #predict #recommendation
Query intent prediction and recommendation (RABY), pp. 5–6.
SIGIRSIGIR-2010-BalasubramanianKC #reduction #web
Exploring reductions for long web queries (NB, GK, VRC), pp. 571–578.
SIGIRSIGIR-2010-BalasubramanianKC10a #performance #predict #web
Predicting query performance on the web (NB, GK, VRC), pp. 785–786.
SIGIRSIGIR-2010-BordinoCDG #graph #similarity
Query similarity by projecting the query-flow graph (IB, CC, DD, AG), pp. 515–522.
SIGIRSIGIR-2010-CambazogluVKAB #distributed
Query forwarding in geographically distributed search engines (BBC, EV, EK, CA, RABY), pp. 90–97.
SIGIRSIGIR-2010-CarmelY #information retrieval
Estimating the query difficulty for information retrieval (DC, EYT), p. 911.
SIGIRSIGIR-2010-ChenYLZQ #classification #personalisation #predict #question
Predicting query potential for personalization, classification or regression? (CC, MY, SL, TZ, HQ), pp. 725–726.
SIGIRSIGIR-2010-DangBC #learning #rank
Learning to rank query reformulations (VD, MB, WBC), pp. 807–808.
SIGIRSIGIR-2010-DuZYCC #recognition #using
Using search session context for named entity recognition in query (JD, ZZ, JY, YC, ZC), pp. 765–766.
SIGIRSIGIR-2010-FengCCZL #multi #video #web
Multi-modal query expansion for web video search (BF, JC, ZC, YZ, SL), pp. 721–722.
SIGIRSIGIR-2010-FilaliNL #ambiguity #transitive
Transitive history-based query disambiguation for query reformulation (KF, AN, CL), pp. 849–850.
SIGIRSIGIR-2010-GoharianM #classification #using
Context aware query classification using dynamic query window and relationship net (NG, SSRM), pp. 723–724.
SIGIRSIGIR-2010-HagenPSB #power of #segmentation
The power of naive query segmentation (MH, MP, BS, CB), pp. 797–798.
SIGIRSIGIR-2010-HauffJKA #predict #quality
Query quality: user ratings and system predictions (CH, FdJ, DK, LA), pp. 743–744.
SIGIRSIGIR-2010-HerdagdelenCMHHRA #modelling #semantics
Generalized syntactic and semantic models of query reformulation (AH, MC, DM, MH, KBH, SR, EA), pp. 283–290.
SIGIRSIGIR-2010-HustonC
Evaluating verbose query processing techniques (SH, WBC), pp. 291–298.
SIGIRSIGIR-2010-LevelingJ
Query recovery of short user queries: on query expansion with stopwords (JL, GJFJ), pp. 733–734.
SIGIRSIGIR-2010-MeijR #modelling #using #wiki
Supervised query modeling using wikipedia (EM, MdR), pp. 875–876.
SIGIRSIGIR-2010-PandeyPFJ
Estimating advertisability of tail queries for sponsored search (SP, KP, MF, VJ), pp. 563–570.
SIGIRSIGIR-2010-ParkC #dependence #parsing #ranking
Query term ranking based on dependency parsing of verbose queries (JHP, WBC), pp. 829–830.
SIGIRSIGIR-2010-RudinacLH #concept #retrieval #visual notation
Visual concept-based selection of query expansions for spoken content retrieval (SR, ML, AH), pp. 891–892.
SIGIRSIGIR-2010-TorresHS #analysis #information retrieval
Query log analysis in the context of information retrieval for children (SDT, DH, PS), pp. 847–848.
SIGIRSIGIR-2010-WangH #distance #effectiveness #metric #similarity
Effective query expansion with the resistance distance based term similarity metric (SW, MH), pp. 715–716.
SIGIRSIGIR-2010-WangLC #bound #detection
Intent boundary detection in search query logs (CJW, KHYL, HHC), pp. 749–750.
SIGIRSIGIR-2010-WhiteH10a #predict #web
Predicting escalations of medical queries based on web page structure and content (RWW, EH), pp. 769–770.
MODELSMoDELS-v1-2010-BergmannHRVBBO #emf #evaluation #incremental #modelling
Incremental Evaluation of Model Queries over EMF Models (GB, ÁH, IR, DV, AB, ZB, ), pp. 76–90.
PADLPADL-2010-GomesAS #hybrid #implementation #knowledge base
Implementing Query Answering for Hybrid MKNF Knowledge Bases (ASG, JJA, TS), pp. 25–39.
PPDPPPDP-2010-TekleGL #datalog #graph #optimisation
Graph queries through datalog optimizations (KTT, MG, YAL), pp. 25–34.
PPDPPPDP-2010-TekleL #analysis #complexity #datalog #performance #precise
Precise complexity analysis for efficient datalog queries (KTT, YAL), pp. 35–44.
ASEASE-2010-GibiecCC #mining #towards
Towards mining replacement queries for hard-to-retrieve traces (MG, AC, JCH), pp. 245–254.
ASEASE-2010-KhalekK #automation #database #generative #sql #testing
Automated SQL query generation for systematic testing of database engines (SAK, SK), pp. 329–332.
ASEASE-2010-WangLCZMY #dependence #graph
Matching dependence-related queries in the system dependence graph (XW, DL, JC, LZ, HM, JXY), pp. 457–466.
FSEFSE-2010-KimGLR #logic #named #re-engineering #refactoring
Ref-Finder: a refactoring reconstruction tool based on logic query templates (MK, MG, AL, NR), pp. 371–372.
ICSEICSE-2010-WurschGRG #developer #natural language
Supporting developers with natural language queries (MW, GG, GR, HG), pp. 165–174.
SACSAC-2010-BelohlavekV10a #database #logic #similarity
Query systems in similarity-based databases: logical foundations, expressive power, and completeness (RB, VV), pp. 1648–1655.
SACSAC-2010-BenaouichaTB #flexibility #probability
Flexible document-query matching based on a probabilistic content and structure score combination (MB, MT, MB), pp. 1728–1734.
SACSAC-2010-BraynerCS #approach #detection #energy #network #quality #requirements
Dealing with application requirements and energy consumption in wireless sensor networks: a novelty detection approach for quality of query services (AB, ALVC, KMdS), pp. 786–790.
SACSAC-2010-CalvaneseKNRS #database #ontology #visual notation
Web-based graphical querying of databases through an ontology: the Wonder system (DC, CMK, WN, MRM, GS), pp. 1388–1395.
SACSAC-2010-Chen #algorithm
A time optimal algorithm for evaluating tree pattern queries (YC), pp. 1638–1642.
SACSAC-2010-DomanPD #fuzzy #network
Leveraging fuzzy query processing to support applications in wireless sensor networks (MD, JP, TD), pp. 764–771.
SACSAC-2010-ElliottMCOO #database #interface #network
Advanced querying interface for biochemical network databases (BE, SM, AC, , ZMÖ), pp. 1526–1533.
SACSAC-2010-JungCCL #on the
On processing location based top-k queries in the wireless broadcasting system (HJ, BKC, YDC, LL), pp. 585–591.
SACSAC-2010-LamprierASL10a #approach #clustering #multi
Query-oriented clustering: a multi-objective approach (SL, TA, FS, BL), pp. 1789–1795.
GPCEGPCE-J-2007-GilL10 #c++ #sql
Simple and safe SQL queries with C++ templates (JYG, KL), pp. 573–595.
CCCC-2010-IuCZ #database #imperative #named
JReq: Database Queries in Imperative Languages (MYI, EC, WZ), pp. 84–103.
HPDCHPDC-2010-GehaniKM #distributed #performance
Efficient querying of distributed provenance stores (AG, MK, TM), pp. 613–621.
HPDCHPDC-2010-PanBM #multi #pipes and filters
Parallelizing multiple group-by query in share-nothing environment: a MapReduce study case (JP, YLB, FM), pp. 856–863.
PDPPDP-2010-CostaBMB #manycore #scheduling
Scheduling Metric-Space Queries Processing on Multi-Core Processors (VGC, RJB, MM, CB), pp. 187–194.
STOCSTOC-2010-Marx #constraints
Tractable hypergraph properties for constraint satisfaction and conjunctive queries (DM), pp. 735–744.
CSLCSL-2010-BaganDFG #performance
Efficient Enumeration for Conjunctive Queries over X-underbar Structures (GB, AD, EF, OG), pp. 80–94.
ICLPICLP-J-2010-AlvianoFL #decidability #effectiveness
Disjunctive ASP with functions: Decidable queries and effective computation (MA, WF, NL), pp. 497–512.
LICSLICS-2010-BaranyGO
Querying the Guarded Fragment (VB, GG, MO), pp. 1–10.
LICSLICS-2010-CaliGLMP #datalog #information management #logic #product line #representation
Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications (AC, GG, TL, BM, AP), pp. 228–242.
DocEngDocEng-2009-BarcenasGL #analysis #constraints #on the
On the analysis of queries with counting constraints (EB, PG, NL), pp. 21–24.
TPDLECDL-2009-BerndBKWS #3d #architecture #user interface
Demonstration of User Interfaces for Querying in 3D Architectural Content in PROBADO3D (RB, IB, HK, RW, TS), pp. 491–492.
TPDLECDL-2009-BuccioMM #effectiveness #information retrieval #network #peer-to-peer
Improving Information Retrieval Effectiveness in Peer-to-Peer Networks through Query Piggybacking (EDB, IM, MM), pp. 420–424.
TPDLECDL-2009-ConstantopoulosDF
Developing Query Patterns (PC, VD, EF), pp. 119–124.
TPDLECDL-2009-DammKFC #concept #library #multimodal #music #using
A Concept for Using Combined Multimodal Queries in Digital Music Libraries (DD, FK, CF, MC), pp. 261–272.
ICDARICDAR-2009-Rodriguez-SerranoP #image #retrieval #word
Handwritten Word Image Retrieval with Synthesized Typed Queries (JARS, FP), pp. 351–355.
JCDLJCDL-2009-DiriyeBT #approach #interactive
A polyrepresentational approach to interactive query expansion (AD, AB, AT), pp. 217–220.
JCDLJCDL-2009-MarchioniniSLC #information management #parametricity #video
Query parameters for harvesting digital video and associated contextual information (GM, CS, CAL, RC), pp. 77–86.
PODSPODS-2009-AbiteboulBM #documentation #satisfiability
Satisfiability and relevance for queries over active documents (SA, PB, BM), pp. 87–96.
PODSPODS-2009-BarceloLPS #modelling #xml
XML with incomplete information: models, properties, and query answering (PB, LL, AP, CS), pp. 237–246.
PODSPODS-2009-CaliGL #framework #ontology
A general datalog-based framework for tractable query answering over ontologies (AC, GG, TL), pp. 77–86.
PODSPODS-2009-ChirkovaG #dependence #embedded #equivalence #sql
Equivalence of SQL queries in presence of embedded dependencies (RC, MRG), pp. 217–226.
PODSPODS-2009-DeHaan #equivalence #semantics
Equivalence of nested queries with mixed semantics (DD), pp. 207–216.
PODSPODS-2009-GottlobLV #bound
Size and treewidth bounds for conjunctive queries (GG, STL, GV), pp. 45–54.
PODSPODS-2009-LiD #database #probability
Consensus answers for queries over probabilistic databases (JL, AD), pp. 259–268.
PODSPODS-2009-RastogiHMS #privacy
Relationship privacy: output perturbation for queries with joins (VR, MH, GM, DS), pp. 107–116.
PODSPODS-2009-Yi #bound
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes (KY), pp. 187–196.
SIGMODSIGMOD-2009-BrodskyBCEW #abstraction #database #programming
A decisions query language (DQL): high-level abstraction for mathematical programming over databases (AB, MMB, MC, NEE, XSW), pp. 1059–1062.
SIGMODSIGMOD-2009-BrunoCR #interactive #optimisation
Interactive plan hints for query optimization (NB, SC, RR), pp. 1043–1046.
SIGMODSIGMOD-2009-Chaudhuri #contract #question
Query optimizers: time to rethink the contract? (SC), pp. 961–968.
SIGMODSIGMOD-2009-ChuBCDN #ad hoc #database #keyword
Combining keyword search and forms for ad hoc querying of databases (EC, AB, XC, AD, JFN), pp. 349–360.
SIGMODSIGMOD-2009-ElmonguiNR #framework #testing
A framework for testing query transformation rules (HGE, VRN, RR), pp. 257–268.
SIGMODSIGMOD-2009-GaoZ #database #nearest neighbour
Continuous obstructed nearest neighbor queries in spatial databases (YG, BZ), pp. 577–590.
SIGMODSIGMOD-2009-GeZM #nondeterminism
Top-k queries on uncertain data: on score distribution and typical answers (TG, SBZ, SM), pp. 375–388.
SIGMODSIGMOD-2009-GhazalSBCKG #generative
Dynamic plan generation for parameterized queries (AG, DYS, RB, AC, MK, VG), pp. 909–916.
SIGMODSIGMOD-2009-HanL #manycore #optimisation #order
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs (WSH, JL), pp. 45–58.
SIGMODSIGMOD-2009-JiangYCC #ad hoc #detection #named
AIDE: ad-hoc intents detection engine over query logs (YJ, HTY, KCCC, YSC), pp. 1091–1094.
SIGMODSIGMOD-2009-JinXRF #named #reachability
3-HOP: a high-compression indexing scheme for reachability query (RJ, YX, NR, DF), pp. 813–826.
SIGMODSIGMOD-2009-KimC #documentation #named #performance #retrieval
Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval (JWK, KSC), pp. 115–126.
SIGMODSIGMOD-2009-KimelfeldSW #documentation #named #xml
ExQueX: exploring and querying XML documents (BK, YS, GW), pp. 1103–1106.
SIGMODSIGMOD-2009-McSherry #data analysis #framework #platform #privacy
Privacy integrated queries: an extensible platform for privacy-preserving data analysis (FM), pp. 19–30.
SIGMODSIGMOD-2009-MeiM #adaptation #cost analysis #detection #named
ZStream: a cost-based query processor for adaptively detecting composite events (YM, SM), pp. 193–206.
SIGMODSIGMOD-2009-MoonCHZ #evolution #named
PRIMA: archiving and querying historical data with evolving schemas (HJM, CC, MH, CZ), pp. 1019–1022.
SIGMODSIGMOD-2009-Neumann #optimisation
Query simplification: graceful degradation for join-order optimization (TN0), pp. 403–414.
SIGMODSIGMOD-2009-NicaBH #visualisation
Extreme visualisation of query optimizer search space (AN, DSB, DWH), pp. 1067–1070.
SIGMODSIGMOD-2009-OlteanuH
Secondary-storage confidence computation for conjunctive queries with inequalities (DO, JH), pp. 389–402.
SIGMODSIGMOD-2009-PaparizosNSA #data flow #using #web
Answering web queries using structured data sources (SP, AN, JCS, RA), pp. 1127–1130.
SIGMODSIGMOD-2009-TranCP
Query by output (QTT, CYC, SP), pp. 535–548.
SIGMODSIGMOD-2009-TsirogiannisHSWG
Query processing techniques for solid state drives (DT, SH, MAS, JLW, GG), pp. 59–72.
SIGMODSIGMOD-2009-WaasH
Parallelizing extensible query optimizers (FMW, JMH), pp. 871–878.
VLDBVLDB-2009-BeskalesSIB #detection #modelling
Modeling and Querying Possible Repairs in Duplicate Detection (GB, MAS, IFI, SBD), pp. 598–609.
VLDBVLDB-2009-CateCKT #sql
Laconic Schema Mappings: Computing the Core with SQL Queries (BtC, LC, PGK, WCT), pp. 1006–1017.
VLDBVLDB-2009-CautisDOV #performance #set #specification #using #xpath
Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.
VLDBVLDB-2009-ChandramouliGM #detection #on the fly
On-the-fly Progress Detection in Iterative Stream Queries (BC, JG, DM), pp. 241–252.
VLDBVLDB-2009-ChaudhuriD #database #keyword #ranking
Keyword querying and Ranking in Databases (SC, GD), pp. 1658–1659.
VLDBVLDB-2009-ChaudhuriNR #optimisation #testing
Exact Cardinality Query Optimization for Optimizer Testing (SC, VRN, RR), pp. 994–1005.
VLDBVLDB-2009-GuptaS #web
Answering Table Augmentation Queries from Unstructured Lists on the Web (RG, SS), pp. 289–300.
VLDBVLDB-2009-HassanzadehXMKLW
Linkage Query Writer (OH, RX, RJM, AK, LL, MW), pp. 1590–1593.
VLDBVLDB-2009-KabischDYL #approach #integration #interface #web
A Hierarchical Approach to Model Web Query Interfaces for Web Source Integration (TK, ECD, CTY, UL), pp. 325–336.
VLDBVLDB-2009-LiuLGF #approximate #network
Enabling epsilon-Approximate Querying in Sensor Networks (YL, JL, HG, XF), pp. 169–180.
VLDBVLDB-2009-MullerTA #compilation
Streams on Wires — A Query Compiler for FPGAs (RM, JT, GA), pp. 229–240.
VLDBVLDB-2009-NehmeWRB #multi
Query Mesh: Multi-Route Query Processing Technology (RVN, KW, EAR, EB), pp. 1530–1533.
VLDBVLDB-2009-UMM #algorithm #multi
A Fair Assignment Algorithm for Multiple Preference Queries (LHU, NM, KM), pp. 1054–1065.
VLDBVLDB-2009-VigfussonSCF #adaptation #distributed
Adaptively Parallelizing Distributed Range Queries (YV, AS, BFC, RF), pp. 682–693.
VLDBVLDB-2009-ZhangACIMPS #xml
Binary XML Storage and Query Processing in Oracle 11g (NZ, NA, SC, SI, VM, SP, BS), pp. 1354–1365.
VLDBVLDB-2009-ZhangCJOZ #effectiveness #nondeterminism #predict
Effectively Indexing Uncertain Moving Objects for Predictive Queries (MZ, SC, CSJ, BCO, ZZ), pp. 1198–1209.
VLDBVLDB-2009-ZhouSA #delivery #scalability
Scalable Delivery of Stream Query Results (YZ, AS, KA), pp. 49–60.
VLDBVLDB-2009-ZouCO #database #graph #named #scalability
DistanceJoin: Pattern Match Query In a Large Graph Database (LZ, LC, MTÖ), pp. 886–897.
CIAACIAA-2009-FreivaldsI #permutation #quantum
Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.
CIAACIAA-2009-InabaH #representation #set
Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.
ICALPICALP-v1-2009-DemaineLW #on the
On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
LATALATA-2009-GauwinNT #bound #concurrent
Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
ICFPICFP-2009-GenevesLQ #evolution #identification #xml
Identifying query incompatibilities with evolving XML schemas (PG, NL, VQ), pp. 221–230.
CAiSECAiSE-2009-HornungML #algebra #process #workflow
Process Algebra-Based Query Workflows (TH, WM, GL), pp. 440–454.
ICEISICEIS-DISI-2009-BergerS #architecture #case study #implementation #named
FedDW: A Tool for Querying Federations of Data Warehouses — Architecture, Use Case and Implementation (SB, MS), pp. 113–122.
ICEISICEIS-DISI-2009-ElarissKG #multi #optimisation #paradigm
Query Melting — A New Paradigm for GIS Multiple Query Optimization (HEE, SK, DG), pp. 82–90.
ICEISICEIS-DISI-2009-GorawskiD #algorithm #distributed #execution #performance
Algorithms for Efficient Top-K Spatial Preference Query Execution in a Heterogeneous Distributed Environment (MG, KD), pp. 43–48.
ICEISICEIS-DISI-2009-KudagbaBB #semantics #xml
An User-centric and Semantic-driven Query Rewriting over Proteomics XML Sources (KK, OEB, HB), pp. 123–130.
ICEISICEIS-DISI-2009-Perez-CebrerosMC #algorithm #parallel #scheduling
PSO-based Resource Scheduling Algorithm for Parallel Query Processing on Grids (APC, GML, NCC), pp. 131–137.
ICEISICEIS-DISI-2009-SantosB #optimisation #performance
A Bit-selector Technique for Performance Optimization of Decision-support Queries (RJS, JB), pp. 151–157.
ICEISICEIS-J-2009-CastellaniKRWG #maintenance
Creation and Maintenance of Query Expansion Rules (SC, ANK, FR, JW, AG), pp. 819–830.
ICEISICEIS-J-2009-ChoB #retrieval #xml
Relaxing XML Preference Queries for Cooperative Retrieval (SC, WTB), pp. 160–171.
ICEISICEIS-J-2009-Cuzzocrea #approximate #evaluation #named #probability #reduction #scalability
s-OLAP: Approximate OLAP Query Evaluation on Very Large Data Warehouses via Dimensionality Reduction and Probabilistic Synopses (AC), pp. 248–262.
ICEISICEIS-J-2009-QuimbayaRAV #knowledge base #scalability
Knowledge Based Query Processing in Large Scale Virtual Organizations (APQ, CR, JA, MDPV), pp. 208–219.
CIKMCIKM-2009-AltingovdeOU #web
Exploiting query views for static index pruning in web search engines (ISA, RO, ÖU), pp. 1951–1954.
CIKMCIKM-2009-BaragliaCDNPS #graph
Aging effects on query flow graphs for query suggestion (RB, CC, DD, FMN, RP, FS), pp. 1947–1950.
CIKMCIKM-2009-BohmFOPW #probability
Probabilistic skyline queries (CB, FF, AO, CP, BW), pp. 651–660.
CIKMCIKM-2009-CaoQCS #feedback
Exploring path query results through relevance feedback (HC, YQ, KSC, MLS), pp. 1959–1962.
CIKMCIKM-2009-CaoSXHYC #classification #named #personalisation
PQC: personalized query classification (BC, JTS, EWX, DHH, QY, ZC), pp. 1217–1226.
CIKMCIKM-2009-CetintasSY #learning
Learning from past queries for resource selection (SC, LS, HY), pp. 1867–1870.
CIKMCIKM-2009-ChengKN #graph #performance #scalability
Efficient processing of group-oriented connection queries in a large graph (JC, YK, WN), pp. 1481–1484.
CIKMCIKM-2009-ChenLY #evaluation #maintenance #network
Progressive skyline query evaluation and maintenance in wireless sensor networks (BC, WL, JXY), pp. 1445–1448.
CIKMCIKM-2009-ChuiLKH #ranking #sequence
Supporting ranking pattern-based aggregate queries in sequence data cubes (CKC, EL, BK, WSH), pp. 997–1006.
CIKMCIKM-2009-Collins-Thompson #optimisation #robust
Reducing the risk of query expansion via robust constrained optimization (KCT), pp. 837–846.
CIKMCIKM-2009-DasdanDKD #automation #interface #retrieval #using
Automatic retrieval of similar content using search engine query interface (AD, PD, SK, CD), pp. 701–710.
CIKMCIKM-2009-DoulkeridisVNKV #distributed #multi #performance
Multidimensional routing indices for efficient distributed query processing (CD, AV, KN, YK, MV), pp. 1489–1492.
CIKMCIKM-2009-DriesNR #network
A query language for analyzing networks (AD, SN, LDR), pp. 485–494.
CIKMCIKM-2009-ElbassuoniRSSW #ranking
Language-model-based ranking for queries on RDF-graphs (SE, MR, RS, MS, GW), pp. 977–986.
CIKMCIKM-2009-GuoR #interactive #mining
Mining linguistic cues for query expansion: applications to drug interaction search (SG, NR), pp. 335–344.
CIKMCIKM-2009-GuYGC #data type #probability
Probabilistic moving range query over RFID spatio-temporal data streams (YG, GY, NG, YC), pp. 1413–1416.
CIKMCIKM-2009-HaghaniMA #data type #semistructured data
Evaluating top-k queries over incomplete data streams (PH, SM, KA), pp. 877–886.
CIKMCIKM-2009-HeZSC #clustering #data type #multi #rank
Cluster based rank query over multidimensional data streams (DH, YZ, LS, GC), pp. 1493–1496.
CIKMCIKM-2009-HongHVAA #effectiveness
Effective anonymization of query logs (YH, XH, JV, NRA, VA), pp. 1465–1468.
CIKMCIKM-2009-HuangE #web
Analyzing and evaluating query reformulation strategies in web search logs (JH, ENE), pp. 77–86.
CIKMCIKM-2009-KatoOOT #relational #using #web
Query by analogical example: relational search using web search engine indices (MPK, HO, SO, KT), pp. 27–36.
CIKMCIKM-2009-KementsietsidisW #evaluation #question #what
Provenance query evaluation: what’s so special about it? (AK, MW), pp. 681–690.
CIKMCIKM-2009-LeeCKC #approach #dependence #ranking
A term dependency-based approach for query terms ranking (CJL, RCC, SHK, PJC), pp. 1267–1276.
CIKMCIKM-2009-LeeM #relational #xml
Bitmap indexes for relational XML twig query processing (KHL, BM), pp. 465–474.
CIKMCIKM-2009-LiM
Supporting context-based query in personal DataSpace (YL, XM), pp. 1437–1440.
CIKMCIKM-2009-LimWW #challenge #database #problem #semantics
Semantic queries in databases: problems and challenges (LL, HW, MW), pp. 1505–1508.
CIKMCIKM-2009-LiuH #evaluation #incremental
Incremental query evaluation for support vector machines (DL, KAH), pp. 1815–1818.
CIKMCIKM-2009-LiuZSNW #clustering #documentation #ranking
Clustering queries for better document ranking (YL, LZ, RS, JYN, JRW), pp. 1569–1572.
CIKMCIKM-2009-LukYL #relational
Group-by skyline query processing in relational engines (MHL, MLY, EL), pp. 1433–1436.
CIKMCIKM-2009-LvZ09a #case study #comparative #feedback #modelling #pseudo
A comparative study of methods for estimating query language models with pseudo feedback (YL, CZ), pp. 1895–1898.
CIKMCIKM-2009-MarinFMGC #web
Location cache for web queries (MM, FF, MM, CGP, VGC), pp. 1995–1998.
CIKMCIKM-2009-MeijWR #modelling #normalisation
A query model based on normalized log-likelihood (EM, WW, MdR), pp. 1903–1906.
CIKMCIKM-2009-NicolaK #generative #sql #xml
Generating SQL/XML query and update statements (MN, TK), pp. 1187–1196.
CIKMCIKM-2009-ParkSNL #multi #named
M-COPE: a multiple continuous query processing engine (HKP, SJS, SHN, WSL), pp. 2065–2066.
CIKMCIKM-2009-RafieiL #using #web
Data extraction from the web using wild card queries (DR, HL), pp. 1939–1942.
CIKMCIKM-2009-ShenLLZ #classification
Product query classification (DS, YL, XL, DZ), pp. 741–750.
CIKMCIKM-2009-TongQJF #graph #interactive #named #performance #proximity
iPoG: fast interactive proximity querying on graphs (HT, HQ, HJ, CF), pp. 1673–1676.
CIKMCIKM-2009-WangHLS #comprehension #learning #semantics #web
Semi-supervised learning of semantic classes for query understanding: from the web and for the web (YYW, RH, XL, JS), pp. 37–46.
CIKMCIKM-2009-WangWLL #named #ranking #summary
HyperSum: hypergraph based semi-supervised sentence ranking for query-oriented summarization (WW, FW, WL, SL), pp. 1855–1858.
CIKMCIKM-2009-WeiPTLD #web
Context sensitive synonym discovery for web search queries (XW, FP, HT, YL, BD), pp. 1585–1588.
CIKMCIKM-2009-WhissellCA #clustering #web
Clustering web queries (JSW, CLAC, AA), pp. 899–908.
CIKMCIKM-2009-WuLACB #algebra #benchmark #generative #named #xpath
XQGen: an algebra-based XPath query generator for micro-benchmarking (YW, NL, RA, SC, SB), pp. 2109–2110.
CIKMCIKM-2009-WuTW #revisited #using #xml
Answering XML queries using materialized views revisited (XW, DT, WHW), pp. 475–484.
CIKMCIKM-2009-XueC #automation #generative
Automatic query generation for patent search (XX, WBC), pp. 2037–2040.
CIKMCIKM-2009-ZhuCWZWC #divide and conquer #learning #ranking
To divide and conquer search ranking by learning query difficulty (ZAZ, WC, TW, CZ, GW, ZC), pp. 1883–1886.
ECIRECIR-2009-Ailon #algorithm #linear #ranking #using
A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables (NA), pp. 685–690.
ECIRECIR-2009-AltingovdeOU #cost analysis #web
A Cost-Aware Strategy for Query Result Caching in Web Search Engines (ISA, RO, ÖU), pp. 628–636.
ECIRECIR-2009-AshkanCAG
Classifying and Characterizing Query Intent (AA, CLAC, EA, QG), pp. 578–586.
ECIRECIR-2009-CarterettePKAA
If I Had a Million Queries (BC, VP, EK, JAA, JA), pp. 288–300.
ECIRECIR-2009-Croft #evolution
Query Evolution (WBC), p. 1.
ECIRECIR-2009-Efron #aspect-oriented #multi #using
Using Multiple Query Aspects to Build Test Collections without Human Relevance Judgments (ME), pp. 276–287.
ECIRECIR-2009-HauffAH #evaluation #performance #predict
The Combination and Evaluation of Query Performance Prediction Methods (CH, LA, DH), pp. 301–312.
ECIRECIR-2009-HeO #effectiveness
Studying Query Expansion Effectiveness (BH, IO), pp. 611–619.
ECIRECIR-2009-LeaseAC #learning #rank
Regression Rank: Learning to Meet the Opportunity of Descriptive Queries (ML, JA, WBC), pp. 90–101.
ECIRECIR-2009-OrlandoS #mining
Mining Query Logs (SO, FS), pp. 814–817.
ECIRECIR-2009-PetkovaCD #keyword #retrieval #xml
Refining Keyword Queries for XML Retrieval by Combining Content and Structure (DP, WBC, YD), pp. 662–669.
ECIRECIR-2009-SarigiannisPB #case study #distributed #web
A Study of the Impact of Index Updates on Distributed Query Processing for Web Search (CS, VP, RABY), pp. 595–602.
ECIRECIR-2009-TsegayPTZ #documentation #generative #performance
Document Compaction for Efficient Query Biased Snippet Generation (YT, SJP, AT, JZ), pp. 509–520.
ECIRECIR-2009-UdupaSBB #information retrieval #mining #quote
“They Are Out There, If You Know Where to Look”: Mining Transliterations of OOV Query Terms for Cross-Language Information Retrieval (RU, KS, AB, AB), pp. 437–448.
ECIRECIR-2009-YinSC #using
Query Expansion Using External Evidence (ZY, MS, NC), pp. 362–374.
KDDKDD-2009-LeeHNW #clustering
Query result clustering for object-level search (JL, SwH, ZN, JRW), pp. 1205–1214.
KDDKDD-2009-WangCP #aspect-oriented #mining
Mining broad latent query aspects from search sessions (XW, DC, KP), pp. 867–876.
KDIRKDIR-2009-Fernandez-FernandezG #mining #taxonomy #topic
Hierarchical Taxonomy Extraction by Mining Topical Query Sessions (MFF, DGA), pp. 229–235.
KDIRKDIR-2009-GoyalBM #using
Entailment of Causal Queries in Narratives using Action Language (PG, LB, TMM), pp. 112–118.
KMISKMIS-2009-SonntagM #image #information management #problem #repository #semantics
Unifying Semantic Annotation and Querying in Biomedical Image Repositories — One Solution for Two Problems of Medical Knowledge Engineering (DS, MM), pp. 89–94.
RecSysRecSys-2009-BaragliaCCFFPS #approach #recommendation
Search shortcuts: a new approach to the recommendation of queries (RB, FC, VC, DF, VF, RP, FS), pp. 77–84.
RecSysRecSys-2009-Schubert #knowledge-based #personalisation #recommendation
Personalized query relaxations and repairs in knowledge-based recommendation (MS), pp. 409–412.
SIGIRSIGIR-2009-Azzopardi #analysis #effectiveness #empirical #evaluation
Query side evaluation: an empirical analysis of effectiveness and effort (LA), pp. 556–563.
SIGIRSIGIR-2009-BanerjeeCR #learning #rank
Learning to rank for quantity consensus queries (SB, SC, GR), pp. 243–250.
SIGIRSIGIR-2009-BenderskyCS #information retrieval #segmentation
Two-stage query segmentation for information retrieval (MB, WBC, DAS), pp. 810–811.
SIGIRSIGIR-2009-CaoHSJSCY #classification
Context-aware query classification (HC, DHH, DS, DJ, JTS, EC, QY), pp. 3–10.
SIGIRSIGIR-2009-CarmanBGC #comparison #statistics
A statistical comparison of tag and query logs (MJC, MB, RG, FC), pp. 123–130.
SIGIRSIGIR-2009-CloughSANP #multi
Multiple approaches to analysing query diversity (PDC, MS, MA, SN, MLP), pp. 734–735.
SIGIRSIGIR-2009-Collins-ThompsonB #performance #predict #using
Estimating query performance using class predictions (KCT, PNB), pp. 672–673.
SIGIRSIGIR-2009-DengKL #graph #modelling #representation
Entropy-biased models for query representation on the click graph (HD, IK, MRL), pp. 339–346.
SIGIRSIGIR-2009-GuoXCL #recognition
Named entity recognition in query (JG, GX, XC, HL), pp. 267–274.
SIGIRSIGIR-2009-HauffA #effectiveness #performance #predict #question
When is query performance prediction effective? (CH, LA), pp. 829–830.
SIGIRSIGIR-2009-KalmanovichK #clustering
Cluster-based query expansion (IGK, OK), pp. 646–647.
SIGIRSIGIR-2009-KellyGB #comparison #interactive
A comparison of query and term suggestion features for interactive searching (DK, KG, EWB), pp. 371–378.
SIGIRSIGIR-2009-KonigGW #predict
Click-through prediction for news queries (ACK, MG, QW), pp. 347–354.
SIGIRSIGIR-2009-KumaranC #predict #quality #using
Reducing long queries using query quality predictors (GK, VRC), pp. 564–571.
SIGIRSIGIR-2009-Lease #markov #random
An improved markov random field model for supporting verbose queries (ML), pp. 476–483.
SIGIRSIGIR-2009-LiWA #random
Extracting structured information from user queries with semi-supervised conditional random fields (XL, YYW, AA), pp. 572–579.
SIGIRSIGIR-2009-MeijMZ #evaluation
An evaluation of entity and frequency based query completion methods (EM, PM, HZ), pp. 678–679.
SIGIRSIGIR-2009-MetzlerJPZ
Improving search relevance for implicitly temporal queries (DM, RJ, FP, RZ), pp. 700–701.
SIGIRSIGIR-2009-PunithaJG #automation #feature model #multi #retrieval #topic #using #video
Topic prerogative feature selection using multiple query examples for automatic video retrieval (PP, JMJ, AG), pp. 804–805.
SIGIRSIGIR-2009-SakaiN #analysis #wiki
Serendipitous search via wikipedia: a query log analysis (TS, KN), pp. 780–781.
SIGIRSIGIR-2009-ScholerG #evaluation #predict
A case for improved evaluation of query difficulty prediction (FS, SG), pp. 640–641.
SIGIRSIGIR-2009-ShokouhiAT #effectiveness
Effective query expansion for federated search (MS, LA, PT), pp. 427–434.
SIGIRSIGIR-2009-WangLFXY #performance
Efficient query expansion for advertisement search (HW, YL, LF, GRX, YY), pp. 51–58.
SIGIRSIGIR-2009-XueC
Transforming patents into prior-art queries (XX, WBC), pp. 808–809.
SIGIRSIGIR-2009-XuJW #feedback #pseudo #wiki
Query dependent pseudo-relevance feedback based on wikipedia (YX, GJFJ, BW), pp. 59–66.
SIGIRSIGIR-2009-YangWGH #learning #ranking #web
Query sampling for ranking learning in web search (LY, LW, BG, XSH), pp. 754–755.
SIGIRSIGIR-2009-ZhangL #question #web #what
What queries are likely to recur in web search? (DZ, JL), pp. 827–828.
SIGIRSIGIR-2009-ZhangYYLC
Temporal query substitution for ad search (WZ, JY, SY, NL, ZC), pp. 798–799.
SIGIRSIGIR-2009-ZhuWVC #evaluation #information retrieval #topic
Topic (query) selection for IR evaluation (JZ, JW, VV, IJC), pp. 802–803.
ICMTICMT-2009-HillairetBL #model transformation
Rewriting Queries by Means of Model Transformations from SPARQL to OQL and Vice-Versa (GH, FB, JYL), pp. 116–131.
PADLPADL-2009-PereiraP #logic programming #modelling #source code #top-down
Layered Models Top-Down Querying of Normal Logic Programs (LMP, AMP), pp. 254–268.
SACSAC-2009-Abbadeni #database #information retrieval #multi #using #visual notation
Information retrieval from visual databases using multiple representations and multiple queries (NA), pp. 1523–1527.
SACSAC-2009-AmoR #named
CPref-SQL: a query language supporting conditional preferences (SdA, MRR), pp. 1573–1577.
SACSAC-2009-BoscPS
Stratified division queries involving ordinal user preferences (PB, OP, OS), pp. 1748–1749.
SACSAC-2009-ChoB #performance #xml
Building an efficient preference XML query processor (SC, WTB), pp. 1585–1586.
SACSAC-2009-GroppeNL #java #named #rdf #satisfiability #semantics #type safety #web
SWOBE — embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the satisfiability of queries and for the determination of query result types (SG, JN, VL), pp. 1239–1246.
SACSAC-2009-MahboubiD #performance #xml
Enhancing XML data warehouse query performance by fragmentation (HM, JD), pp. 1555–1562.
SACSAC-2009-MaLWW #realtime #scheduling
Real-time scheduling for continuous queries with deadlines (LM, XL, YW, HW), pp. 1516–1517.
SACSAC-2009-MattheT #using
Bipolar query satisfaction using satisfaction and dissatisfaction degrees: bipolar satisfaction degrees (TM, GDT), pp. 1699–1703.
SACSAC-2009-NecaskyM #xml
Discovering XML keys and foreign keys in queries (MN, IM), pp. 632–638.
SACSAC-2009-YeeNF #peer-to-peer
Alternatives to conjunctive query processing in peer-to-peer file-sharing systems (WGY, LTN, OF), pp. 1737–1741.
SLESLE-2009-SpiewakZ #database #named #scala
ScalaQL: Language-Integrated Database Queries for Scala (DS, TZ), pp. 154–163.
CASECASE-2009-VeilumuthuR #clustering
Intent based clustering of search engine query log (AV, PR), pp. 647–652.
HPDCHPDC-2009-SchollRK #collaboration #coordination
Collaborative query coordination in community-driven data grids (TS, AR, AK), pp. 197–206.
FASEFASE-2009-ChatterjeeJS #java #named #using
SNIFF: A Search Engine for Java Using Free-Form Queries (SC, SJ, KS), pp. 385–400.
FASEFASE-2009-RajamaniJPR #mobile #network #nondeterminism
Inquiry and Introspection for Non-deterministic Queries in Mobile Networks (VR, CJ, JP, GCR), pp. 401–416.
STOCSTOC-2009-CleveGMSY #algorithm #performance #quantum #simulation
Efficient discrete-time simulations of continuous-time quantum query algorithms (RC, DG, MM, RDS, DLYM), pp. 409–416.
CSLCSL-2009-HorbachW #induction
Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries (MH, CW), pp. 332–347.
ICLPICLP-2009-BroechelerSS #logic programming #probability #source code #using
Using Histograms to Better Answer Queries to Probabilistic Logic Programs (MB, GIS, VSS), pp. 40–54.
ICLPICLP-2009-DungHT #information management #multi
Stabilization of Information Sharing for Queries Answering in Multiagent Systems (PMD, DDH, PMT), pp. 84–98.
DocEngDocEng-2008-SchroederM #approach #design #documentation #performance #xml
Improving query performance on XML documents: a workload-driven design approach (RS, RdSM), pp. 177–186.
TPDLECDL-2008-MastoraMK #behaviour #case study
Exploring Query Formulation and Reformulation: A Preliminary Study to Map Users’ Search Behaviour (AM, MM, SK), pp. 427–430.
JCDLJCDL-2008-MilneNW
A competitive environment for exploratory query expansion (DNM, DMN, IHW), pp. 197–200.
PODSPODS-2008-AfratiK
Answering aggregate queries in data exchange (FNA, PGK), pp. 129–138.
PODSPODS-2008-FosterGT #xml
Annotated XML: queries and provenance (JNF, TJG, VT), pp. 271–280.
PODSPODS-2008-JhaRS #constraints #evaluation
Query evaluation with soft-key constraints (AKJ, VR, DS), pp. 119–128.
PODSPODS-2008-Koch #approximate #database #probability
Approximating predicates and expressive queries on probabilistic databases (CK), pp. 99–108.
PODSPODS-2008-MoorSAV #datalog #optimisation #type inference
Type inference for datalog and its application to query optimisation (OdM, DS, PA, MV), pp. 291–300.
SIGMODSIGMOD-2008-BrunoN #design #optimisation #parametricity #physics
Configuration-parametric query optimization for physical design tuning (NB, RVN), pp. 941–952.
SIGMODSIGMOD-2008-CaoDCT #multi #optimisation
Optimizing complex queries with multiple relation instances (YC, GCD, CYC, KLT), pp. 525–538.
SIGMODSIGMOD-2008-ChenC #constraints
Minimization of tree pattern queries with constraints (DC, CYC), pp. 609–622.
SIGMODSIGMOD-2008-GhelliORS #optimisation #xml
XML query optimization in the presence of side effects (GG, NO, KHR, JS), pp. 339–352.
SIGMODSIGMOD-2008-GhinitaKKST
Private queries in location based services: anonymizers are not necessary (GG, PK, AK, CS, KLT), pp. 121–132.
SIGMODSIGMOD-2008-HeS #data access #database #graph #named
Graphs-at-a-time: query language and access methods for graph databases (HH, AKS), pp. 405–418.
SIGMODSIGMOD-2008-HuangLC #generative #xml
Query biased snippet generation in XML search (YH, ZL, YC), pp. 315–326.
SIGMODSIGMOD-2008-HuaPZL #approach #nondeterminism #probability #ranking
Ranking queries on uncertain data: a probabilistic threshold approach (MH, JP, WZ, XL), pp. 673–686.
SIGMODSIGMOD-2008-JinXRW #graph #reachability #scalability
Efficiently answering reachability queries on very large directed graphs (RJ, YX, NR, HW), pp. 595–608.
SIGMODSIGMOD-2008-KimelfeldKS #modelling #performance #probability #xml
Query efficiency in probabilistic XML models (BK, YK, YS), pp. 701–714.
SIGMODSIGMOD-2008-LeeC #performance #using
Efficient storage scheme and query processing for supply chain management using RFID (CHL, CWC), pp. 291–302.
SIGMODSIGMOD-2008-MishraK
Stretch’n’shrink: resizing queries to user preferences (CM, NK), pp. 1227–1230.
SIGMODSIGMOD-2008-MishraKZ #database #generative #testing
Generating targeted queries for database testing (CM, NK, CZ), pp. 499–510.
SIGMODSIGMOD-2008-PeiHTL #nondeterminism #probability #summary #tutorial
Query answering techniques on uncertain and probabilistic data: tutorial summary (JP, MH, YT, XL), pp. 1357–1364.
SIGMODSIGMOD-2008-ReLBS #correlation #probability
Event queries on correlated probabilistic streams (CR, JL, MB, DS), pp. 715–728.
SIGMODSIGMOD-2008-SaitoM #xml
Relational-style XML query (TLS, SM), pp. 303–314.
SIGMODSIGMOD-2008-ScheideggerVKFS #workflow
Querying and re-using workflows with VsTrails (CES, HTV, DK, JF, CTS), pp. 1251–1254.
SIGMODSIGMOD-2008-TatemuraCLPCA #named #nondeterminism #web #web service
UQBE: uncertain query by example for web service mashup (JT, SC, FL, OP, KSC, DA), pp. 1275–1280.
SIGMODSIGMOD-2008-ThiagarajanM #database
Querying continuous functions in a database system (AT, SM), pp. 791–804.
SIGMODSIGMOD-2008-VlachouDNV #distributed #on the #performance
On efficient top-k query processing in highly distributed environments (AV, CD, KN, MV), pp. 753–764.
SIGMODSIGMOD-2008-WuLOT #retrieval
Just-in-time query retrieval over partially indexed data on structured P2P overlays (SW, JL, BCO, KLT), pp. 279–290.
SIGMODSIGMOD-2008-WuXH #named #ranking
ARCube: supporting ranking aggregate queries in partially materialized data cubes (TW, DX, JH), pp. 79–92.
SIGMODSIGMOD-2008-YangWL #approximate #cost analysis #string
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently (XY, BW, CL), pp. 353–364.
VLDBVLDB-2008-AntonellisGC #analysis #graph
Simrank++: query rewriting through link analysis of the click graph (IA, HGM, CCC), pp. 408–421.
VLDBVLDB-2008-Bar-YossefG #mining
Mining search engine query logs via suggestion sampling (ZBY, MG), pp. 54–65.
VLDBVLDB-2008-BragaCDM #multi #optimisation #web
Optimization of multi-domain queries on the web (DB, SC, FD, DM), pp. 562–573.
VLDBVLDB-2008-ChaudhuriNR #execution #feedback #framework
A pay-as-you-go framework for query execution feedback (SC, VRN, RR), pp. 1141–1152.
VLDBVLDB-2008-DeutchM #execution #type checking #type inference
Type inference and type checking for queries on execution traces (DD, TM), pp. 352–363.
VLDBVLDB-2008-DeutchM08a #modelling #nondeterminism
Querying web-based applications under models of uncertainty (DD, TM), pp. 1659–1665.
VLDBVLDB-2008-DeyBDH #approximate #diagrams
Efficiently approximating query optimizer plan diagrams (AD, SB, HD, JRH), pp. 1325–1336.
VLDBVLDB-2008-DingTSWK #comparison #distance #metric #mining
Querying and mining of time series data: experimental comparison of representations and distance measures (HD, GT, PS, XW, EJK), pp. 1542–1552.
VLDBVLDB-2008-GarrodMAMMOT #scalability #web
Scalable query result caching for web applications (CG, AM, AA, BMM, TCM, CO, AT), pp. 550–561.
VLDBVLDB-2008-GeZ #approach
A skip-list approach for efficiently processing forecasting queries (TG, SBZ), pp. 984–995.
VLDBVLDB-2008-GuoLFX #database #multi #named
C-DEM: a multi-modal query system for Drosophila Embryo databases (FG, LL, CF, EPX), pp. 1508–1511.
VLDBVLDB-2008-HadjieleftheriouYKS #set #similarity
Hashed samples: selectivity estimators for set similarity selection queries (MH, XY, NK, DS), pp. 201–212.
VLDBVLDB-2008-HanKLLM #optimisation
Parallelizing query optimization (WSH, WK, JL, GML, VM), pp. 188–200.
VLDBVLDB-2008-HuangCDN #on the
On the provenance of non-answers to queries over extracted data (JH, TC, AD, JFN), pp. 736–747.
VLDBVLDB-2008-HuRCLZ #database #named #visualisation
QueryScope: visualizing queries for repeatable database tuning (LH, KAR, YCC, CAL, DZ), pp. 1488–1491.
VLDBVLDB-2008-JayapandianJ #automation #database #interface
Automated creation of a forms-based database query interface (MJ, HVJ), pp. 695–709.
VLDBVLDB-2008-JinYCYL #nondeterminism
Sliding-window top-k queries on uncertain streams (CJ, KY, LC, JXY, XL), pp. 301–312.
VLDBVLDB-2008-KementsietsidisNCV #database #multi #optimisation #scalability
Scalable multi-query optimization for exploratory queries over federated scientific databases (AK, FN, DVdC, SV), pp. 16–27.
VLDBVLDB-2008-LeeZ
Closing the query processing loop in Oracle 11g (AWL, MZ), pp. 1368–1378.
VLDBVLDB-2008-MiloD #distributed #monitoring #process
Querying and monitoring distributed business processes (TM, DD), pp. 1512–1515.
VLDBVLDB-2008-MoonCDHZ #database #evolution #transaction
Managing and querying transaction-time databases under schema evolution (HJM, CC, AD, CYH, CZ), pp. 882–895.
VLDBVLDB-2008-NutanongZTK #approach
The V*-Diagram: a query-dependent approach to moving KNN queries (SN, RZ, ET, LK), pp. 1095–1106.
VLDBVLDB-2008-PangM #authentication
Authenticating the query results of text search engines (HP, KM), pp. 126–137.
VLDBVLDB-2008-PuY #keyword
Keyword query cleaning (KQP, XY), pp. 909–920.
VLDBVLDB-2008-ShahabiTX #performance
Indexing land surface for efficient kNN query (CS, LAT, SX), pp. 1020–1031.
VLDBVLDB-2008-SharafLC #data type #scheduling
Scheduling continuous queries in data stream management systems (MAS, AL, PKC), pp. 1526–1527.
VLDBVLDB-2008-SlezakWES #ad hoc #named
Brighthouse: an analytic data warehouse for ad-hoc queries (DS, JW, VE, PS), pp. 1337–1345.
VLDBVLDB-2008-TalukdarJMCIPG #learning
Learning to create data-integrating queries (PPT, MJ, MSM, KC, ZGI, FCNP, SG), pp. 785–796.
VLDBVLDB-2008-TerwilligerMB #sql #xml
Language-integrated querying of XML data in SQL server (JFT, SM, PAB), pp. 1396–1399.
VLDBVLDB-2008-TianPNMK #graph #named #tool support
Periscope/GQ: a graph querying toolkit (YT, JMP, VN, SM, MK), pp. 1404–1407.
VLDBVLDB-2008-WangLLG #documentation #xml
Hash-base subgraph query processing method for graph-structured XML documents (HW, JL, JL, HG), pp. 478–489.
VLDBVLDB-2008-WongFPHWL #performance
Efficient skyline querying with variable user preferences on nominal attributes (RCWW, AWCF, JP, YSH, TW, YL), pp. 1032–1043.
VLDBVLDB-2008-WuYCT #named #nearest neighbour
FINCH: evaluating reverse k-Nearest-Neighbor queries on location data (WW, FY, CYC, KLT), pp. 1056–1067.
VLDBVLDB-2008-XiaoT
Output perturbation with query relaxation (XX, YT), pp. 857–869.
VLDBVLDB-2008-YehWYC #distributed #named
LeeWave: level-wise distribution of wavelet coefficients for processing kNN queries over distributed streams (MYY, KLW, PSY, MSC), pp. 586–597.
ITiCSEITiCSE-2008-Hollingsworth #approach #education
Teaching query writing: an informed instruction approach (JEH), p. 351.
ICPCICPC-2008-VerbaereGG #comprehension
Query Technologies and Applications for Program Comprehension (QTAPC 2008) (MV, MWG, TG), pp. 285–288.
WCREWCRE-2008-GhanbariCA #analysis #aspectj #hybrid #java #source code
A Hybrid Query Engine for the Structural Analysis of Java and AspectJ Programs (HG, CC, VA), pp. 133–137.
ICFPICFP-2008-MorihataMT #framework #recursion
Write it recursively: a generic framework for optimal path queries (AM, KM, MT), pp. 169–178.
GT-VMTGT-VMT-2006-Varro08 #database #graph transformation #implementation #independence #plugin #using
Implementing an EJB3-Specific Graph Transformation Plugin by Using Database Independent Queries (GV), pp. 121–132.
GT-VMTGT-VMT-2008-Weinell #graph #reduction
Extending Graph Query Languages by Reduction (EW).
ICGTICGT-2008-YuH #graph transformation #semantics #web
Graph Transformation for the Semantic Web: Queries and Inference Rules (HY, YH), pp. 511–513.
CHICHI-2008-HeerAW #interactive
Generalized selection via interactive query relaxation (JH, MA, WW), pp. 959–968.
CHICHI-2008-KamvarB #comprehension #mobile
Query suggestions for mobile search: understanding usage patterns (MK, SB), pp. 1013–1016.
CHICHI-2008-LuoLLT #image #multi #named
MQSearch: image search by multi-class query (YL, WL, JL, XT), pp. 49–52.
EDOCEDOC-2008-AwadPW #modelling #process #semantics
Semantic Querying of Business Process Models (AA, AP, MW), pp. 85–94.
ICEISICEIS-AIDSS-2008-KompaoreMT #information retrieval
Combining Indexing Methods and Query Sizes in Information Retrieval in French (DK, JM, LT), pp. 149–154.
ICEISICEIS-DISI-2008-Chen #evaluation #xml
Tree Embedding and XML Query Evaluation (YC), pp. 173–178.
ICEISICEIS-DISI-2008-DroopFGGLPSSSSZ #xpath
Embedding Xpath Queries into SPARQL Queries (MD, MF, JG, SG, VL, JP, FS, MS, FS, HS, SZ), pp. 5–14.
ICEISICEIS-DISI-2008-GroppeL #satisfiability #xpath
Discovering Veiled Unsatisfiable Xpath Queries (JG, VL), pp. 149–158.
ICEISICEIS-DISI-2008-Savnik #algebra #data flow #implementation #web
Implementation of Algebra for Querying Web Data Sources (IS), pp. 91–96.
CIKMCIKM-2008-AhmadABM #database #interactive #modelling
Modeling and exploiting query interactions in database systems (MA, AA, SB, KM), pp. 183–192.
CIKMCIKM-2008-ChenCKSS #integration #optimisation #xml
Query optimization in xml-based information integration (DC, RC, MK, FS, TJS), pp. 1405–1406.
CIKMCIKM-2008-ChuangC #web
Integrating web query results: holistic schema matching (SLC, KCCC), pp. 33–42.
CIKMCIKM-2008-ChungLC #performance #probability
Efficient processing of probabilistic spatio-temporal range queries over moving objects (BSEC, WCL, ALPC), pp. 1399–1400.
CIKMCIKM-2008-CustisA #corpus #statistics
Investigating external corpus and clickthrough statistics for query expansion in the legal domain (TC, KAK), pp. 1363–1364.
CIKMCIKM-2008-DakkaGI
Answering general time sensitive queries (WD, LG, PGI), pp. 1437–1438.
CIKMCIKM-2008-DowneyDLH #comprehension
Understanding the relationship between searchers’ queries and information goals (DD, STD, DJL, EH), pp. 449–458.
CIKMCIKM-2008-ErcegovacJLMS
Supporting sub-document updates and queries in an inverted index (VE, VJ, NL, MRM, EJS), pp. 659–668.
CIKMCIKM-2008-GueniACW #xquery
Pruning nested XQuery queries (BG, TA, BC, EW), pp. 541–550.
CIKMCIKM-2008-HauffHJ #overview #performance #predict
A survey of pre-retrieval query performance predictors (CH, DH, FdJ), pp. 1419–1420.
CIKMCIKM-2008-HauffMB #predict #web
Improved query difficulty prediction for the web (CH, VM, RABY), pp. 439–448.
CIKMCIKM-2008-HauglidN #database #distributed #named
PROQID: partial restarts of queries in distributed databases (JOH, KN), pp. 1251–1260.
CIKMCIKM-2008-HuangS #markov #using
A latent variable model for query expansion using the hidden markov model (QH, DS), pp. 1417–1418.
CIKMCIKM-2008-JonesK #automation #segmentation #topic
Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs (RJ, KLK), pp. 699–708.
CIKMCIKM-2008-KarnstedtSHHSS #database
Estimating the number of answers with guarantees for structured queries in p2p databases (MK, KUS, MH, MH, BS, RS), pp. 1407–1408.
CIKMCIKM-2008-LeeLZ #framework #named #network #performance
ROAD: an efficient framework for location dependent spatial queries on road networks (KCKL, WCL, BZ), pp. 1327–1328.
CIKMCIKM-2008-LeeSZL #mobile
Valid scope computation for location-dependent spatial query in mobile broadcast environments (KCKL, JS, BZ, WCL), pp. 1231–1240.
CIKMCIKM-2008-LiangCY #energy #maintenance #network
Energy-efficient skyline query processing and maintenance in sensor networks (WL, BC, JXY), pp. 1471–1472.
CIKMCIKM-2008-MaYKL #learning #semantics
Learning latent semantic relations from clickthrough data for query suggestion (HM, HY, IK, MRL), pp. 709–718.
CIKMCIKM-2008-MeiZC #using
Query suggestion using hitting time (QM, DZ, KWC), pp. 469–478.
CIKMCIKM-2008-NguyenS08a #correlation #order #rank
Polyhedral transformation for indexed rank order correlation queries (PN, NS), pp. 1477–1478.
CIKMCIKM-2008-OzcanAU
Utilization of navigational queries for result presentation and caching in search engines (RO, ISA, ÖU), pp. 1499–1500.
CIKMCIKM-2008-ParikhS #behaviour #semantics
Inferring semantic query relations from collective user behavior (NP, NS), pp. 349–358.
CIKMCIKM-2008-PlacekTSDS #approach #heuristic
A heuristic approach for checking containment of generalized tree-pattern queries (PP, DT, SS, TD, TKS), pp. 551–560.
CIKMCIKM-2008-RazenteBTFT #approach #data access #metric #novel #optimisation #process #similarity
A novel optimization approach to efficiently process aggregate similarity queries in metric access methods (HLR, MCNB, AJMT, CF, CTJ), pp. 193–202.
CIKMCIKM-2008-VaidyaL #database
Characterization of TPC-H queries for a column-oriented database on a dual-core amd athlon processor (PV, JJL), pp. 1411–1412.
CIKMCIKM-2008-WangYPY #assurance #encryption
Dual encryption for query integrity assurance (HW, JY, CSP, PSY), pp. 863–872.
CIKMCIKM-2008-WangZ #effectiveness #mining
Mining term association patterns from search logs for effective query reformulation (XW, CZ), pp. 479–488.
CIKMCIKM-2008-WuT #xml
Evaluating partial tree-pattern queries on XML streams (XW, DT), pp. 1409–1410.
CIKMCIKM-2008-XuA #feedback
Active relevance feedback for difficult queries (ZX, RA), pp. 459–468.
CIKMCIKM-2008-XuDW #using #wiki
Entity-based query reformulation using wikipedia (YX, FD, BW), pp. 1441–1442.
CIKMCIKM-2008-YangCJWZM #search-based
Search-based query suggestion (JMY, RC, FJ, SW, LZ, WYM), pp. 1439–1440.
CIKMCIKM-2008-ZhuSYW #process #question
Can phrase indexing help to process non-phrase queries? (MZ, SS, NY, JRW), pp. 679–688.
ECIRECIR-2008-AltingovdeCU #performance #strict #web
Efficient Processing of Category-Restricted Queries for Web Directories (ISA, FC, ÖU), pp. 695–699.
ECIRECIR-2008-HeLR #metric #predict #using
Using Coherence-Based Measures to Predict Query Difficulty (JH, ML, MdR), pp. 689–694.
ECIRECIR-2008-HuangSR #documentation #feedback #pseudo #robust
Robust Query-Specific Pseudo Feedback Document Selection for Query Expansion (QH, DS, SMR), pp. 547–554.
ECIRECIR-2008-SongHRB #composition #mining #modelling #multi #using
Facilitating Query Decomposition in Query Language Modeling by Association Rule Mining Using Multiple Sliding Windows (DS, QH, SMR, PB), pp. 334–345.
ECIRECIR-2008-WeiLLH #clustering #graph #multi #summary
A Cluster-Sensitive Graph Model for Query-Oriented Multi-document Summarization (FW, WL, QL, YH), pp. 446–453.
ECIRECIR-2008-ZhaoST #effectiveness #performance #predict #similarity #using #variability
Effective Pre-retrieval Query Performance Prediction Using Similarity and Variability Evidence (YZ, FS, YT), pp. 52–64.
ICMLICML-2008-PuolamakiAK #learning
Learning to learn implicit queries from gaze patterns (KP, AA, SK), pp. 760–767.
ICPRICPR-2008-PadmanabhanN
Query by table (RKP, GN), pp. 1–4.
KDDKDD-2008-BonchiCDG #composition #topic
Topical query decomposition (FB, CC, DD, AG), pp. 52–60.
KDDKDD-2008-CaoJPHLCL #mining
Context-aware query suggestion by mining click-through and session data (HC, DJ, JP, QH, ZL, EC, HL), pp. 875–883.
KDDKDD-2008-KoenigsteinST #analysis #string #using
Spotting out emerging artists using geo-aware analysis of P2P query strings (NK, YS, TT), pp. 937–945.
KDDKDD-2008-LingD #learning
Active learning with direct query construction (CXL, JD), pp. 480–487.
KDDKDD-2008-ParikhS #detection #realtime #scalability
Scalable and near real-time burst detection from eCommerce queries (NP, NS), pp. 972–980.
KDDKDD-2008-SarmaGI #using
Bypass rates: reducing query abandonment using negative inferences (ADS, SG, SI), pp. 177–185.
KDDKDD-2008-SiaCCT #performance
Efficient computation of personal aggregate queries on blogs (KCS, JC, YC, BLT), pp. 632–640.
KRKR-2008-BinasM #consistency #peer-to-peer
Peer-to-Peer Query Answering with Inconsistent Knowledge (AB, SAM), pp. 329–339.
KRKR-2008-CaliGK #constraints #infinity #relational
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (AC, GG, MK), pp. 70–80.
KRKR-2008-CalvaneseGLR #logic #ontology
View-Based Query Answering over Description Logic Ontologies (DC, GDG, ML, RR), pp. 242–251.
KRKR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #performance
Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
KRKR-2008-GlimmHS
Unions of Conjunctive Queries in SHOQ (BG, IH, US), pp. 252–262.
RecSysRecSys-2008-LiWZZC #named #parallel #recommendation
Pfp: parallel fp-growth for query recommendation (HL, YW, DZ, MZ, EYC), pp. 107–114.
SEKESEKE-2008-SaccolEG #metadata #peer-to-peer #xml
A Metadata Model for Managing and Querying XML Resources in Peer-to-peer Systems (DdBS, NE, RdMG), pp. 525–530.
SIGIRSIGIR-2008-AltingovdeDCU
Site-based dynamic pruning for query processing in search engines (ISA, ED, FC, ÖU), pp. 861–862.
SIGIRSIGIR-2008-ArampatzisK #case study
A study of query length (AA, JK), pp. 811–812.
SIGIRSIGIR-2008-BalogWR #modelling
A few examples go a long way: constructing query models from elaborate query formulations (KB, WW, MdR), pp. 371–378.
SIGIRSIGIR-2008-BenderskyC #concept
Discovering key concepts in verbose queries (MB, WBC), pp. 491–498.
SIGIRSIGIR-2008-BilenkoWRM
Talking the talk vs. walking the walk: salience of information needs in querying vs. browsing (MB, RWW, MR, GCM), pp. 705–706.
SIGIRSIGIR-2008-BuscherDE #feedback #using
Query expansion using gaze-based feedback on the subdocument level (GB, AD, LvE), pp. 387–394.
SIGIRSIGIR-2008-CarterettePKAA #evaluation
Evaluation over thousands of queries (BC, VP, EK, JAA, JA), pp. 651–658.
SIGIRSIGIR-2008-DamianiMP #flexibility #xml #xpath
A flexible extension of XPath to improve XML querying (ED, SM, GP), pp. 849–850.
SIGIRSIGIR-2008-Gan #approach #using
Using a mediated query approach for matching unstructured query with structured resources (KHG), p. 895.
SIGIRSIGIR-2008-GengLQALS #nearest neighbour #ranking #using
Query dependent ranking using K-nearest neighbor (XG, TYL, TQ, AA, HL, HYS), pp. 115–122.
SIGIRSIGIR-2008-GuoA
Exploring mouse movements for inferring query intent (QG, EA), pp. 707–708.
SIGIRSIGIR-2008-GuoXLC #refinement
A unified and discriminative model for query refinement (JG, GX, HL, XC), pp. 379–386.
SIGIRSIGIR-2008-HoonKTK #named
Minexml: bridging unstructured query with structured resources via mediated query (GKH, PKK, SST, TEK), p. 879.
SIGIRSIGIR-2008-HuCBLCY #mining #web
Web query translation via web log mining (RH, WC, PB, YL, ZC, QY), pp. 749–750.
SIGIRSIGIR-2008-KumaranA #effectiveness #interactive #performance
Effective and efficient user interaction for long queries (GK, JA), pp. 11–18.
SIGIRSIGIR-2008-LiuLLJ #clustering #geometry #ranking
Spectral geometry for simultaneously clustering and ranking query search results (YL, WL, YL, LJ), pp. 539–546.
SIGIRSIGIR-2008-LiWA #graph #learning
Learning query intent from regularized click graphs (XL, YYW, AA), pp. 339–346.
SIGIRSIGIR-2008-Nguyen #approach #preprocessor #web #word
Query preprocessing: improving web search through a Vietnamese word tokenization approach (DN), pp. 765–766.
SIGIRSIGIR-2008-RadlinskiBCGJR #approach #optimisation
Optimizing relevance and revenue in ad search: a query substitution approach (FR, AZB, PC, EG, VJ, LR), pp. 403–410.
SIGIRSIGIR-2008-Sanderson #ambiguity
Ambiguous queries: test collections need more sense (MS), pp. 499–506.
SIGIRSIGIR-2008-SchenkelCKMNPW #network #performance
Efficient top-k querying over social-tagging networks (RS, TC, MK, SM, TN, JXP, GW), pp. 523–530.
SIGIRSIGIR-2008-SunHL #case study
Searching blogs and news: a study on popular queries (AS, MH, EPL), pp. 729–730.
SIGIRSIGIR-2008-TeevanDL #modelling #personalisation
To personalize or not to personalize: modeling queries with variation in user intent (JT, STD, DJL), pp. 163–170.
SIGIRSIGIR-2008-ValletZ #approach #semantics
Inferring the most important types of a query: a semantic approach (DV, HZ), pp. 857–858.
SIGIRSIGIR-2008-WeiLLH #multi #summary
Query-sensitive mutual reinforcement chain and its application in query-oriented multi-document summarization (FW, WL, QL, YH), pp. 283–290.
SIGIRSIGIR-2008-WeiPD #web
Analyzing web text association to disambiguate abbreviation in queries (XW, FP, BD), pp. 751–752.
SIGIRSIGIR-2008-WelchC #automation #identification
Automatically identifying localizable queries (MJW, JC), pp. 507–514.
SIGIRSIGIR-2008-ZighelnicK #robust
Query-drift prevention for robust query expansion (LZ, OK), pp. 825–826.
OOPSLAOOPSLA-2008-WiedermannIC #interprocedural #persistent
Interprocedural query extraction for transparent persistence (BW, AI, WRC), pp. 19–36.
OOPSLAOOPSLA-2008-WillisPN #java
Caching and incrementalisation in the java query language (DW, DJP, JN), pp. 1–18.
PPDPPPDP-2008-BenzakenCCM #programming #visual notation #xml
Pattern by example: type-driven visual programming of XML queries (VB, GC, DC, CM), pp. 131–142.
SASSAS-2008-LalR #data flow #multi #using
Solving Multiple Dataflow Queries Using WPDSs (AL, TWR), pp. 93–109.
ICSEICSE-2008-AlwisM #concept
Answering conceptual queries with Ferret (BdA, GCM), pp. 21–30.
SACSAC-2008-BordognaPPP #nondeterminism
Evaluating uncertain location-based spatial queries (GB, MP, GP, GP), pp. 1095–1100.
SACSAC-2008-BugattiTT #integration #similarity
Assessing the best integration between distance-function and image-feature to answer similarity queries (PHB, AJMT, CTJ), pp. 1225–1230.
SACSAC-2008-CrassoZC #web #web service
Query by example for web services (MC, AZ, MC), pp. 2376–2380.
SACSAC-2008-DaltioMGL #framework #process
A framework to process complex biodiversity queries (JD, CBM, LGJ, TML), pp. 2293–2297.
SACSAC-2008-DoringPE #e-commerce
Advanced preference query processing for e-commerce (SD, TP, ME), pp. 1457–1462.
SACSAC-2008-GennaroMOR #network #peer-to-peer #similarity
Processing complex similarity queries in peer-to-peer networks (CG, MM, SO, FR), pp. 473–478.
SACSAC-2008-IsikmanYOOGA #adaptation #fuzzy #multi #web
Adaptive weighted multi-criteria fuzzy query processing for web based real estate applications (ÖÖI, BGY, , , HG, RA), pp. 987–991.
SACSAC-2008-RazenteBTT #feedback #image #retrieval #similarity
Aggregate similarity queries in relevance feedback methods for content-based image retrieval (HLR, MCNB, AJMT, CTJ), pp. 869–874.
SACSAC-2008-ZhouTBAG #ambiguity #graph #named
Gcon: a graph-based technique for resolving ambiguity in query translation candidates (DZ, MT, TJB, HA, JG), pp. 1566–1573.
GPCEGPCE-2008-RothamelL #generative #implementation #incremental
Generating incremental implementations of object-set queries (TR, YAL), pp. 55–66.
HPDCHPDC-2008-GuptaBG #framework #grid #ontology
Ontological framework for a free-form query based grid search engine (CG, RB, MG), pp. 205–208.
PDPPDP-2008-Gomez-PantojaM #distributed #ranking
Load Balancing Distributed Inverted Files: Query Ranking (CGP, MM), pp. 329–333.
ESOPESOP-2008-Cheney #regular expression #type system #xml
Regular Expression Subtyping for XML Query and Update Languages (JC), pp. 32–47.
STOCSTOC-2008-ChoiK #bound #complexity #graph
Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.
IJCARIJCAR-2008-Lutz #complexity #logic
The Complexity of Conjunctive Query Answering in Expressive Description Logics (CL), pp. 179–193.
DocEngDocEng-2007-TriebseesB #automation #documentation #embedded #migration #semantics #towards
Towards automatic document migration: semantic preservation of embedded queries (TT, UMB), pp. 209–218.
TPDLECDL-2007-Nguer #library #semantics
Semantics and Pragmatics of Preference Queries in Digital Libraries (EMN), pp. 573–578.
ICDARICDAR-2007-BanerjeeHC #concept #database #documentation #image #semantics #word
Word image based latent semantic indexing for conceptual querying in document image databases (SB, GH, SC), pp. 1208–1212.
ICDARICDAR-2007-JoutelEBE
Curvelets Based Queries for CBIR Application in Handwriting Collections (GJ, VE, SB, HE), pp. 649–653.
PODSPODS-2007-BadiaV
Non-linear prefixes in query languages (AB, SV), pp. 185–194.
PODSPODS-2007-BusscheGV #database
A crash course on database queries (JVdB, DVG, SV), pp. 143–154.
PODSPODS-2007-CateL #complexity #xpath
The complexity of query containment in expressive fragments of XPath 2.0 (BtC, CL), pp. 73–82.
PODSPODS-2007-CohenDKLT #data type #sketching
Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.
PODSPODS-2007-DalviS07a #probability
The dichotomy of conjunctive queries on probabilistic structures (NND, DS), pp. 293–302.
PODSPODS-2007-Machlin #array #equivalence #multi #safety
Index-based multidimensional array queries: safety and equivalence (RM), pp. 175–184.
PODSPODS-2007-Marx
Queries determined by views: pack your views (MM), pp. 23–30.
PODSPODS-2007-MunagalaSW #optimisation
Optimization of continuous queries with shared expensive filters (KM, US, JW), pp. 215–224.
PODSPODS-2007-Schweikardt #bound #modelling
Machine models and lower bounds for query processing (NS), pp. 41–52.
SIGMODSIGMOD-2007-AnciauxBBPS #named
GhostDB: querying visible and hidden data without leaks (NA, MB, LB, PP, DS), pp. 677–688.
SIGMODSIGMOD-2007-BravoR #optimisation #probability
Optimizing mpf queries: decision support and probabilistic inference (HCB, RR), pp. 701–712.
SIGMODSIGMOD-2007-ChandramouliBBY
Query suspend and resume (BC, CNB, SB, JY), pp. 557–568.
SIGMODSIGMOD-2007-ChengKNL #database #graph #named #towards
Fg-index: towards verification-free query processing on graph databases (JC, YK, WN, AL), pp. 857–872.
SIGMODSIGMOD-2007-CongFK #distributed #evaluation #performance
Distributed query evaluation with performance guarantees (GC, WF, AK), pp. 509–520.
SIGMODSIGMOD-2007-CormodeG07a #data type #distributed #streaming
Streaming in a connected world: querying and tracking distributed data streams (GC, MNG), pp. 1178–1181.
SIGMODSIGMOD-2007-FanCB #syntax #xml
Querying xml with update syntax (WF, GC, PB), pp. 293–304.
SIGMODSIGMOD-2007-FangHLYGLS #named #using
GPUQP: query co-processing using graphics processors (RF, BH, ML, KY, NKG, QL, PVS), pp. 1061–1063.
SIGMODSIGMOD-2007-HeLLY #in memory #named
EaseDB: a cache-oblivious in-memory query processor (BH, YL, QL, DY), pp. 1064–1066.
SIGMODSIGMOD-2007-HuangN #data flow #named
K-relevance: a spectrum of relevance for data sources impacting a query (JH, JFN), pp. 163–174.
SIGMODSIGMOD-2007-HuebschGHS #distributed
Sharing aggregate computation for distributed queries (RH, MNG, JMH, IS), pp. 485–496.
SIGMODSIGMOD-2007-JermaineAPD #approximate #scalability
Scalable approximate query processing with the DBO engine (CMJ, SA, AP, AD), pp. 725–736.
SIGMODSIGMOD-2007-LiCYSJ #adaptation #interface #named #natural language #xml
DaNaLIX: a domain-adaptive natural language interface for querying XML (YL, IC, HY, SPS, HVJ), pp. 1165–1168.
SIGMODSIGMOD-2007-LuoLWZ #database #keyword #named #relational
Spark: top-k keyword query in relational databases (YL, XL, WW, XZ), pp. 115–126.
SIGMODSIGMOD-2007-MishraV #monitoring #named
ConEx: a system for monitoring queries (CM, MV), pp. 1076–1078.
SIGMODSIGMOD-2007-NandiJ #interface #using
Assisted querying using instant-response interfaces (AN, HVJ), pp. 1156–1158.
SIGMODSIGMOD-2007-PetropoulosDP #architecture #interactive #named
CLIDE: interactive query formulation for service oriented architectures (MP, AD, YP), pp. 1119–1121.
SIGMODSIGMOD-2007-QiCS #consistency #data flow #named #nondeterminism
FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources (YQ, KSC, MLS), pp. 151–162.
SIGMODSIGMOD-2007-QiCSK #taxonomy
Integrating and querying taxonomies with quest in the presence of conflicts (YQ, KSC, MLS, KWK), pp. 1153–1155.
SIGMODSIGMOD-2007-SolimanIC #database #evaluation #named #nondeterminism #performance
URank: formulation and efficient evaluation of top-k queries in uncertain databases (MAS, IFI, KCCC), pp. 1082–1084.
SIGMODSIGMOD-2007-TatemuraSPCCAG #web #web service
Mashup Feeds: : continuous queries over web services (JT, AS, OP, SC, KSC, DA, MG), pp. 1128–1130.
SIGMODSIGMOD-2007-TrisslL #graph #performance #scalability
Fast and practical indexing and querying of very large graphs (ST, UL), pp. 845–856.
SIGMODSIGMOD-2007-WyssW #integration #multi #optimisation #relational
Extending relational query optimization to dynamic schemas for information integration in multidatabases (CMW, FIW), pp. 473–484.
SIGMODSIGMOD-2007-YangLOT #execution #monitoring #network
In-network execution of monitoring queries in sensor networks (XY, HBL, MTÖ, KLT), pp. 521–532.
SIGMODSIGMOD-2007-ZhouGBN #using
Query relaxation using malleable schemas (XZ, JG, WTB, WN), pp. 545–556.
SIGMODSIGMOD-2007-ZhouLFL #performance
Efficient exploitation of similar subexpressions for query processing (JZ, PÅL, JCF, WL), pp. 533–544.
VLDBVLDB-2007-AkbariniaPV #algorithm
Best Position Algorithms for Top-k Queries (RA, EP, PV), pp. 495–506.
VLDBVLDB-2007-AntovaKO
Query language support for incomplete information in the MayBMS system (LA, CK, DO), pp. 1422–1425.
VLDBVLDB-2007-ArionBMP #xml
Structured Materialized Views for XML Queries (AA, VB, IM, YP), pp. 87–98.
VLDBVLDB-2007-BeeriPME #monitoring #process
Monitoring Business Processes with Queries (CB, AE, TM, AP), pp. 603–614.
VLDBVLDB-2007-BhattacharyaMS #distributed #modelling #named #network #statistics #using
MIST: Distributed Indexing and Querying in Sensor Networks using Statistical Models (AB, AM, AKS), pp. 854–865.
VLDBVLDB-2007-BitonBD #workflow
Zoom*UserViews: Querying Relevant Provenance in Workflow Systems (OB, SCB, SBD), pp. 1366–1369.
VLDBVLDB-2007-ChaudhuriCGK #design #performance
Example-driven design of efficient record matching queries (SC, BCC, VG, RK), pp. 327–338.
VLDBVLDB-2007-ChaudhuriKRP #execution
Stop-and-Restart Style Execution for Long Running Decision Support Queries (SC, RK, RR, AP), pp. 735–745.
VLDBVLDB-2007-ChuBCDN #approach #incremental #relational #semistructured data
A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data (EC, AB, TC, AD, JFN), pp. 1045–1056.
VLDBVLDB-2007-DasGKS #ad hoc #data type
Ad-hoc Top-k Query Answering for Data Streams (GD, DG, NK, NS), pp. 183–194.
VLDBVLDB-2007-DellisS #performance
Efficient Computation of Reverse Skyline Queries (ED, BS), pp. 291–302.
VLDBVLDB-2007-DuanB
Processing Forecasting Queries (SD, SB), pp. 711–722.
VLDBVLDB-2007-GeZ
Answering Aggregation Queries in a Secure System Model (TG, SBZ), pp. 519–530.
VLDBVLDB-2007-GibasZF #framework #modelling #optimisation
A General Framework for Modeling and Processing Optimization Queries (MG, NZ, HF), pp. 1069–1080.
VLDBVLDB-2007-HaasHM #dependence #detection #feedback
Detecting Attribute Dependencies from Query Feedback (PJH, FH, VM), pp. 830–841.
VLDBVLDB-2007-HuaPFLL #database #scalability
Efficiently Answering Top-k Typicality Queries on Large Databases (MH, JP, AWCF, XL, HfL), pp. 890–901.
VLDBVLDB-2007-HuSS #sql
Supporting Time-Constrained SQL Queries in Oracle (YH, SS, JS), pp. 1207–1218.
VLDBVLDB-2007-IvesDR #adaptation #how #question #what #why
Adaptive query processing: Why, How, When, and What Next? (ZGI, AD, VR), pp. 1426–1427.
VLDBVLDB-2007-LeeZL #approach #concurrent #distributed #integration #throughput
Request Window: an Approach to Improve Throughput of RDBMS-based Data Integration System by Utilizing Data Sharing Across Concurrent Distributed Queries (RL, MZ, HL), pp. 1219–1230.
VLDBVLDB-2007-LiWY #approximate #named #performance #string #using
VGRAM: Improving Performance of Approximate Queries on String Collections Using Variable-Length Grams (CL, BW, XY), pp. 303–314.
VLDBVLDB-2007-LiYHK #authentication
Proof-Infused Streams: Enabling Authentication of Sliding Window Queries On Streams (FL, KY, MH, GK), pp. 147–158.
VLDBVLDB-2007-PapadomanolakisDA #automation #database #design #performance #using
Efficient Use of the Query Optimizer for Automated Database Design (SP, DD, AA), pp. 1093–1104.
VLDBVLDB-2007-QiCS #graph
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs (YQ, KSC, MLS), pp. 507–518.
VLDBVLDB-2007-Quiane-RuizLV #framework #named
SQLB: A Query Allocation Framework for Autonomous Consumers and Providers (JAQR, PL, PV), pp. 974–985.
VLDBVLDB-2007-ReS #database #optimisation #probability
Materialized Views in Probabilistic Databases for Information Exchange and Query Optimization (CR, DS), pp. 51–62.
VLDBVLDB-2007-SchnaitterSP #estimation #optimisation #ranking
Depth Estimation for Ranking Query Optimization (KS, JS, NP), pp. 902–913.
VLDBVLDB-2007-SubramanianBLLSSTYW
Continuous Queries in Oracle (SS, SB, HGL, VL, LS, WS, JT, TFY, AW), pp. 1173–1184.
VLDBVLDB-2007-TatikondaPG #named #programming #xml
LCS-TRIM: Dynamic Programming Meets XML Indexing and Querying (ST, SP, MG), pp. 63–74.
VLDBVLDB-2007-WolfKCFCK #database
Query Processing over Incomplete Autonomous Databases (GW, HK, BC, JF, YC, SK), pp. 651–662.
VLDBVLDB-2007-XuJ #algorithm #random
Randomized Algorithms for Data Reconciliation in Wide Area Aggregate Query Processing (FX, CJ), pp. 639–650.
VLDBVLDB-2007-YiuM #multi #performance
Efficient Processing of Top-k Dominating Queries on Multi-Dimensional Data (MLY, NM), pp. 483–494.
VLDBVLDB-2007-YuJ #database
Querying Complex Structured Databases (CY, HVJ), pp. 1010–1021.
VLDBVLDB-2007-ZinnBG #modelling #using
Modeling and Querying Vague Spatial Objects Using Shapelets (DZ, JB, MG), pp. 567–578.
ICPCICPC-2007-ReinikainenHLKS #comprehension
Software Comprehension through Concern-based Queries (TR, IH, JL, KK, TS), pp. 265–270.
ICALPICALP-2007-DedicM #database
Constant-Round Private Database Queries (ND, PM), pp. 255–266.
IFMIFM-2007-GheorghiuGC #logic
Finding State Solutions to Temporal Logic Queries (MG, AG, MC), pp. 273–292.
AGTIVEAGTIVE-2007-Weinell #adaptation
Adaptable Support for Queries and Transformations for the DRAGOS Graph-Database (EW), pp. 394–409.
GT-VMTGT-VMT-2007-LindqvistLP
A Query Language With the Star Operator (JL, TL, IP).
HCIHIMI-MTT-2007-ShiIL #using #visual notation
Facilitating Visual Queries in the TreeMap Using Distortion Techniques (KS, PI, PCL), pp. 345–353.
ICEISICEIS-DISI-2007-ArshinoffRSAO
Simplified query construction — queries made as easy as possible (BA, DR, MS, RA, ), pp. 125–130.
ICEISICEIS-DISI-2007-GorawskiG #approach #distributed
Distributed approach of continuous queries with knn join processing in spatial data warehouse (MG, WG), pp. 131–136.
ICEISICEIS-DISI-2007-GrecoMP #database
Preference rules in database querying (SG, CM, FP), pp. 119–124.
CIKMCIKM-2007-BastMW #interactive #performance
Efficient interactive query expansion with complete search (HB, DM, IW), pp. 857–860.
CIKMCIKM-2007-BrodianskiyC #self #xml
Self-correcting queries for xml (TB, SC), pp. 11–20.
CIKMCIKM-2007-CaoGNB #markov #modelling
Extending query translation to cross-language query expansion with markov chain models (GC, JG, JYN, JB), pp. 351–360.
CIKMCIKM-2007-ChanZ #algorithm #evaluation #performance
A fast unified optimal route query evaluation algorithm (EPFC, JZ), pp. 371–380.
CIKMCIKM-2007-CombiMP #sql
The t4sql temporal query language (CC, AM, GP), pp. 193–202.
CIKMCIKM-2007-FeuerSA #evaluation
Evaluation of phrasal query suggestions (AF, SS, JAA), pp. 841–848.
CIKMCIKM-2007-FuPL #network #optimisation #parallel
Optimizing parallel itineraries for knn query processing in wireless sensor networks (TYF, WCP, WCL), pp. 391–400.
CIKMCIKM-2007-GarakaniIHH #named #novel #xml
Ntjfsatnot: a novel method for query with not-predicates on xml data (VG, SKI, MH, MH), pp. 885–888.
CIKMCIKM-2007-JonesKPT #privacy #quote #what
“I know what you did last summer”: query logs and user privacy (RJ, RK, BP, AT), pp. 909–914.
CIKMCIKM-2007-MacdonaldO
Expertise drift and query expansion in expert search (CM, IO), pp. 341–350.
CIKMCIKM-2007-Pasca07a #using #web
Weakly-supervised discovery of named entities using web search queries (MP), pp. 683–690.
CIKMCIKM-2007-PascaDG #documentation
The role of documents vs. queries in extracting class attributes from text (MP, BVD, NG), pp. 485–494.
CIKMCIKM-2007-RullFTU #database
Computing explanations for unlively queries in databases (GR, CF, ET, TU), pp. 955–958.
CIKMCIKM-2007-SouldatosWTDS #evaluation #xml
Evaluation of partial path queries on xml data (SS, XW, DT, TD, TKS), pp. 21–30.
CIKMCIKM-2007-TamashiroTV #integration #towards
Towards practically feasible answering of regular path queries in lav data integration (MT, AT, SV), pp. 381–390.
CIKMCIKM-2007-WangFZ #feedback #retrieval #using
Improve retrieval accuracy for difficult queries using negative feedback (XW, HF, CZ), pp. 991–994.
CIKMCIKM-2007-YangRW #visual notation
Nugget discovery in visual exploration environments by query consolidation (DY, EAR, MOW), pp. 603–612.
CIKMCIKM-2007-YanH #feedback #multi #probability #retrieval #using
Query expansion using probabilistic local feedback with application to multimedia retrieval (RY, AGH), pp. 361–370.
CIKMCIKM-2007-ZhangLYSLM #classification #effectiveness #recognition #retrieval
Recognition and classification of noun phrases in queries for effective retrieval (WZ, SL, CTY, CS, FL, WM), pp. 711–720.
ECIRECIR-2007-AslamP #estimation #multi #using
Query Hardness Estimation Using Jensen-Shannon Divergence Among Multiple Scoring Functions (JAA, VP), pp. 198–209.
ECIRECIR-2007-DavyL #categorisation #learning
Active Learning with History-Based Query Selection for Text Categorisation (MD, SL), pp. 695–698.
ECIRECIR-2007-HuurninkR #retrieval #video
Term Selection and Query Operations for Video Retrieval (BH, MdR), pp. 708–711.
ECIRECIR-2007-MerkelK #classification #modelling
Language Model Based Query Classification (AM, DK), pp. 720–723.
ECIRECIR-2007-Monz #learning
Model Tree Learning for Query Term Weighting in Question Answering (CM), pp. 589–596.
ECIRECIR-2007-MoreauCS #automation #machine learning #using
Automatic Morphological Query Expansion Using Analogy-Based Machine Learning (FM, VC, PS), pp. 222–233.
ECIRECIR-2007-NottelmannF #distributed #formal method #network #peer-to-peer
A Decision-Theoretic Model for Decentralised Query Routing in Hierarchical Peer-to-Peer Networks (HN, NF), pp. 148–159.
ECIRECIR-2007-RoullandKCRGPO #clustering #refinement #using
Query Reformulation and Refinement Using NLP-Based Sentence Clustering (FR, ANK, SC, CR, AG, KP, JO), pp. 210–221.
ECIRECIR-2007-SerdyukovCN #modelling
Enhancing Expert Search Through Query Modeling (PS, SC, WN), pp. 737–740.
ECIRECIR-2007-YamoutOT #feedback #using
Relevance Feedback Using Weight Propagation Compared with Information-Theoretic Query Expansion (FY, MPO, JT), pp. 258–270.
ICMLICML-2007-ParkerFT #learning #performance #retrieval
Learning for efficient retrieval of structured data with noisy queries (CP, AF, PT), pp. 729–736.
KDDKDD-2007-Baeza-YatesT #semantics
Extracting semantic relations from query logs (RABY, AT), pp. 76–85.
KDDKDD-2007-CrabtreeAG #aspect-oriented #automation
Exploiting underrepresented query aspects for automatic query expansion (DC, PA, XG), pp. 191–200.
RecSysRecSys-2007-BridgeR #editing #recommendation
Supporting product selection with query editing recommendations (DGB, FR), pp. 65–72.
SEKESEKE-2007-FeijoFMGH #concept #modelling #named #xml
CXPath: a Query Language for Conceptual Models of Integrated XML Data (DdVF, CNF, ÁFM, RdMG, CAH), p. 592–?.
SEKESEKE-2007-KrenickyWE #design #using
Exploratory Design of Derivation Business Rules Using Query Rewriting (RK, DW, SME), pp. 467–472.
SEKESEKE-2007-TeekayuphunS #approach #hybrid #natural language
A Hybrid Approach for Natural Language Query Translation (PT, OS), pp. 368–373.
SEKESEKE-2007-ViswanathS #constraints #database
Query Processing in Paraconsistent Databases in the Presence of Integrity Constraints (NV, RS), pp. 580–585.
SIGIRSIGIR-2007-AzzopardiRB #analysis #topic #using
Building simulated queries for known-item topics: an analysis using six european languages (LA, MdR, KB), pp. 455–462.
SIGIRSIGIR-2007-BaiNCB #information retrieval #using
Using query contexts in information retrieval (JB, JYN, GC, HB), pp. 15–22.
SIGIRSIGIR-2007-BeitzelJCF #classification #topic #web
Varying approaches to topical web query classification (SMB, ECJ, AC, OF), pp. 783–784.
SIGIRSIGIR-2007-BozzonCFN #analysis #modelling #web
Lexical analysis for modeling web query reformulation (AB, PAC, CSF, WN), pp. 739–740.
SIGIRSIGIR-2007-BroderFGJJZ #classification #robust #using #web
Robust classification of rare queries using web knowledge (AZB, MF, EG, AJ, VJ, TZ), pp. 231–238.
SIGIRSIGIR-2007-ChaudhuriCKS #multi
Heavy-tailed distributions and multi-keyword queries (SC, KWC, ACK, LS), pp. 663–670.
SIGIRSIGIR-2007-ChiritaFN #personalisation #web
Personalized query expansion for the web (PAC, CSF, WN), pp. 7–14.
SIGIRSIGIR-2007-CucerzanW
Query suggestion based on user landing pages (SC, RWW), pp. 875–876.
SIGIRSIGIR-2007-CustisA #approach
A new approach for evaluating query expansion: query-document term mismatch (TC, KAK), pp. 575–582.
SIGIRSIGIR-2007-DowneyDH #web
Heads and tails: studies of web search with common and rare queries (DD, STD, EH), pp. 847–848.
SIGIRSIGIR-2007-FuKS #collaboration #retrieval #topic #using
Using collaborative queries to improve retrieval for difficult topics (XF, DK, CS), pp. 879–880.
SIGIRSIGIR-2007-GaoNNZHWH #using
Cross-lingual query suggestion using query logs of different languages (WG, CN, JYN, MZ, JH, KFW, HWH), pp. 463–470.
SIGIRSIGIR-2007-Jansen #web
Investigating the relevance of sponsored results for web ecommerce queries (BJJ), pp. 857–858.
SIGIRSIGIR-2007-LiaoC #ranking
Applying ranking SVM in query relaxation (CL, TC), pp. 763–764.
SIGIRSIGIR-2007-LiLHC #ad hoc #corpus #using #wiki
Improving weak ad-hoc queries using wikipedia as external corpus (YL, RWPL, EKSH, KFLC), pp. 797–798.
SIGIRSIGIR-2007-MeiFZ #case study #generative #information retrieval
A study of Poisson query generation model for information retrieval (QM, HF, CZ), pp. 319–326.
SIGIRSIGIR-2007-NguyenJYF #analysis #peer-to-peer
An analysis of peer-to-peer file-sharing system queries (LTN, DJ, WGY, OF), pp. 855–856.
SIGIRSIGIR-2007-PhanBW #comprehension
Understanding the relationship of information need specificity to search query length (NP, PB, RW), pp. 709–710.
SIGIRSIGIR-2007-QiuLBCK #ambiguity #metadata #using
Quantify query ambiguity using ODP metadata (GQ, KL, JB, CC, ZK), pp. 697–698.
SIGIRSIGIR-2007-TeevanAJP
Information re-retrieval: repeat queries in Yahoo’s logs (JT, EA, RJ, MASP), pp. 151–158.
SIGIRSIGIR-2007-WhiteCC #pseudo #refinement
Comparing query logs and pseudo-relevance feedbackfor web-search query refinement (RWW, CLAC, SC), pp. 831–832.
SIGIRSIGIR-2007-WhiteM #behaviour
Investigating the querying and browsing behavior of advanced search engine users (RWW, DM), pp. 255–262.
SIGIRSIGIR-2007-WinaverKD #framework #modelling #robust #towards
Towards robust query expansion: model selection in the language modeling framework (MW, OK, CD), pp. 729–730.
SIGIRSIGIR-2007-ZhangHRJ #learning #using
Query rewriting using active learning for sponsored search (WVZ, XH, BR, RJ), pp. 853–854.
SIGIRSIGIR-2007-ZhouC #performance #predict #web
Query performance prediction in web search environments (YZ, WBC), pp. 543–550.
PEPMPEPM-2007-CunhaV #source code #xpath
Transformation of structure-shy programs: applied to XPath queries and strategic functions (AC, JV), pp. 11–20.
PEPMPEPM-2007-MoorHV #object-oriented
Object-oriented queries over software systems: (OdM, EH, MV), p. 91.
PEPMPEPM-2007-RooverDBND #behaviour #logic #similarity #source code #using
Behavioral similarity matching using concrete source code templates in logic queries (CDR, TD, JB, CN, LD), pp. 92–101.
POPLPOPL-2007-WiedermannC #persistent #static analysis
Extracting queries by static analysis of transparent persistence (BW, WRC), pp. 199–210.
ESEC-FSEESEC-FSE-2007-PaytonJR #assessment #automation #consistency
Automatic consistency assessment for query results in dynamic environments (JP, CJ, GCR), pp. 245–254.
GTTSEGTTSE-2007-MoorSVHAEOT #object-oriented
.QL: Object-Oriented Queries Made Easy (OdM, DS, MV, EH, PA, TE, NO, JT), pp. 78–133.
SACSAC-2007-Al-NaymatCG #reduction
Dimensionality reduction for long duration and complex spatio-temporal queries (GAN, SC, JG), pp. 393–397.
SACSAC-2007-BaiocoTT #cost analysis #effectiveness #metric #similarity
An effective cost model for similarity queries in metric spaces (GBB, AJMT, CTJ), pp. 527–528.
SACSAC-2007-CiferriCFTS #performance
Horizontal fragmentation as a technique to improve the performance of drill-down and roll-up queries (CDdAC, RRC, DTF, AJMT, FdFdS), pp. 494–499.
SACSAC-2007-DUliziaFFGR #similarity
Structural similarity in geographical queries to improve query answering (AD, FF, AF, PG, MR), pp. 19–23.
SACSAC-2007-HaaseW #distributed #framework #ontology
A decentralized infrastructure for query answering over distributed ontologies (PH, YW), pp. 1351–1356.
SACSAC-2007-LuHC #data flow #relational #xml
Querying and browsing XML and relational data sources (JJL, CHH, TRC), pp. 489–493.
SACSAC-2007-MichalariasB #ad hoc #multi #network
Multidimensional querying in wireless ad hoc networks (IM, CB), pp. 529–530.
SACSAC-2007-PlattGM #detection #on the #sequence #topic #using
On using user query sequence to detect off-topic search (AP, NG, SSRM), pp. 882–883.
SACSAC-2007-SchusterS #documentation #estimation #natural language #random #web
NL sampler: random sampling of web documents based on natural language with query hit estimation (DS, AS), pp. 812–818.
SACSAC-2007-WangZD #distributed #optimisation #web
Query optimizing on a decentralized web search engine (DW, YZ, JD), pp. 880–881.
GPCEGPCE-2007-GilL #c++ #sql
Simple and safe SQL queries with c++ templates (JYG, KL), pp. 13–24.
PDPPDP-2007-Barlas #communication #image #latency #optimisation
Optimizing Image Content-Based Query Applications over High Latency Communication Media (GDB), pp. 341–348.
CSLCSL-2007-BaganDG #constant #on the
On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.
ICLPICLP-2007-GrecoM #consistency #database #semantics
Querying and Repairing Inconsistent Databases Under Three-Valued Semantics (SG, CM), pp. 149–164.
TAPTAP-2007-LiuMS #automation #contract #generative #quality #testing #using
Using Contracts and Boolean Queries to Improve the Quality of Automatic Test Generation (L(L, BM, BS), pp. 114–130.
DocEngDocEng-2006-BrunoM #xml
Describing and querying hierarchical XML structures defined over the same textual data (EB, EM), pp. 147–154.
TPDLECDL-2006-FuGF #algorithm #clustering #collaboration
A Hierarchical Query Clustering Algorithm for Collaborative Querying (LF, DHLG, SSBF), pp. 441–444.
TPDLECDL-2006-WangXZ #library #semantics #video
Managing and Querying Video by Semantics in Digital Library (YW, CX, LZ), pp. 367–378.
HTHT-2006-AndersonHB #hypermedia
Templates and queries in contextual hypermedia (KMA, FAH, NOB), pp. 99–110.
JCDLJCDL-2006-JordanWG #algorithm #feedback #generative #using
Using controlled query generation to evaluate blind relevance feedback algorithms (CJ, CRW, QG), pp. 286–295.
JCDLJCDL-2006-SongSAO #library
Keyphrase extraction-based query expansion in digital libraries (MS, IYS, RBA, ZO), pp. 202–209.
PODSPODS-2006-Cohen #equivalence #semantics #set
Equivalence of queries combining set and bag-set semantics (SC), pp. 70–79.
PODSPODS-2006-JayramKV #problem
The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.
PODSPODS-2006-Koch
Processing queries on tree-structured data efficiently (CK), pp. 213–224.
PODSPODS-2006-Rosati #database #decidability #finite #on the
On the decidability and finite controllability of query processing in databases with incomplete information (RR), pp. 356–365.
SIGMODSIGMOD-2006-ChenSM #performance #web
Efficient query processing in geographic web search engines (YYC, TS, AM), pp. 277–288.
SIGMODSIGMOD-2006-DasHKS
Ordering the attributes of query results (GD, VH, NK, SS), pp. 395–406.
SIGMODSIGMOD-2006-DeshpandeHR #adaptation #how #what #why
Adaptive query processing: why, how, when, what next (AD, JMH, VR), pp. 806–807.
SIGMODSIGMOD-2006-DingTS #maintenance #named
OMCAT: optimal maintenance of continuous queries’ answers for trajectories (HD, GT, PS), pp. 748–750.
SIGMODSIGMOD-2006-GedikL #delivery
Quality-aware dstributed data delivery for continuous query services (BG, LL), pp. 419–430.
SIGMODSIGMOD-2006-GouKC #evaluation #performance #using
Query evaluation using overlapping views: completeness and efficiency (GG, MK, RC), pp. 37–48.
SIGMODSIGMOD-2006-Hanrahan #analysis #named #visualisation
VizQL: a language for query, analysis and visualization (PH), p. 721.
SIGMODSIGMOD-2006-IpeirotisAJG #towards
To search or to crawl?: towards a query optimizer for text-centric tasks (PGI, EA, PJ, LG), pp. 265–276.
SIGMODSIGMOD-2006-KleinGRL #named
Derby/S: a DBMS for sample-based query answering (AK, RG, PR, WL), pp. 757–759.
SIGMODSIGMOD-2006-LimLLWS #data type #using
Continuous query processing in data streams using duality of data and queries (HSL, JGL, MJL, KYW, IYS), pp. 313–324.
SIGMODSIGMOD-2006-LiuZR #memory management #runtime
Run-time operator state spilling for memory intensive long-running queries (BL, YZ, EAR), pp. 347–358.
SIGMODSIGMOD-2006-MathisHH #xml
Locking-aware structural join operators for XML query processing (CM, TH, MPH), pp. 467–478.
SIGMODSIGMOD-2006-MouratidisBP #monitoring
Continuous monitoring of top-k queries over sliding windows (KM, SB, DP), pp. 635–646.
SIGMODSIGMOD-2006-OnoseDPC #using #xml
Rewriting nested XML queries using nested views (NO, AD, YP, EC), pp. 443–454.
SIGMODSIGMOD-2006-PapadomanolakisALTOH #performance
Efficient query processing on unstructured tetrahedral meshes (SP, AA, JCL, TT, DRO, GH), pp. 551–562.
SIGMODSIGMOD-2006-PetropoulosDP #interactive #web #web service
Interactive query formulation over web service-accessed sources (MP, AD, YP), pp. 253–264.
SIGMODSIGMOD-2006-ZhangHCWLC #database #optimisation #ranking
Boolean + ranking: querying a database by k-constrained optimization (ZZ, SwH, KCCC, MW, CAL, YCC), pp. 359–370.
VLDBVLDB-2006-AgarwalXYY #scalability
Scalable Continuous Query Processing by Tracking Hotspots (PKA, JX, JY, HY), pp. 31–42.
VLDBVLDB-2006-AhmedLWDSZC #cost analysis
Cost-Based Query Transformation in Oracle (RA, AWL, AW, DD, HS, MZ, TC), pp. 1026–1036.
VLDBVLDB-2006-AilamakiGHM
Query Co-Processing on Commodity Processors (AA, NKG, SH, DM), p. 1267.
VLDBVLDB-2006-ApaydinCFT #approximate #encoding
Approximate Encoding for Direct Access and Query Processing over Compressed Bitmaps (TA, GC, HF, AST), pp. 846–857.
VLDBVLDB-2006-BalminBON #on the #performance #xml
On the Path to Efficient XML Queries (AB, KSB, , MN), pp. 1117–1128.
VLDBVLDB-2006-BastMSTW #named
IO-Top-k: Index-access Optimized Top-k Query Processing (HB, DM, RS, MT, GW), pp. 475–486.
VLDBVLDB-2006-BeeriEKM #process
Querying Business Processes (CB, AE, SK, TM), pp. 343–354.
VLDBVLDB-2006-BorkarCLWEO #framework #platform
Query Processing in the AquaLogic Data Services Platform (VRB, MJC, DL, TW, DE, NO), pp. 1037–1048.
VLDBVLDB-2006-BunemanCFK #distributed #partial evaluation #using
Using Partial Evaluation in Distributed Query Evaluation (PB, GC, WF, AK), pp. 211–222.
VLDBVLDB-2006-ChenLSDC #database #image #named #scalability #semantic gap
HISA: A Query System Bridging The Semantic Gap For Large Image Databases (GC, XL, LS, JD, CC), pp. 1187–1190.
VLDBVLDB-2006-ChenLTHAC #bottom-up #documentation #named #stack #xml
Twig2Stack: Bottom-up Processing of Generalized-Tree-Pattern Queries over XML Documents (SC, HGL, JT, WPH, DA, KSC), pp. 283–294.
VLDBVLDB-2006-DasGKT #using
Answering Top-k Queries Using Views (GD, DG, NK, DT), pp. 451–462.
VLDBVLDB-2006-DragutYM #interface
Meaningful Labeling of Integrated Query Interfaces (ECD, CTY, WM), pp. 679–690.
VLDBVLDB-2006-JoshiDZWFLW #architecture #image #multimodal #named #web
PARAgrab: A Comprehensive Architecture for Web Image Management and Multimodal Querying (DJ, RD, ZZ, WPW, MF, JL, JZW), pp. 1163–1166.
VLDBVLDB-2006-KacheHMRE #named #optimisation
POP/FED: Progressive Query Optimization for Federated Queries in DB2 (HK, WSH, VM, VR, SE), pp. 1175–1178.
VLDBVLDB-2006-KoudasLTV
Relaxing Join and Selection Queries (NK, CL, AKHT, RV), pp. 199–210.
VLDBVLDB-2006-LakshmananWZ #using
Answering Tree Pattern Queries Using Views (LVSL, WHW, Z(Z), pp. 571–582.
VLDBVLDB-2006-LiCTACH #data type #safety
Safety Guarantee of Continuous Join Queries over Punctuated Data Streams (HGL, SC, JT, DA, KSC, WPH), pp. 19–30.
VLDBVLDB-2006-Luo #detection #performance
Efficient Detection of Empty-Result Queries (GL), pp. 1015–1025.
VLDBVLDB-2006-MokbelCA #privacy
The New Casper: Query Processing for Location Services without Compromising Privacy (MFM, CYC, WGA), pp. 763–774.
VLDBVLDB-2006-NabarMKMM #robust #towards
Towards Robustness in Query Auditing (SUN, BM, KK, NM, RM), pp. 151–162.
VLDBVLDB-2006-NarayananDMR
Delay Aware Querying with Seaweed (DN, AD, RM, AITR), pp. 727–738.
VLDBVLDB-2006-Pradhan #algebra #effectiveness #performance #retrieval #xml
An Algebraic Query Model for Effective and Efficient Retrieval of XML Fragments (SP), pp. 295–306.
VLDBVLDB-2006-RamanS #how
How to Wring a Table Dry: Entropy Compression of Relations and Querying of Compressed Relations (VR, GS), pp. 858–869.
VLDBVLDB-2006-SharafCLP #performance #scheduling
Efficient Scheduling of Heterogeneous Continuous Queries (MAS, PKC, AL, KP), pp. 511–522.
VLDBVLDB-2006-SharifzadehS
The Spatial Skyline Queries (MS, CS), pp. 751–762.
VLDBVLDB-2006-SpiegelPBP #approximate #named #xml
AQAX: A System for Approximate XML Query Answers (JS, EDP, SB, NP), pp. 1159–1162.
VLDBVLDB-2006-SrivastavaMWM #optimisation #web #web service
Query Optimization over Web Services (US, KM, JW, RM), pp. 355–366.
VLDBVLDB-2006-TatbulZ #data type
Window-Aware Load Shedding for Aggregation Queries over Data Streams (NT, SBZ), pp. 799–810.
VLDBVLDB-2006-WangL #database #evaluation #performance #xml
Efficient Secure Query Evaluation over Encrypted XML Databases (WHW, LVSL), pp. 127–138.
VLDBVLDB-2006-WangRGB #multi #named #optimisation #paradigm
State-Slice: New Paradigm of Multi-query Optimization of Window-based Stream Queries (SW, EAR, SG, SB), pp. 619–630.
VLDBVLDB-2006-WangSLWYDRM #named #optimisation #runtime #semantics #xml
R-SOX: Runtime Semantic Query Optimization over XML Streams (SW, HS, ML, MW, SY, DD, EAR, MM), pp. 1207–1210.
VLDBVLDB-2006-XinCH #robust #towards
Towards Robust Indexing for Ranked Queries (DX, CC, JH), pp. 235–246.
VLDBVLDB-2006-XinHCL #approach #multi #ranking
Answering Top-k Queries with Multi-Dimensional Selections: The Ranking Cube Approach (DX, JH, HC, XL), pp. 463–475.
VLDBVLDB-2006-ZhangDXT
Progressive Computation of the Min-Dist Optimal-Location Query (DZ, YD, TX, YT), pp. 643–654.
MSRMSR-2006-VoineaT #analysis #cvs #framework #repository #visualisation
An open framework for CVS repository querying, analysis and visualization (LV, ACT), pp. 33–39.
WCREWCRE-2006-XingS #detection #refactoring
Refactoring Detection based on UMLDiff Change-Facts Queries (ZX, ES), pp. 263–274.
ICALPICALP-v2-2006-BenediktK
Interpreting Tree-to-Tree Queries (MB, CK), pp. 552–564.
ICGTICGT-2006-RotschkeS #evolution #graph
Temporal Graph Queries to Support Software Evolution (TR, AS), pp. 291–305.
CAiSECAiSE-2006-DourdasZMJZ #requirements
Discovering Remote Software Services that Satisfy Requirements: Patterns for Query Reformulation (ND, XZ, NAMM, SJ, KZ), pp. 239–254.
CAiSECAiSE-2006-SimitsisK
Comprehensible Answers to Précis Queries (AS, GK), pp. 142–156.
CAiSECAiSE-2006-YangNLC #approach #outsourcing #performance #xml
An Efficient Approach to Support Querying Secure Outsourced XML Information (YY, WN, HLL, JC), pp. 157–171.
ICEISICEIS-DISI-2006-CaropreseGZ #consistency #database #dependence #functional
Merging, Repairing and Querying Inconsistent Databases with Functional and Inclusion Dependencies (LC, SG, EZ), pp. 38–45.
ICEISICEIS-DISI-2006-GroppeG #satisfiability #xpath
Filtering Unsatisfiable XPATH Queries (JG, SG), pp. 157–162.
ICEISICEIS-DISI-2006-OommenC #database #on the #optimisation
On Utilizing Attribute Cardinality Maps to Enhance Query Optimization in the Oracle Database System (BJO, JC), pp. 23–35.
ICEISICEIS-DISI-2006-StojanovicDPN #mobile #network
Continuous Range Query Processing for Network Constrained Mobile Objects (DS, SDK, ANP, AN), pp. 63–70.
ICEISICEIS-HCI-2006-ElarissKH #evaluation #information management #visual notation
An Evaluation of a Visual Query Language for Information Systems (HEE, SK, RAH), pp. 51–58.
ICEISICEIS-J-2006-OommenC06a #database #on the #optimisation
On Enhancing Query Optimization in the Oracle Database System by Utilizing Attribute Cardinality Maps (BJO, JC), pp. 38–71.
CIKMCIKM-2006-AchtertBKKPR #approximate #metric #nearest neighbour
Approximate reverse k-nearest neighbor queries in general metric spaces (EA, CB, PK, PK, AP, MR), pp. 788–789.
CIKMCIKM-2006-AnhM
Pruning strategies for mixed-mode querying (VNA, AM), pp. 190–197.
CIKMCIKM-2006-BroderFJKMNPTX #corpus
Estimating corpus size via queries (AZB, MF, VJ, RK, RM, SUN, RP, AT, YX), pp. 594–603.
CIKMCIKM-2006-CaoNB #documentation #markov #modelling
Constructing better document and query models with markov chains (GC, JYN, JB), pp. 800–801.
CIKMCIKM-2006-ChengTHC #generative #taxonomy #web
Query taxonomy generation for web search (PJC, CHT, CMH, LFC), pp. 862–863.
CIKMCIKM-2006-ChirkovaS #optimisation #using
Query optimization using restructured views (RC, FS), pp. 642–651.
CIKMCIKM-2006-EguchiC #dependence #performance
Boosting relevance model performance with query term dependence (KE, WBC), pp. 792–793.
CIKMCIKM-2006-KadriN #estimation #information retrieval
Improving query translation with confidence estimation for cross language information retrieval (YK, JYN), pp. 818–819.
CIKMCIKM-2006-LiuJK #clustering
Measuring the meaning in time series clustering of text search queries (BL, RJ, KLK), pp. 836–837.
CIKMCIKM-2006-LiuWL #approach #modelling #pervasive #physics
Integrated RFID data modeling: an approach for querying physical objects in pervasive computing (SL, FW, PL), pp. 822–823.
CIKMCIKM-2006-LuPLA #feature model #identification #machine learning
Coupling feature selection and machine learning methods for navigational query identification (YL, FP, XL, NA), pp. 682–689.
CIKMCIKM-2006-MarsoloPR #using
Structure-based querying of proteins using wavelets (KM, SP, KR), pp. 24–33.
CIKMCIKM-2006-RanganathanL #database #information retrieval #relational #semantics #using
Information retrieval from relational databases using semantic queries (AR, ZL), pp. 820–821.
CIKMCIKM-2006-StanoiMPL #distributed #throughput
Maximizing the sustained throughput of distributed continuous queries (IS, GAM, TP, CAL), pp. 834–835.
CIKMCIKM-2006-SuWHL #database #e-commerce #ranking #web
Query result ranking over e-commerce web databases (WS, JW, QH, FHL), pp. 575–584.
CIKMCIKM-2006-TaoZ #database
Best-k queries on database systems (TT, CZ), pp. 790–791.
CIKMCIKM-2006-TheodoratosSDPS #graph #heuristic
Heuristic containment check of partial tree-pattern queries in the presence of index graphs (DT, SS, TD, PP, TKS), pp. 445–454.
CIKMCIKM-2006-TrainaTVAF #performance #similarity
Efficient processing of complex similarity queries in RDBMS through query rewriting (CTJ, AJMT, MRV, ASA, CF), pp. 4–13.
CIKMCIKM-2006-WangC #performance #permutation #sequence
Improving query I/O performance by permuting and refining block request sequences (XW, MC), pp. 652–661.
CIKMCIKM-2006-ZhaZFS #difference #learning #retrieval #web
Incorporating query difference for learning retrieval functions in world wide web search (HZ, ZZ, HF, GS), pp. 307–316.
CIKMCIKM-2006-ZhouC #framework #novel #performance #predict #ranking #robust
Ranking robustness: a novel framework to predict query performance (YZ, WBC), pp. 567–574.
CIKMCIKM-2006-ZhuangC #ranking #using
Re-ranking search results using query logs (ZZ, SC), pp. 860–861.
ECIRECIR-2006-AlberairS
Morphological Variation of Arabic Queries (AA, MS), pp. 468–471.
ECIRECIR-2006-ChangP #performance
Efficient Phrase Querying with Common Phrase Index (MC, CKP), pp. 61–71.
ECIRECIR-2006-NottelmannF #architecture #network #peer-to-peer
Comparing Different Architectures for Query Routing in Peer-to-Peer Networks (HN, NF), pp. 253–264.
ECIRECIR-2006-RodeH #using
Using Query Profiles for Clarification (HR, DH), pp. 205–216.
ECIRECIR-2006-UrbanJ #image #problem #question #retrieval
Can a Workspace Help to Overcome the Query Formulation Problem in Image Retrieval? (JU, JMJ), pp. 385–396.
ECIRECIR-2006-ZwolBOW #documentation #named #retrieval
Bricks: The Building Blocks to Tackle Query Formulation in Structured Document Retrieval (RvZ, JB, HvO, FW), pp. 314–325.
KDDKDD-2006-WedigM #analysis #personalisation #scalability
A large-scale analysis of query logs for assessing personalization opportunities (SW, OM), pp. 742–747.
KRKR-2006-CalvaneseGLLR #complexity #logic
Data Complexity of Query Answering in Description Logics (DC, GDG, DL, ML, RR), pp. 260–270.
KRKR-2006-Straccia #logic programming #source code
Query Answering under the Any-World Assumption for Normal Logic Programs (US), pp. 329–339.
SEKESEKE-2006-JeanAP #database #ontology
Querying Ontology Based Databases — The OntoQL Proposal (SJ, YAA, GP), pp. 166–171.
SEKESEKE-2006-LiuP #modelling #multi #optimisation
Multi-model Based Optimization for Stream Query Processing (YL, BP), pp. 150–155.
SIGIRSIGIR-2006-AnhM #evaluation #using
Pruned query evaluation using pre-computed impacts (VNA, AM), pp. 372–379.
SIGIRSIGIR-2006-CarmelYDP #question #what
What makes a query difficult? (DC, EYT, AD, DP), pp. 390–397.
SIGIRSIGIR-2006-CaverleeLB #approach #distributed
Distributed query sampling: a quality-conscious approach (JC, LL, JB), pp. 340–347.
SIGIRSIGIR-2006-FuK
Evaluating sources of query expansion terms (XF, DK), pp. 647–648.
SIGIRSIGIR-2006-GaoN #case study #modelling #statistics
A study of statistical models for query translation: finding a good unit of translation (JG, JYN), pp. 194–201.
SIGIRSIGIR-2006-LiKVJ #transaction #web
Getting work done on the web: supporting transactional queries (YL, RK, SV, HVJ), pp. 557–564.
SIGIRSIGIR-2006-MurrayLC #behaviour #modelling #predict
Action modeling: language models that predict query behavior (GCM, JJL, AC), pp. 681–682.
SIGIRSIGIR-2006-ParikhK #feedback #named #using
Unity: relevance feedback using user query logs (JP, SK), pp. 689–690.
SIGIRSIGIR-2006-ShenSYC #classification #web
Building bridges for web query classification (DS, JTS, QY, ZC), pp. 131–138.
SIGIRSIGIR-2006-SunOC #dependence #mining #retrieval
Mining dependency relations for query expansion in passage retrieval (RS, CHO, TSC), pp. 382–389.
SIGIRSIGIR-2006-TeevanAJP
History repeats itself: repeat queries in Yahoo’s logs (JT, EA, RJ, MASP), pp. 703–704.
SIGIRSIGIR-2006-TrotmanL #strict
Strict and vague interpretation of XML-retrieval queries (AT, ML), pp. 709–710.
SIGIRSIGIR-2006-TrotmanL06a #why
Why structural hints in queries do not help XML-retrieval (AT, ML), pp. 711–712.
SIGIRSIGIR-2006-WhiteM #case study #effectiveness #realtime
A study of real-time query expansion effectiveness (RWW, GM), pp. 715–716.
SIGIRSIGIR-2006-YanH #analysis #multi #probability #retrieval
Probabilistic latent query analysis for combining multiple retrieval sources (RY, AGH), pp. 324–331.
SIGIRSIGIR-2006-ZhaZFS #difference #information retrieval #learning
Incorporating query difference for learning retrieval functions in information retrieval (HZ, ZZ, HF, GS), pp. 721–722.
ECMFAECMDA-FA-2006-BoronatOGRC #algebra #eclipse #framework #modelling #ocl #specification
An Algebraic Specification of Generic OCL Queries Within the Eclipse Modeling Framework (AB, JO, AG, IR, JÁC), pp. 316–330.
ECOOPECOOP-2006-HajiyevVM #datalog #named #scalability #source code
codeQuest: Scalable Source Code Queries with Datalog (EH, MV, OdM), pp. 2–27.
ECOOPECOOP-2006-WillisPN #java #performance
Efficient Object Querying for Java (DW, DJP, JN), pp. 28–49.
PADLPADL-2006-LiuS #graph
Querying Complex Graphs (YAL, SDS), pp. 199–214.
PADLPADL-2006-NagyLS #logic #prolog
Translating Description Logic Queries to Prolog (ZN, GL, PS), pp. 168–182.
SACSAC-2006-ChenSC #algorithm #evaluation
Tree inclusion algorithm, signatures and evaluation of path-oriented queries (YC, YS, YC), pp. 1020–1025.
SACSAC-2006-FengQWZ #mining #xml
Exploit sequencing to accelerate hot XML query pattern mining (JF, QQ, JW, LZ), pp. 517–524.
SACSAC-2006-JinNCY #information retrieval #performance #semantics
Efficient query routing for information retrieval in semantic overlays (HJ, XN, HC, ZY), pp. 1669–1673.
SACSAC-2006-LamLC #named #ubiquitous
BBQ: group-based querying in a ubiquitous environment (GHKL, HVL, SCfC), pp. 1910–1914.
SACSAC-2006-LoscioCS #integration #xml
Query reformulation for an XML-based data integration system (BFL, TC, ACS), pp. 498–502.
SACSAC-2006-MeoQFU #multi
A multi-agent system for efficiently managing query answering in an e-government scenario (PDM, GQ, HF, DU), pp. 308–312.
SACSAC-2006-ParkSH
Continuous spatial queries via wireless data broadcast (KP, MS, CSH), pp. 78–82.
SACSAC-2006-RaptopoulouVM #performance
Efficient processing of past-future spatiotemporal queries (KR, MV, YM), pp. 68–72.
SACSAC-2006-RendaS #automation #distributed #library
Automatic structured query transformation over distributed digital libraries (MER, US), pp. 1078–1083.
PDPPDP-2006-HeichlerK #distributed #parallel #random
A Distributed Query Structure to Explore Random Mappings in Parallel (JH, JK), pp. 173–177.
PDPPDP-2006-MarzollaO #network #peer-to-peer #performance
Tree Vector Indexes: Efficient Range Queries for Dynamic Content on Peer-to-Peer Networks (MM, MM, SO), pp. 457–464.
STOCSTOC-2006-Feldman #approximate #learning #logic
Hardness of approximate two-level logic minimization and PAC learning with membership queries (VF), pp. 363–372.
CSLCSL-2006-Bagan #linear
MSO Queries on Tree Decomposable Structures Are Computable with Linear Delay (GB), pp. 167–181.
CSLCSL-2006-DurandO #first-order
First-Order Queries over One Unary Function (AD, FO), pp. 334–348.
ICLPICLP-2006-QuintanoR #database #framework #logic programming #natural language #using
Using a Logic Programming Framework to Control Database Query Dialogues in Natural Language (LQ, IPR), pp. 406–420.
TPDLECDL-2005-FuGF #collaboration #evaluation
Evaluation of a Collaborative Querying System (LF, DHLG, SSBF), pp. 502–503.
TPDLECDL-2005-PeinadoLGV #automation #metadata
Searching Cross-Language Metadata with Automatically Structured Queries (VP, FLO, JG, FV), pp. 529–530.
TPDLECDL-2005-SchaeferJKF #case study #library
Active Support for Query Formulation in Virtual Digital Libraries: A Case Study with DAFFODIL (AS, MJ, CPK, NF), pp. 414–425.
HTHT-2005-AmitayDKW
Queries as anchors: selection by association (EA, AD, DK, UW), pp. 193–201.
JCDLJCDL-2005-KanP #detection #online
Detecting and supporting known item queries in online public access catalogs (MYK, DCCP), pp. 91–99.
JCDLJCDL-2005-NtoulasZC #keyword #web
Downloading textual hidden web content through keyword queries (AN, PZ, JC), pp. 100–109.
PODSPODS-2005-ArenasL #consistency #xml
XML data exchange: consistency and query answering (MA, LL), pp. 13–24.
PODSPODS-2005-Bar-YossefFJ #evaluation #xml
Buffering in query evaluation over XML streams (ZBY, MF, VJ), pp. 216–227.
PODSPODS-2005-Koch #complexity #functional #on the #recursion #xquery
On the complexity of nonrecursive XQuery and functional query languages on complex values (CK), pp. 84–97.
PODSPODS-2005-LamWLMACU #database #program analysis
Context-sensitive program analysis as database queries (MSL, JW, VBL, MCM, DA, MC, CU), pp. 1–12.
PODSPODS-2005-SegoufinV
Views and queries: determinacy and rewriting (LS, VV), pp. 49–60.
PODSPODS-2005-SrivastavaMW
Operator placement for in-network stream query processing (US, KM, JW), pp. 250–258.
SIGMODSIGMOD-2005-BabcockC #approach #robust #towards
Towards a Robust Query Optimizer: A Principled and Practical Approach (BB, SC), pp. 119–130.
SIGMODSIGMOD-2005-BragaCCR #learning #named #visual notation #xml
XQBE: a visual environment for learning XML query languages (DB, AC, SC, AR), pp. 903–905.
SIGMODSIGMOD-2005-ChaudhuriKR #question #sql #trust
When Can We Trust Progress Estimators for SQL Queries? (SC, RK, RR), pp. 575–586.
SIGMODSIGMOD-2005-ChenN #multi #performance
Efficient Computation of Multiple Group By Queries (ZC, VRN), pp. 263–274.
SIGMODSIGMOD-2005-DennyF
Predicate Result Range Caching for Continuous Queries (MD, MJF), pp. 646–657.
SIGMODSIGMOD-2005-GolabO #modelling
Update-Pattern-Aware Modeling and Processing of Continuous Queries (LG, MTÖ), pp. 658–669.
SIGMODSIGMOD-2005-HarizopoulosSA #named #pipes and filters #relational
QPipe: A Simultaneously Pipelined Relational Query Engine (SH, VS, AA), pp. 383–394.
SIGMODSIGMOD-2005-HeZC #named #on the fly #web
MetaQuerier: querying structured web sources on-the-fly (BH, ZZ, KCCC), pp. 927–929.
SIGMODSIGMOD-2005-HuXL #framework #monitoring
A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects (HH, JX, DLL), pp. 479–490.
SIGMODSIGMOD-2005-KoutrikaI #personalisation
Constrained Optimalities in Query Personalization (GK, YEI), pp. 73–84.
SIGMODSIGMOD-2005-LiCIS #algebra #named #optimisation #relational
RankSQL: Query Algebra and Optimization for Relational Top-k Queries (CL, KCCC, IFI, SS), pp. 131–142.
SIGMODSIGMOD-2005-LiYJ #interactive #interface #named #natural language #xml
NaLIX: an interactive natural language interface for querying XML (YL, HY, HVJ), pp. 900–902.
SIGMODSIGMOD-2005-Ordonez #optimisation #recursion #sql
Optimizing recursive queries in SQL (CO), pp. 834–839.
SIGMODSIGMOD-2005-PangJRT #relational #verification
Verifying Completeness of Relational Query Results in Data Publishing (HP, AJ, KR, KLT), pp. 407–418.
SIGMODSIGMOD-2005-SuciuD #probability
Foundations of probabilistic answers to queries (DS, NND), p. 963.
SIGMODSIGMOD-2005-ZamanS #data flow #modelling #multi #relational
Modeling and querying multidimensional data sources in Siebel Analytics: a federated relational system (KAZ, DAS), pp. 822–827.
VLDBVLDB-2005-BartaCM #data access #multi #summary #xml
Benefits of Path Summaries in an XML Query Optimizer Supporting Multiple Access Methods (AB, MPC, AOM), pp. 133–144.
VLDBVLDB-2005-ChengKPKT #adaptation
Adaptive Stream Filters for Entity-based Queries with Non-Value Tolerance (RC, BK, SP, AK, YCT), pp. 37–48.
VLDBVLDB-2005-ChoC #approach #network #performance #scalability
An Efficient and Scalable Approach to CNN Queries in a Road Network (HJC, CWC), pp. 865–876.
VLDBVLDB-2005-ChongDES #performance #rdf
An Efficient SQL-based RDF Querying Scheme (EIC, SD, GE, JS), pp. 1216–1227.
VLDBVLDB-2005-CormodeG #approximate #distributed #sketching
Sketching Streams Through the Net: Distributed Approximate Query Tracking (GC, MNG), pp. 13–24.
VLDBVLDB-2005-DalviS #probability #statistics
Answering Queries from Statistics and Probabilistic Views (NND, DS), pp. 805–816.
VLDBVLDB-2005-EnderleSS #database #relational #tuple
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases (JE, NS, TS), pp. 385–396.
VLDBVLDB-2005-ErcegovacDR #benchmark #metric #performance #relational
The TEXTURE Benchmark: Measuring Performance of Text Queries on a Relational DBMS (VE, DJD, RR), pp. 313–324.
VLDBVLDB-2005-FanYLLR #recursion #sql #xpath
Query Translation from XPath to SQL in the Presence of Recursive DTDs (WF, JXY, HL, JL, RR), pp. 337–348.
VLDBVLDB-2005-FuKLR #scalability
Scaling and Time Warping in Time Series Querying (AWCF, EJK, LYHL, C(R), pp. 649–660.
VLDBVLDB-2005-FuxmanFM #consistency #database #named #performance
ConQuer: A System for Efficient Querying Over Inconsistent Databases (AF, DF, RJM), pp. 1354–1357.
VLDBVLDB-2005-Galindo-LegariaGKW #database #performance
Database Change Notifications: Primitives for Efficient Database Query Result Caching (CAGL, TG, CK, FW), pp. 1275–1278.
VLDBVLDB-2005-GuravannavarRS #optimisation #order #parametricity
Optimizing Nested Queries with Parameter Sort Orders (RG, HSR, SS), pp. 481–492.
VLDBVLDB-2005-HadjieleftheriouKBT
Complex Spatio-Temporal Pattern Queries (MH, GK, PB, VJT), pp. 877–888.
VLDBVLDB-2005-IvanovaR #execution #parallel
Customizable Parallel Execution of Scientific Stream Queries (MI, TR), pp. 157–168.
VLDBVLDB-2005-JermaineDPJ #estimation #online #sql
Online Estimation For Subset-Based SQL Queries (CJ, AD, AP, SJ), pp. 745–756.
VLDBVLDB-2005-LiSCI #database #named #ranking #relational
RankSQL: Supporting Ranking Queries in Relational Database Management Systems (CL, MAS, KCCC, IFI), pp. 1342–1345.
VLDBVLDB-2005-LiuR #parallel #pipes and filters
Revisiting Pipelined Parallelism in Multi-Join Query Processing (BL, EAR), pp. 829–840.
VLDBVLDB-2005-LiuZJMR #adaptation #distributed
A Dynamically Adaptive Distributed System for Processing Complex Continuous Queries (BL, YZ, MJ, BM, EAR), pp. 1338–1341.
VLDBVLDB-2005-MandhaniS #database #xml
Query Caching and View Selection for XML Databases (BM, DS), pp. 469–480.
VLDBVLDB-2005-MeierWAS #classification #fuzzy #using
Using a Fuzzy Classification Query Language for Customer Relationship Management (AM, NW, MA, MS), pp. 1089–1096.
VLDBVLDB-2005-MichelTW #algorithm #distributed #framework #named
KLEE: A Framework for Distributed Top-k Query Algorithms (SM, PT, GW), pp. 637–648.
VLDBVLDB-2005-MoroVT #lightweight #xml
Tree-Pattern Queries on a Lightweight XML Processor (MMM, ZV, VJT), pp. 205–216.
VLDBVLDB-2005-NambiarK #database #web
Answering Imprecise Queries over Web Databases (UN, SK), pp. 1350–1353.
VLDBVLDB-2005-Olstad #database #why
Why Search Engines are Used Increasingly to Offload Queries from Databases (BO), p. 1.
VLDBVLDB-2005-RamanHN #parallel
Parallel Querying with Non-Dedicated Computers (VR, WH, IN), pp. 61–72.
VLDBVLDB-2005-ReddyH #database #diagrams
Analyzing Plan Diagrams of Database Query Optimizers (NR, JRH), pp. 1228–1240.
VLDBVLDB-2005-RossJS
A Faceted Query Engine Applied to Archaeology (KAR, AJ, JS), pp. 1334–1337.
VLDBVLDB-2005-SchmidtLSL #realtime #robust
Robust Real-time Query Processing with QStream (SS, TL, SS, WL), pp. 1299–1302.
VLDBVLDB-2005-Sion #assurance #database #execution #outsourcing
Query Execution Assurance for Outsourced Databases (RS), pp. 601–612.
VLDBVLDB-2005-SuRM #optimisation #semantics #xml #xquery
Semantic Query Optimization for XQuery over XML Streams (HS, EAR, MM), pp. 277–288.
VLDBVLDB-2005-TheobaldSW #performance
An Efficient and Versatile Query Engine for TopX Search (MT, RS, GW), pp. 625–636.
VLDBVLDB-2005-UniversityIEKM #process
Querying Business Processes with BP-QL (CB, AE, SK, TM), pp. 1255–1258.
VLDBVLDB-2005-WangWLJLL #performance #using #xml
Efficient Processing of XML Path Queries Using the Disk-based F&B Index (WW, HW, HL, HJ, XL, JL), pp. 145–156.
VLDBVLDB-2005-WitkowskiBBNSSW
Query By Excel (AW, SB, TB, AN, LS, SS, AW), pp. 1204–1215.
VLDBVLDB-2005-XuO #using #xpath
Rewriting XPath Queries Using Materialized Views (WX, ZMÖ), pp. 121–132.
VLDBVLDB-2005-ZhangHC #database #on the fly #web
Light-weight Domain-based Form Assistant: Querying Web Databases On the Fly (ZZ, BH, KCCC), pp. 97–108.
VLDBVLDB-2005-ZhangHJLZ #cost analysis #learning #statistics #xml
Statistical Learning Techniques for Costing XML Queries (NZ, PJH, VJ, GML, CZ), pp. 289–300.
MSRMSR-2005-HindleG #formal method #named #repository
SCQL: a formal model and a query language for source control repositories (AH, DMG), pp. 6–10.
ICALPICALP-2005-GroheKS #bound #memory management #streaming
Tight Lower Bounds for Query Processing on Streaming and External Memory Data (MG, CK, NS), pp. 1076–1088.
ICALPICALP-2005-KoiranNP #bound #complexity #problem #quantum
A Quantum Lower Bound for the Query Complexity of Simon’s Problem (PK, VN, NP), pp. 1287–1298.
ICALPICALP-2005-KowalukL #graph
LCA Queries in Directed Acyclic Graphs (MK, AL), pp. 241–248.
CAiSECAiSE-2005-NecibF #ontology #using
Query Processing Using Ontologies (CBN, JCF), pp. 167–186.
CAiSECAiSE-2005-StasiuHS #database #precise
Estimating Recall and Precision for Vague Queries in Databases (RKS, CAH, RdS), pp. 187–200.
CAiSECAiSE-2005-TheodoratosD #graph #using
Querying Tree-Structured Data Using Dimension Graphs (DT, TD), pp. 201–215.
ICEISICEIS-v1-2005-ChenC #database #documentation #evaluation #on the
On the Tree Inclusion and Query Evaluation in Document Databases (YC, YC), pp. 182–190.
ICEISICEIS-v1-2005-ChenMG #semantics #web
Semantic Query Transformation for Integrating Web Information Sources (MC, RM, RG), pp. 176–181.
ICEISICEIS-v1-2005-KenabB #relational #xml
Simultaneous Querying of XML and Relational Contexts (MK, TOB), pp. 353–358.
ICEISICEIS-v1-2005-SoeANNT #architecture #framework #parallel
A Framework for Parallel Query Processing on Grid-Based Architecture (KMS, TNA, AAN, TTN, NT), pp. 203–208.
ICEISICEIS-v2-2005-MalhotraPJ #web
Synthesise Web Queries: Search the Web by Examples (VMM, SP, DJ), pp. 291–296.
CIKMCIKM-2005-AfratiLL #adaptation #using #web
Answering aggregation queries on hierarchical web sites using adaptive sampling (FNA, PVL, CL), pp. 237–238.
CIKMCIKM-2005-BaiSBNC #information retrieval #modelling #using
Query expansion using term relationships in language models for information retrieval (JB, DS, PB, JYN, GC), pp. 688–695.
CIKMCIKM-2005-BambaRM #clustering #named
OSQR: overlapping clustering of query results (BB, PR, MKM), pp. 239–240.
CIKMCIKM-2005-ButtcherC #information management #information retrieval #trade-off
Indexing time vs. query time: trade-offs in dynamic information retrieval systems (SB, CLAC), pp. 317–318.
CIKMCIKM-2005-Collins-ThompsonC #modelling #random #using
Query expansion using random walk models (KCT, JC), pp. 704–711.
CIKMCIKM-2005-ComanNS #energy #network #performance
Exploiting redundancy in sensor networks for energy efficient processing of spatiotemporal region queries (AC, MAN, JS), pp. 187–194.
CIKMCIKM-2005-EdaOY #summary #xml #xpath
Processing XPath queries with XML summaries (TE, MO, MY), pp. 223–224.
CIKMCIKM-2005-FengAAS #ranking #scalability
Scalable ranking for preference queries (YF, DA, AEA, AKS), pp. 313–314.
CIKMCIKM-2005-FonsecaGPRZ #concept #interactive
Concept-based interactive query expansion (BMF, PBG, BP, BARN, NZ), pp. 696–703.
CIKMCIKM-2005-GrecoS #complexity #consistency #integration #on the #peer-to-peer
On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems (GG, FS), pp. 36–43.
CIKMCIKM-2005-GriecoLRR #algorithm #consistency #dependence
Consistent query answering under key and exclusion dependencies: algorithms and experiments (LG, DL, RR, MR), pp. 792–799.
CIKMCIKM-2005-KampsMRS #retrieval #xml
Structured queries in XML retrieval (JK, MM, MdR, BS), pp. 4–11.
CIKMCIKM-2005-KoloniariPPT #using
Query workload-aware overlay construction using histograms (GK, YP, EP, TT), pp. 640–647.
CIKMCIKM-2005-LianCNOA #locality #network
Localized routing trees for query processing in sensor networks (JL, LC, KN, MTÖ, GBA), pp. 259–260.
CIKMCIKM-2005-LiuLYMFG #database #intranet #natural language
Database selection in intranet mediators for natural language queries (FL, SL, CTY, WM, OF, DAG), pp. 229–230.
CIKMCIKM-2005-LiuYM #ambiguity #word
Word sense disambiguation in queries (SL, CTY, WM), pp. 525–532.
CIKMCIKM-2005-MasonL #complexity #named #relational #sql
INFER: a relational query language without the complexity of SQL (TM, RL), pp. 241–242.
CIKMCIKM-2005-MohanSW #approach #data access #xml
Access control for XML: a dynamic query rewriting approach (SM, AS, YW), pp. 251–252.
CIKMCIKM-2005-MouzaRS #evaluation #performance
Efficient evaluation of parameterized pattern queries (CdM, PR, MS), pp. 728–735.
CIKMCIKM-2005-Polyzotis #clustering #effectiveness #optimisation #paradigm
Selectivity-based partitioning: a divide-and-union paradigm for effective query optimization (NP), pp. 720–727.
CIKMCIKM-2005-PossasZRM
Maximal termsets as a query structuring mechanism (BP, NZ, BARN, WMJ), pp. 287–288.
CIKMCIKM-2005-PrasadK #performance #sequence #using #xml
Efficient indexing and querying of XML data using modified Prüfer sequences (KHP, PSK), pp. 397–404.
CIKMCIKM-2005-PuM #equation #functional #specification
Typed functional query languages with equational specifications (KQP, AOM), pp. 233–234.
CIKMCIKM-2005-RoyMBR #automation #towards
Towards automatic association of relevant unstructured content with structured query results (PR, MKM, BB, SR), pp. 405–412.
CIKMCIKM-2005-SutherlandLJR #distributed #named #self
D-CAPE: distributed and self-tuned continuous query processing (TMS, BL, MJ, EAR), pp. 217–218.
CIKMCIKM-2005-TheodoratosDKG #data flow #semantics #using
Semantic querying of tree-structured data sources using partially specified tree patterns (DT, TD, AK, NHG), pp. 712–719.
CIKMCIKM-2005-ZhaoBG #mining #xml
Mining conserved XML query paths for dynamic-conscious caching (QZ, SSB, LG), pp. 219–220.
CIKMCIKM-2005-ZhouYOTZ #distributed #multi #optimisation
Optimizing continuous multijoin queries over distributed streams (YZ, YY, BCO, KLT, AZ), pp. 221–222.
ECIRECIR-2005-Baeza-Yates #mining #web
Applications of Web Query Mining (RABY), pp. 7–22.
ECIRECIR-2005-BalfeS #analysis #collaboration #similarity #web
An Analysis of Query Similarity in Collaborative Web Search (EB, BS), pp. 330–344.
ECIRECIR-2005-MishneR #retrieval #web
Boosting Web Retrieval Through Query Operations (GM, MdR), pp. 502–516.
ECIRECIR-2005-MishneR05a
Query Formulation for Answer Projection (GM, MdR), pp. 523–526.
ECIRECIR-2005-SuomelaK #case study #concept #ontology
Ontology as a Search-Tool: A Study of Real Users’ Query Formulation With and Without Conceptual Support (SS, JK), pp. 315–329.
KDDKDD-2005-GoethalsHB #graph #mining
Mining tree queries in a graph (BG, EH, JVdB), pp. 61–69.
KDDKDD-2005-RadlinskiJ #feedback #learning #rank
Query chains: learning to rank from implicit feedback (FR, TJ), pp. 239–248.
SEKESEKE-2005-HuangLF #automation #email #mining
A Chinese Text Mining Application: An Automatic Answer Reply to Customers’ E-mail Queries Model (JYH, HML, CLF), pp. 504–507.
SIGIRSIGIR-2005-BadueBGRZ #web
Basic issues on the processing of web queries (CSB, RAB, PBG, BARN, NZ), pp. 577–578.
SIGIRSIGIR-2005-BeitzelJFGLCK #automation #classification #using #web
Automatic web query classification using labeled and unlabeled training data (SMB, ECJ, OF, DAG, DDL, AC, AK), pp. 581–582.
SIGIRSIGIR-2005-CraswellRZT #independence
Relevance weighting for query independent evidence (NC, SER, HZ, MJT), pp. 416–423.
SIGIRSIGIR-2005-Grivolla #approach #automation #documentation #natural language #retrieval #using
Using Oracle for natural language document retrieval an automatic query reformulation approach (JG), pp. 605–606.
SIGIRSIGIR-2005-HoenkampD05a #feedback #visual notation
Live visual relevance feedback for query formulation (EH, GvD), pp. 611–612.
SIGIRSIGIR-2005-JensenBGFC #learning #predict #visual notation #web
Predicting query difficulty on the web by learning visual clues (ECJ, SMB, DAG, OF, AC), pp. 615–616.
SIGIRSIGIR-2005-KellyDF #independence
The loquacious user: a document-independent source of terms for query expansion (DK, VDD, XF), pp. 457–464.
SIGIRSIGIR-2005-LiangDT #order #summary #using
Using query term order for result summarisation (SFL, SD, JT), pp. 629–630.
SIGIRSIGIR-2005-StrohmanTC #optimisation
Optimization strategies for complex queries (TS, HRT, WBC), pp. 219–225.
SIGIRSIGIR-2005-TheobaldSW #incremental #performance #self
Efficient and self-tuning incremental query expansion for top-k query processing (MT, RS, GW), pp. 242–249.
SIGIRSIGIR-2005-WangWXFLML #detection
Detecting dominant locations from search queries (LW, CW, XX, JF, YL, WYM, YL), pp. 424–431.
SIGIRSIGIR-2005-Yom-TovFCD #detection #distributed #information retrieval #learning
Learning to estimate query difficulty: including applications to missing content detection and distributed information retrieval (EYT, SF, DC, AD), pp. 512–519.
SIGIRSIGIR-2005-ZhangHV #mining #web
Mining translations of OOV terms from the web through cross-lingual query expansion (YZ, FH, SV), pp. 669–670.
ECMFAECMDA-FA-2005-SteinHU #modelling #on the
On Relationships Between Query Models (DS, SH, RU), pp. 254–268.
OOPSLAOOPSLA-2005-GoldsmithOA #relational
Relational queries over program traces (SG, RO, AA), pp. 385–402.
OOPSLAOOPSLA-2005-MartinLL #fault #security #using
Finding application errors and security flaws using PQL: a program query language (MCM, VBL, MSL), pp. 365–383.
PADLPADL-2005-BenzakenCM #paradigm #xml
A Full Pattern-Based Paradigm for XML Query Processing (VB, GC, CM), pp. 235–252.
ASEASE-2005-ZhangC #performance
Efficient temporal-logic query checking for presburger systems (DZ, RC), pp. 24–33.
ICSEICSE-2005-CookR #execution #static typing
Safe query objects: statically typed objects as remotely executable queries (WRC, SR), pp. 97–106.
SACSAC-2005-Behrend #database #deduction #optimisation
Optimizing existential queries in stratifiable deductive databases (AB), pp. 623–628.
SACSAC-2005-BuenoTT #algorithm #approximate #search-based #similarity #using
Accelerating approximate similarity queries using genetic algorithms (RB, AJMT, CTJ), pp. 617–622.
SACSAC-2005-ChenCG #biology #database
A complex biological database querying method (JYC, JVC, NG), pp. 110–114.
SACSAC-2005-GaoH
Location dependent query proxy (XG, ARH), pp. 1120–1124.
SACSAC-2005-LinZLY #performance #xml
Supporting efficient query processing on compressed XML files (YL, YZ, QL, JY), pp. 660–665.
SACSAC-2005-LiuC #knowledge-based #retrieval
Knowledge-based query expansion to support scenario-specific retrieval of medical free text (ZL, WWC), pp. 1076–1083.
SACSAC-2005-LiuSC #distributed #low cost #nondeterminism
Cost-efficient processing of MIN/MAX queries over distributed sensors with uncertainty (ZL, KCS, JC), pp. 634–641.
SACSAC-2005-MaG #detection #information retrieval
Query length impact on misuse detection in information retrieval systems (LM, NG), pp. 1070–1075.
SACSAC-2005-PowerSPS
Protecting sensitive patient data via query modification (DJP, MS, EAP, ACS), pp. 224–230.
SACSAC-2005-RaposoPAV #automation #maintenance #using #web
Automatic wrapper maintenance for semi-structured web sources using results from previous queries (JR, AP, , ÁV), pp. 654–659.
SACSAC-2005-StefanescuTT #distributed #evaluation
Distributed evaluation of generalized path queries (DCS, AT, LT), pp. 610–616.
SACSAC-2005-WojnickiL
Jelly view: a technology for arbitrarily advanced queries within RDBMS (IW, AL), pp. 629–633.
HPDCHPDC-2005-LiuPV #distributed #streaming
Distributed streaming query planner in Calder system (YL, BP, NNV), pp. 316–317.
STOCSTOC-2005-Ben-SassonS #complexity
Simple PCPs with poly-log rate and query complexity (EBS, MS), pp. 266–275.
STOCSTOC-2005-CicaleseL
A new strategy for querying priced information (FC, ESL), pp. 674–683.
STOCSTOC-2005-DvirS #polynomial #testing
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits (ZD, AS), pp. 592–601.
ICSTSAT-J-2004-BaulandCCHV05 #algebra #approach #complexity
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.
CSLCSL-2005-BenediktS #invariant #towards
Towards a Characterization of Order-Invariant Queries over Tame Structures (MB, LS), pp. 276–291.
ICLPICLP-2005-Bekes #optimisation
Optimizing Queries for Heterogeneous Information Sources (AGB), pp. 429–430.
ICLPICLP-2005-Ray #horn clause #logic
The Need for Ancestor Resolution When Answering Queries in Horn Clause Logic (OR), pp. 410–411.
ICLPICLP-2005-Wielemaker #implementation #prolog #semantics #web
An Optimised Semantic Web Query Language Implementation in Prolog (JW), pp. 128–142.
DocEngDocEng-2004-HuangCL #performance #retrieval
Fast structural query with application to chinese treebank sentence retrieval (CHH, TRC, HML), pp. 11–20.
DocEngDocEng-2004-ZhangT #documentation #xml
Querying XML documents by dynamic shredding (HZ, FWT), pp. 21–30.
TPDLECDL-2004-FuGFS #collaboration #information retrieval
Collaborative Querying for Enhanced Information Retrieval (LF, DHLG, SSBF, YS), pp. 378–388.
TPDLECDL-2004-KomarjayaPK #online
Corpus-Based Query Expansion in Online Public Access Catalogs (JK, DCCP, MYK), pp. 221–231.
JCDLJCDL-2004-Allen #interface
A query interface for an event gazetteer (RBA), pp. 72–73.
JCDLJCDL-2004-CunninghamBM #analysis #how #image #people #visual notation
How people describe their image information needs: a grounded theory analysis of visual arts queries (SJC, DB, MM), pp. 47–48.
JCDLJCDL-2004-GoncalvesFKCLSR #automation #effectiveness #library
The effectiveness of automatically structured queries in digital libraries (MAG, EAF, AK, PC, AHFL, ASdS, BARN), pp. 98–107.
JCDLJCDL-2004-WangTCLC #approach #library #using
Translating unknown cross-lingual queries in digital libraries using a web-based approach (JHW, JWT, PJC, WHL, LFC), pp. 108–116.
PODSPODS-2004-ArenasBLF #consistency
Locally Consistent Transformations and Query Answering in Data Exchange (MA, PB, RF, LL), pp. 229–240.
PODSPODS-2004-AtseriasDK #morphism #on the
On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.
PODSPODS-2004-Bonatti #datalog #decidability #on the #recursion
On the Decidability of Containment of Recursive Datalog Queries — Preliminary report (PAB), pp. 297–306.
PODSPODS-2004-GottlobKS
Conjunctive Queries over Trees (GG, CK, KUS), pp. 189–200.
PODSPODS-2004-GuptaKR
Roads, Codes and Spatiotemporal Queries (SG, SK, CVR), pp. 115–124.
PODSPODS-2004-KaushikRC #optimisation #perspective
Synopses for Query Optimization: A Space-Complexity Perspective (RK, RR, VTC), pp. 201–209.
PODSPODS-2004-NashL #data access #first-order
Processing First-Order Queries under Limited Access Patterns (AN, BL), pp. 307–318.
PODSPODS-2004-ScarcelloGL
Weighted Hypertree Decompositions and Optimal Query Plans (FS, GG, NL), pp. 210–221.
SIGMODSIGMOD-2004-AbiteboulBCMMP #evaluation #lazy evaluation #xml
Lazy Query Evaluation for Active XML (SA, OB, BC, IM, TM, NP), pp. 227–238.
SIGMODSIGMOD-2004-Amer-YahiaLP #flexibility #named #xml
FleXPath: Flexible Structure and Full-Text Querying for XML (SAY, LVSL, SP), pp. 83–94.
SIGMODSIGMOD-2004-AyadN #infinity #optimisation
Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams (AA, JFN), pp. 419–430.
SIGMODSIGMOD-2004-BabuW #adaptation #named
StreaMon: An Adaptive Engine for Stream Query Processing (SB, JW), pp. 931–932.
SIGMODSIGMOD-2004-BowmanS #optimisation #semantics #using
Optimization of Query Streams Using Semantic Prefetching (ITB, KS), pp. 179–190.
SIGMODSIGMOD-2004-BrunoC #statistics
Conditional Selectivity for Statistics on Query Expressions (NB, SC), pp. 311–322.
SIGMODSIGMOD-2004-ChakrabartiCH #automation #categorisation
Automatic Categorization of Query Results (KC, SC, SwH), pp. 755–766.
SIGMODSIGMOD-2004-ChaudhuriNR #sql
Estimating Progress of Long Running SQL Queries (SC, VRN, RR), pp. 803–814.
SIGMODSIGMOD-2004-ChunRHHJLMRSS
Querying at Internet-Scale (BNC, JMH, RH, SRJ, BTL, SM, TR, SCR, SS, IS), pp. 935–936.
SIGMODSIGMOD-2004-FanCG #security #xml
Secure XML Querying with Security Views (WF, CYC, MNG), pp. 587–598.
SIGMODSIGMOD-2004-Galindo-LegariaSW #sql
Query Processing for SQL Updates (CAGL, SS, FW), pp. 844–849.
SIGMODSIGMOD-2004-GargRC #monitoring #named #web
Web-CAM: Monitoring the dynamic Web to respond to Continual Queries (SG, KR, SC), pp. 927–928.
SIGMODSIGMOD-2004-GryzGLZ #database
Query Sampling in DB2 Universal Database (JG, JG, LL, CZ), pp. 839–843.
SIGMODSIGMOD-2004-HeZC #integration #interface #web
Knocking the Door to the Deep Web: Integration of Web Query Interfaces (BH, ZZ, KCCC), pp. 913–914.
SIGMODSIGMOD-2004-HuangHLLSL #named
ITQS: An Integrated Transport Query System (BH, ZH, DL, HL, YS, HL), pp. 951–952.
SIGMODSIGMOD-2004-HungDS #named #ontology #similarity
TOSS: An Extension of TAX with Ontologies and Similarity Queries (EH, YD, VSS), pp. 719–730.
SIGMODSIGMOD-2004-IdreosKT #ad hoc #named #network
P2P-DIET: An Extensible P2P Service that Unifies Ad-hoc and Continuous Querying in Super-Peer Networks (SI, MK, CT), pp. 933–934.
SIGMODSIGMOD-2004-IlyasSAVE #optimisation
Rank-aware Query Optimization (IFI, RS, WGA, JSV, AKE), pp. 203–214.
SIGMODSIGMOD-2004-IvesHW #adaptation #integration
Adapting to Source Properties in Processing Data Integration Queries (ZGI, AYH, DSW), pp. 395–406.
SIGMODSIGMOD-2004-JiangLW #performance
Efficient Processing of Twig Queries with OR-Predicates (HJ, HL, WW), pp. 59–70.
SIGMODSIGMOD-2004-LuoNEW #database #towards
Toward a Progress Indicator for Database Queries (GL, JFN, CJE, MW), pp. 791–802.
SIGMODSIGMOD-2004-MarklRSLP #optimisation #robust
Robust Query Processing through Progressive Optimization (VM, VR, DES, GML, HP), pp. 659–670.
SIGMODSIGMOD-2004-MengJCW #framework #named
XSeq: An Index Infrastructure for Tree Pattern Queries (XM, YJ, YC, HW), pp. 941–942.
SIGMODSIGMOD-2004-MokbelXA #database #incremental #named #scalability
SINA: Scalable Incremental Processing of Continuous Queries in Spatio-temporal Databases (MFM, XX, WGA), pp. 623–634.
SIGMODSIGMOD-2004-PolyzotisGI #approximate #xml
Approximate XML Query Answers (NP, MNG, YEI), pp. 263–274.
SIGMODSIGMOD-2004-RizviMSR #data access #fine-grained
Extending Query Rewriting Techniques for Fine-Grained Access Control (SR, AOM, SS, PR), pp. 551–562.
SIGMODSIGMOD-2004-TatarinovH #data transformation #performance
Efficient Query Reformulation in Peer-Data Management Systems (IT, AYH), pp. 539–550.
SIGMODSIGMOD-2004-VlachosMV #identification #online
Identifying Similarities, Periodicities and Bursts for Online Search Queries (MV, CM, ZV, DG), pp. 131–142.
SIGMODSIGMOD-2004-WuYDM #approach #clustering #interactive #interface #web
An Interactive Clustering-based Approach to Integrating Source Query interfaces on the Deep Web (WW, CTY, AD, WM), pp. 95–106.
SIGMODSIGMOD-2004-YuP #constraints #integration #xml
Constraint-Based XML Query Rewriting For Data Integration (CY, LP), pp. 371–382.
SIGMODSIGMOD-2004-ZhangHC #comprehension #interface #parsing #syntax #web
Understanding Web Query Interfaces: Best-Effort Parsing with Hidden Syntax (ZZ, BH, KCCC), pp. 107–118.
SIGMODSIGMOD-2004-ZhuRH #data type #migration
Dynamic Plan Migration for Continuous Queries Over Data Streams (YZ, EAR, GTH), pp. 431–442.
VLDBVLDB-2004-AhmadC #distributed
Networked Query Processing for Distributed Stream-Based Applications (YA, ), pp. 456–467.
VLDBVLDB-2004-BainaBPTRRH #community #framework #named
WS-CatalogNet: An Infrastructure for Creating, Peering, and Querying e-Catalog Communities (KB, BB, HYP, FT, CR, AR, BH), pp. 1325–1328.
VLDBVLDB-2004-BalkeG #database #multi
Multi-objective Query Processing for Database Systems (WTB, UG), pp. 936–947.
VLDBVLDB-2004-BalminOBCP #framework #using #xml #xpath
A Framework for Using Materialized XPath Views in XML Query Processing (AB, , KSB, RC, HP), pp. 60–71.
VLDBVLDB-2004-ChanFZ #xpath
Taming XPath Queries by Minimizing Wildcard Steps (CYC, WF, YZ), pp. 156–167.
VLDBVLDB-2004-ChaudhuriDHW #database #probability #ranking
Probabilistic Ranking of Database Query Results (SC, GD, VH, GW), pp. 888–899.
VLDBVLDB-2004-ChengXPSV #nondeterminism #performance #probability
Efficient Indexing Methods for Probabilistic Threshold Queries over Uncertain Data (RC, YX, SP, RS, JSV), pp. 876–887.
VLDBVLDB-2004-DalviS #database #evaluation #performance #probability
Efficient Query Evaluation on Probabilistic Databases (NND, DS), pp. 864–875.
VLDBVLDB-2004-DeshpandeH #adaptation
Lifting the Burden of History from Adaptive Query Processing (AD, JMH), pp. 948–959.
VLDBVLDB-2004-DongHT #xml
Containment of Nested XML Queries (XD, AYH, IT), pp. 132–143.
VLDBVLDB-2004-FranconiKLZ #database
Queries and Updates in the coDB Peer to Peer Database System (EF, GMK, AL, IZ), pp. 1277–1280.
VLDBVLDB-2004-HoreMT #privacy
A Privacy-Preserving Index for Range Queries (BH, SM, GT), pp. 720–731.
VLDBVLDB-2004-IwerksSS #maintenance
Maintenance of Spatial Semijoin Queries on Moving Points (GSI, HS, KPS), pp. 828–839.
VLDBVLDB-2004-JensenLO #performance
Query and Update Efficient B+-Tree Based Indexing of Moving Objects (CSJ, DL, BCO), pp. 768–779.
VLDBVLDB-2004-KementsietsidisA
Data Sharing Through Query Translation in Autonomous Sources (AK, MA), pp. 468–479.
VLDBVLDB-2004-KochSSS #data type #scheduling
Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams (CK, SS, NS, BS), pp. 228–239.
VLDBVLDB-2004-KoudasOT0 #approximate #bound #fault #performance
Approximate NN queries on Streams with Guaranteed Error/performance Bounds (NK, BCO, KLT, RZ), pp. 804–815.
VLDBVLDB-2004-KrishnamurthyKN #performance #question
Efficient XML-to-SQL Query Translation: Where to Add the Intelligence? (RK, RK, JFN), pp. 144–155.
VLDBVLDB-2004-KrishnaprasadLMWAK #xml
Query Rewrite for XML in Oracle XML DB (MK, ZHL, AM, JWW, VA, SK), pp. 1122–1133.
VLDBVLDB-2004-LakshmananRWZ #on the #satisfiability #testing
On Testing Satisfiability of Tree Pattern Queries (LVSL, GR, WHW, Z(Z), pp. 120–131.
VLDBVLDB-2004-LawWZ #data type #database #modelling #sequence
Query Languages and Data Models for Database Sequences and Data Streams (YNL, HW, CZ), pp. 492–503.
VLDBVLDB-2004-LooHHSS
Enhancing P2P File-Sharing with an Internet-Scale Query Processor (BTL, JMH, RH, SS, IS), pp. 432–443.
VLDBVLDB-2004-MokbelXAHPH #data type #named #realtime
PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams (MFM, XX, WGA, SEH, SP, MAH), pp. 1377–1380.
VLDBVLDB-2004-Poess #benchmark #generative #metric
Generating Thousand Benchmark Queries in Seconds (MP, JMS), pp. 1045–1053.
VLDBVLDB-2004-RundensteinerDSZPM #adaptation #named
CAPE: Continuous Query Engine with Heterogeneous-Grained Adaptivity (EAR, LD, TMS, YZ, BP, NKM), pp. 1353–1356.
VLDBVLDB-2004-SardaH #optimisation
Green Query Optimization: Taming Query Optimization Overheads through Plan Recycling (PS, JRH), pp. 1333–1336.
VLDBVLDB-2004-SchmidtBL #data type #named
QStream: Deterministic Querying of Data Streams (SS, HB, WL), pp. 1365–1368.
VLDBVLDB-2004-SuRM #algebra #optimisation #semantics #xml #xquery
Semantic Query Optimization in an Automata-Algebra Combined XQuery Engine over XML Streams (HS, EAR, MM), pp. 1293–1296.
VLDBVLDB-2004-TajimaF #network #xpath
Answering XPath Queries over Networks by Sending Minimal Views (KT, YF), pp. 48–59.
VLDBVLDB-2004-TheobaldWS #evaluation #probability
Top-k Query Evaluation with Probabilistic Guarantees (MT, GW, RS), pp. 648–659.
VLDBVLDB-2004-WangWLM #database #web
Instance-based Schema Matching for Web Databases by Domain-specific Query Probing (JW, JRW, FHL, WYM), pp. 408–419.
PASTEPASTE-2004-Ezick #analysis #constraints
Resolving and applying constraint queries on context-sensitive analyses (JE), pp. 2–7.
ICALPICALP-2004-DurrHHM #complexity #graph #problem #quantum
Quantum Query Complexity of Some Graph Problems (CD, MH, PH, MM), pp. 481–493.
ICALPICALP-2004-Midrijanis #bound #polynomial #problem #quantum #set #similarity
A Polynomial Quantum Query Lower Bound for the Set Equality Problem (GM), pp. 996–1005.
ICALPICALP-2004-OstrovskyRS #commit #consistency #database #performance #proving
Efficient Consistency Proofs for Generalized Queries on a Committed Database (RO, CR, AS), pp. 1041–1053.
ICALPICALP-2004-SamerV #ltl
A Syntactic Characterization of Distributive LTL Queries (MS, HV), pp. 1099–1110.
RTARTA-2004-CarmeNT #automaton
Querying Unranked Trees with Stepwise Tree Automata (JC, JN, MT), pp. 105–118.
ICFPICFP-2004-ColazzoGMS #correctness #xml
Types for path correctness of XML queries (DC, GG, PM, CS), pp. 126–137.
ICEISICEIS-v1-2004-BaiHM #semantics #using
Improving View Selection in Query Rewriting Using Domain Semantics (QB, JH, MFM), pp. 177–183.
ICEISICEIS-v1-2004-FengMR #multi #performance #using
Improving Query Performance on OLAP-Data Using Enhanced Multidimensional Indices (YF, AM, HR), pp. 282–289.
ICEISICEIS-v1-2004-GroppeBB #documentation #performance #xml
Efficient Querying of Transformed XML Documents (SG, SB, GB), pp. 241–250.
ICEISICEIS-v4-2004-ChengB
Federated Mediators for Query Composite Answers (DC, NB), pp. 170–175.
CIKMCIKM-2004-ChomickiMS #consistency #using
Computing consistent query answers using conflict hypergraphs (JC, JM, SS), pp. 417–426.
CIKMCIKM-2004-Cronen-TownsendZC #framework
A framework for selective query expansion (SCT, YZ, WBC), pp. 236–237.
CIKMCIKM-2004-GedikWYL #adaptation
Motion adaptive indexing for moving continual queries over moving objects (BG, KLW, PSY, LL), pp. 427–436.
CIKMCIKM-2004-HeTC #approach #clustering #web
Organizing structured web sources by query schemas: a clustering approach (BH, TT, KCCC), pp. 22–31.
CIKMCIKM-2004-KnabeT #distributed
Processing search queries in a distributed environment (FK, DT), pp. 492–494.
CIKMCIKM-2004-LuoLLL #data access #fine-grained #named #runtime #xml
QFilter: fine-grained run-time XML access control via NFA-based query rewriting (BL, DL, WCL, PL), pp. 543–552.
CIKMCIKM-2004-MaSPZL #enterprise #named #rdf #resource management
RStar: an RDF storage and query system for enterprise resource management (LM, ZS, YP, LZ, TL), pp. 484–491.
CIKMCIKM-2004-MaZMS #framework #learning #similarity #using
A framework for refining similarity queries using learning techniques (YM, QZ, SM, DYS), pp. 158–159.
CIKMCIKM-2004-SigurbjornssonKR #xpath
Processing content-oriented XPath queries (BS, JK, MdR), pp. 371–380.
CIKMCIKM-2004-TakakiFI #analysis #documentation #retrieval #topic
Associative document retrieval by query subtopic analysis and its application to invalidity patent search (TT, AF, TI), pp. 399–405.
CIKMCIKM-2004-WuCY #performance
Interval query indexing for efficient stream processing (KLW, SKC, PSY), pp. 88–97.
CIKMCIKM-2004-ZouLC #using #xml
Using a compact tree to index and query XML data (QZ, SL, WWC), pp. 234–235.
ECIRECIR-2004-AmatiCR #robust
Query Difficulty, Robustness, and Selective Application of Query Expansion (GA, CC, GR), pp. 127–137.
ECIRECIR-2004-JohoSB #case study #concept #interactive
A Study of User Interaction with a Concept-Based Interactive Query Expansion Support Tool (HJ, MS, MB), pp. 42–56.
ICPRICPR-v2-2004-CinqueMN #library #named #ontology
OntoDoc: An Ontology-Based Query System for Digital Libraries (LC, AM, RN), pp. 671–674.
KDDKDD-2004-HeCH #approach #correlation #interface #mining #web
Discovering complex matchings across web query interfaces: a correlation mining approach (BH, KCCC, JH), pp. 148–157.
KDDKDD-2004-MamoulisCKHTC #mining
Mining, indexing, and querying historical spatiotemporal data (NM, HC, GK, MH, YT, DWC), pp. 236–245.
KDDKDD-2004-Muslea #machine learning #online
Machine learning for online query relaxation (IM), pp. 246–255.
KDDKDD-2004-YangLHG #mining #named #performance #xml
2PXMiner: an efficient two pass mining of frequent XML query patterns (LHY, MLL, WH, XG), pp. 731–736.
KRKR-2004-CalvaneseGLLR #what
What to Ask to a Peer: Ontolgoy-based Query Reformulation (DC, GDG, DL, ML, RR), pp. 469–478.
KRKR-2004-DohertySL #approximate #ontology
Approximative Query Techniques for Agents with Heterogeneous Ontologies and Perceptive Capabilities (PD, AS, WL), pp. 459–468.
SIGIRSIGIR-2004-BeitzelJCGF #analysis #scalability #topic #web
Hourly analysis of a very large topically categorized web query log (SMB, ECJ, AC, DAG, OF), pp. 321–328.
SIGIRSIGIR-2004-ChengTCWLC #corpus #information retrieval #web
Translating unknown queries with web corpora for cross-language information retrieval (PJC, JWT, RCC, JHW, WHL, LFC), pp. 146–153.
SIGIRSIGIR-2004-ChieuL #timeline
Query based event extraction along a timeline (HLC, YKL), pp. 425–432.
SIGIRSIGIR-2004-DiazJ #precise #predict #using
Using temporal profiles of queries for precision prediction (FD, RJ), pp. 18–24.
SIGIRSIGIR-2004-DumaisCSH
Implicit queries (IQ) for contextualized search (STD, EC, RS, EH), p. 594.
SIGIRSIGIR-2004-GeyCLC #documentation #multi
Geotemporal querying of multilingual documents (FCG, AC, RRL, KC), p. 596.
SIGIRSIGIR-2004-LiuCOH #automation #recognition
Automatic recognition of reading levels from user queries (XL, WBC, PO, DMH), pp. 548–549.
SIGIRSIGIR-2004-NemethST #automation #evaluation #interactive
Evaluation of the real and perceived value of automatic and interactive query expansion (YN, BS, MTM), pp. 526–527.
SIGIRSIGIR-2004-ZhangV04a #detection
Detection and translation of OOV terms prior to query time (YZ, PV), pp. 524–525.
UMLUML-2004-SteinHU #modelling
Query Models (DS, SH, RU), pp. 98–112.
ECOOPECOOP-2004-AliaCDHL #framework #java #middleware #persistent
A Middleware Framework for the Persistence and Querying of Java Objects (MA, SCB, PD, CH, AL), pp. 291–315.
PEPMPEPM-2004-BeyerCHJM #verification
Invited talk: the blast query language for software verification (DB, AC, TAH, RJ, RM), pp. 201–202.
PLDIPLDI-2004-LiuRYSH #parametricity
Parametric regular path queries (YAL, TR, FY, SDS, NH), pp. 219–230.
PPDPPPDP-2004-BeyerCHJM #verification
Invited talk: the blast query language for software verification (DB, AC, TAH, RJ, RM), pp. 1–2.
SASSAS-2004-BeyerCHJM #verification
The Blast Query Language for Software Verification. (DB, AC, TAH, RJ, RM), pp. 2–18.
ICSEICSE-2004-GouldSD #database #static analysis
Static Checking of Dynamically Generated Queries in Database Applications (CG, ZS, PTD), pp. 645–654.
SACSAC-2004-AtnafuCCB #image #similarity
Integrating similarity-based queries in image DBMSs (SA, RC, DC, LB), pp. 735–739.
SACSAC-2004-BergholzC #interface #learning #web
Learning query languages of Web interfaces (AB, BC), pp. 1114–1121.
SACSAC-2004-MassonRB #database #induction #optimisation #set #towards
Optimizing subset queries: a step towards SQL-based inductive databases for itemsets (CM, CR, JFB), pp. 535–539.
SACSAC-2004-OlteanuFB #data type #performance #xml
An efficient single-pass query evaluator for XML data streams (DO, TF, FB), pp. 627–631.
SACSAC-2004-QianSGP #distance #nearest neighbour #similarity
Similarity between Euclidean and cosine angle distance for nearest neighbor queries (GQ, SS, YG, SP), pp. 1232–1237.
SACSAC-2004-Tosun #clustering
Replicated declustering for arbitrary queries (AST), pp. 748–753.
DATEDATE-v2-2004-PisharathCK #approach #database #execution #in memory
Data Windows: A Data-Centric Approach for Query Execution in Memory-Resident Databases (JP, ANC, MTK), pp. 1352–1353.
HPDCHPDC-2004-WeinbergJDFH #execution #matrix #using
Gridflow Description, Query, and Execution at SCEC using the SDSC Matrix (JW, AJ, AD, MF, YH), pp. 262–263.
STOCSTOC-2004-SanthaS #quantum
Quantum and classical query complexities of local search are polynomially related (MS, MS), pp. 494–501.
ICLPICLP-2004-BryPS #evolution #logic programming #programming language #web
Xcerpt and XChange — Logic Programming Languages for Querying and Evolution on the Web (FB, PLP, SS), pp. 450–451.
ICLPICLP-2004-TronconJV #compilation #control flow #evaluation #lazy evaluation #performance
Fast Query Evaluation with (Lazy) Control Flow Compilation (RT, GJ, HV), pp. 240–253.
SATSAT-2004-BaulandCCHV #algebra #approach #complexity
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 181–190.
TPDLECDL-2003-YorkWC #case study #challenge #library
Structure-Aware Query for Digital Libraries: Use Cases and Challenges for the Humanities (CY, CEW, GRC), pp. 188–193.
ICDARICDAR-2003-EglinB #classification #documentation #layout #similarity #visual notation
Document page similarity based on layout visual saliency: Application to query by example and document classification (VE, SB), pp. 1208–1212.
JCDLJCDL-2003-LiuLNG #metadata #on the
On Querying Geospatial and Georeferenced Metadata Resources in G-Portal (ZL, EPL, WKN, DHLG), pp. 245–255.
JCDLJCDL-2003-RoweRS #3d #analysis #library #representation
Acquisition, Representation, Query and Analysis of Spatial Data: A Demonstration 3D Digital Library (JR, AR, AS), pp. 147–158.
PODSPODS-2003-Behrend #database #deduction #evaluation #set
Soft stratification for magic set based query evaluation in deductive databases (AB), pp. 102–110.
PODSPODS-2003-CaliLR #complexity #consistency #database #decidability #on the #semistructured data
On the decidability and complexity of query answering over inconsistent and incomplete databases (AC, DL, RR), pp. 260–271.
PODSPODS-2003-CalvaneseGLV
View-based query containment (DC, GDG, ML, MYV), pp. 56–67.
PODSPODS-2003-ChirkovaL
Materializing views with minimal size to answer queries (RC, CL), pp. 38–48.
PODSPODS-2003-GottlobKP #complexity #evaluation #xpath
The complexity of XPath query evaluation (GG, CK, RP), pp. 179–190.
PODSPODS-2003-GrahneT #constraints #using
Query containment and rewriting using views for regular path queries under constraints (GG, AT), pp. 111–122.
PODSPODS-2003-Segoufin #bound #complexity #documentation #type system #xml
Typing and querying XML documents: some complexity bounds (LS), pp. 167–178.
PODSPODS-2003-SeidlSM #documentation
Numerical document queries (HS, TS, AM), pp. 155–166.
SIGMODSIGMOD-2003-Al-KhalifaYJ #database #xml
Querying Structured Text in an XML Database (SAK, CY, HVJ), pp. 4–15.
SIGMODSIGMOD-2003-BabcockCD #approximate
Dynamic Sample Selection for Approximate Query Processing (BB, SC, GD), pp. 539–550.
SIGMODSIGMOD-2003-Bierman #analysis #semantics
Formal semantics and analysis of object queries (GMB), pp. 407–418.
SIGMODSIGMOD-2003-Chamberlin #named #xml #xquery
XQuery: A Query Language for XML (DDC), p. 682.
SIGMODSIGMOD-2003-ChaudhuriGS
Factorizing Complex Predicates in Queries to Exploit Indexes (SC, PG, SS), pp. 361–372.
SIGMODSIGMOD-2003-ChengKP #probability
Evaluating Probabilistic Queries over Imprecise Data (RC, DVK, SP), pp. 551–562.
SIGMODSIGMOD-2003-ChoALS #named #xml
LockX: A System for Efficiently Querying Secure XML (SC, SAY, LVSL, DS), p. 669.
SIGMODSIGMOD-2003-GuptaS #xpath
Stream Processing of XPath Queries with Predicates (AKG, DS), pp. 419–430.
SIGMODSIGMOD-2003-HeC #interface #statistics #web
Statistical Schema Matching across Web Query Interfaces (BH, KCCC), pp. 217–228.
SIGMODSIGMOD-2003-IlyasRLGL #compilation
Estimating Compilation Time of a Query Optimizer (IFI, JR, GML, DG, ETL), pp. 373–384.
SIGMODSIGMOD-2003-MaddenFHH #design #network
The Design of an Acquisitional Query Processor For Sensor Networks (SM, MJF, JMH, WH), pp. 491–502.
SIGMODSIGMOD-2003-OlstonJW #adaptation #data type #distributed
Adaptive Filters for Continuous Queries over Distributed Data Streams (CO, JJ, JW), pp. 563–574.
SIGMODSIGMOD-2003-PapadiasTFS #algorithm
An Optimal and Progressive Algorithm for Skyline Queries (DP, YT, GF, BS), pp. 467–478.
SIGMODSIGMOD-2003-PaparizosACJLNPSWWY #named #xml
TIMBER: A Native System for Querying XML (SP, SAK, AC, HVJ, LVSL, AN, JMP, DS, NW, YW, CY), p. 672.
SIGMODSIGMOD-2003-PengC #streaming #xpath
XPath Queries on Streaming Data (FP, SSC), pp. 431–442.
SIGMODSIGMOD-2003-ReissK #optimisation #parametricity
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters (FR, TK), pp. 385–396.
SIGMODSIGMOD-2003-SengarH #named #optimisation
PLASTIC: Reducing Query Optimization Overheads through Plan Recycling (VSS, JRH), p. 676.
SIGMODSIGMOD-2003-WangPFY #named #xml
ViST: A Dynamic Index Method for Querying XML Data by Tree Structures (HW, SP, WF, PSY), pp. 110–121.
SIGMODSIGMOD-2003-ZhangZPTL
Location-based Spatial Queries (JZ, MZ, DP, YT, DLL), pp. 443–454.
SIGMODSIGMOD-2003-ZhuS
Warping Indexes with Envelope Transforms for Query by Humming (YZ, DS), pp. 181–192.
SIGMODSIGMOD-2003-ZhuSZ
Query by Humming — in Action with its Technology Revealed (YZ, DS, XZ), p. 675.
VLDBVLDB-2003-AnciauxBP #execution #memory management #requirements
Memory Requirements for Query Execution in Highly Constrained Devices (NA, LB, PP), pp. 694–705.
VLDBVLDB-2003-ArionBCDMP #named #xml
Xquec: Pushing Queries to Compressed XML Data (AA, AB, GC, SD, IM, AP), pp. 1065–1068.
VLDBVLDB-2003-BergerBSW #semistructured data #visual notation #xml
Xcerpt and visXcerpt: From Pattern-Based to Visual Querying of XML and Semistructured Data (SB, FB, SS, CW), pp. 1053–1056.
VLDBVLDB-2003-BhattacharjeePMLCH #clustering #multi #performance
Efficient Query Processing for Multi-Dimensionally Clustered Tables in DB2 (BB, SP, TM, TL, LC, MH), pp. 963–974.
VLDBVLDB-2003-DiaoF #xml
Query Processing for High-Volume XML Message Brokering (YD, MJF), pp. 261–272.
VLDBVLDB-2003-FlescaFM #on the #xpath
On the minimization of Xpath queries (SF, FF, EM), pp. 153–164.
VLDBVLDB-2003-GaoS #evaluation #slicing #xml
Temporal Slicing in the Evaluation of XML Queries (DG, RTS), pp. 632–643.
VLDBVLDB-2003-GolabO #data type #multi
Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams (LG, MTÖ), pp. 500–511.
VLDBVLDB-2003-HalversonBKKRTVWND #xml
Mixed Mode XML Query Processing (AH, JB, LG, AK, RK, ANR, FT, SV, YW, JFN, DJD), pp. 225–236.
VLDBVLDB-2003-HuebschHLLSS #internet
Querying the Internet with PIER (RH, JMH, NL, BTL, SS, IS), pp. 321–332.
VLDBVLDB-2003-HulgeriS #cost analysis #named #optimisation #parametricity
AniPQO: Almost Non-intrusive Parametric Query Optimization for Nonlinear Cost Functions (AH, SS), pp. 766–777.
VLDBVLDB-2003-IlyasAE #database #relational
Supporting Top-k Join Queries in Relational Databases (IFI, WGA, AKE), pp. 754–765.
VLDBVLDB-2003-IwerksSS #nearest neighbour
Continuous K-Nearest Neighbor Queries for Continuously Moving Points with Updates (GSI, HS, KPS), pp. 512–523.
VLDBVLDB-2003-Koch #approach #performance #xml
Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage: A Tree Automata-based Approach (CK), pp. 249–260.
VLDBVLDB-2003-KochBG #xml
Path Queries on Compressed XML (PB, MG, CK), pp. 141–152.
VLDBVLDB-2003-KoudasGGSV #approximate #constraints #optimisation #parametricity #performance
Efficient Approximation Of Optimization Queries Under Parametric Aggregation Constraints (SG, DG, NK, DS, MV), pp. 778–789.
VLDBVLDB-2003-KoudasS #data type #tutorial
Data Stream Query Processing: A Tutorial (NK, DS), p. 1149.
VLDBVLDB-2003-LernerS #named #optimisation #order
AQuery: Query Language for Ordered Data, Optimization Techniques, and Experiments (AL, DS), pp. 345–356.
VLDBVLDB-2003-LongS #execution #scalability
Optimized Query Execution in Large Search Engines with Global Page Ordering (XL, TS), pp. 129–140.
VLDBVLDB-2003-PapadiasTS #predict
The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries (YT, DP, JS), pp. 790–801.
VLDBVLDB-2003-PapadiasZMT #database #network
Query Processing in Spatial Network Databases (DP, JZ, NM, YT), pp. 802–813.
VLDBVLDB-2003-RaghavanG #repository #web
Complex Queries over Web Repositories (SR, HGM), pp. 33–44.
VLDBVLDB-2003-Ramanan #bisimulation #simulation #xml
Covering Indexes for XML Queries: Bisimulation — Simulation = Negation (PR), pp. 165–176.
VLDBVLDB-2003-ViglasNB #multi #streaming
Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources (SV, JFN, JB), pp. 285–296.
VLDBVLDB-2003-WangC
Avoiding Ordering and Grouping In Query Processing (XW, MC), pp. 826–837.
VLDBVLDB-2003-YangLH #mining #performance #xml
Efficient Mining of XML Query Patterns for Caching (LHY, MLL, WH), pp. 69–80.
VLDBVLDB-2003-YuPM #distributed
Distributed Top-N Query Processing with Possibly Uncooperative Local Systems (CTY, GP, WM), pp. 117–128.
WCREWCRE-2003-BeyerNL #performance #relational
Simple and Efficient Relational Querying of Software Structures (DB, AN, CL), pp. 216–225.
CAiSECAiSE-2003-GalanisWJD #peer-to-peer #scalability
Processing Queries in a Large Peer-to-Peer System (LG, YW, SRJ, DJD), pp. 273–288.
CAiSECAiSE-2003-Stojanovic #on the #ontology #refinement
On the Query Refinement in the Ontology-Based Searching for Information (NS), pp. 324–339.
CAiSECAiSE-2003-WangL #optimisation
Query Processing and Optimization for Regular Path Expressions (GW, ML), pp. 30–45.
EDOCEDOC-2003-HearndenRS #named #ocl
MQL: a Powerful Extension to OCL for MOF Queries (DH, KR, JS), pp. 264–277.
ICEISICEIS-v1-2003-LeopoldP #distributed #enterprise #framework #named
CQServer: An Example of Applying a Distributed Object Infrastructure for Heterogeneous Enterprise Computation of Continual Queries (JLL, TP), pp. 313–320.
ICEISICEIS-v1-2003-MangisengiEHW #xml
XML-Based OLAP Query Processing in a Federated Data Warehouses (OM, WE, JH, ERW), pp. 71–78.
ICEISICEIS-v1-2003-MontesiT
Imprecision Based Queries Over Materialized and Virtual Integrated Views (DM, AT), pp. 407–413.
ICEISICEIS-v1-2003-Seriai #named #object-oriented #using
QUEROM: An Object-Oriented Model to Rewriting Query Using Views (AS), pp. 389–395.
ICEISICEIS-v1-2003-ZhuHH #cost analysis #modelling #multi #optimisation
Global Query Optimization Based on Multistate Cost Models for a Dynamic Multidatabase System (QZ, JH, WCH), pp. 144–155.
ICEISICEIS-v2-2003-KrolikowskiMP #data mining #mining
Set-Oriented Indexes for Data Mining Queries (ZK, MM, JP), pp. 316–323.
ICEISICEIS-v3-2003-CaveroMVC #modelling #uml #using
Modelling ORDB Queries Using UML (JMC, EM, BV, CC), pp. 535–539.
CIKMCIKM-2003-BillerbeckSWZ #using
Query expansion using associated queries (BB, FS, HEW, JZ), pp. 2–9.
CIKMCIKM-2003-BroderCHSZ #evaluation #performance #process #retrieval #using
Efficient query evaluation using a two-level retrieval process (AZB, DC, MH, AS, JYZ), pp. 426–434.
CIKMCIKM-2003-GravanoHL #categorisation #locality #web
Categorizing web queries according to geographical locality (LG, VH, RL), pp. 325–333.
CIKMCIKM-2003-NallapatiCA #feedback #modelling #statistics
Relevant query feedback in statistical language modeling (RN, WBC, JA), pp. 560–563.
CIKMCIKM-2003-SinghFT #nearest neighbour
High dimensional reverse nearest neighbor queries (AS, HF, AST), pp. 91–98.
CIKMCIKM-2003-SrikanthS #approach #information retrieval #modelling
Exploiting syntactic structure of queries in a language modeling approach to IR (MS, RKS), pp. 476–483.
CIKMCIKM-2003-TaoFP #estimation #multi
The power-method: a comprehensive estimation technique for multi-dimensional queries (YT, CF, DP), pp. 83–90.
ECIRECIR-2003-DominichGS #case study #web
A Study of the Usefulness of Institutions’ Acronyms as Web Queries (SD, JG, AS), pp. 580–587.
ECIRECIR-2003-LosadaB #documentation #evaluation #logic #scalability
Propositional Logic Representations for Documents and Queries: A Large-Scale Evaluation (DEL, AB), pp. 219–234.
ICMLICML-2003-KubicaMCS #analysis #collaboration #graph #performance
Finding Underlying Connections: A Fast Graph-Based Method for Link Analysis and Collaboration Queries (JK, AWM, DC, JGS), pp. 392–399.
KDDKDD-2003-LiuLLY #on the
On computing, storing and querying frequent patterns (GL, HL, WL, JXY), pp. 607–612.
SEKESEKE-2003-WangZ #database #evolution #representation #xml
Representing and Querying the Evolution of Databases and their Schemas in XML (FW, CZ), pp. 33–38.
SIGIRSIGIR-2003-BelkinKKKLMTYC #information retrieval #interactive
Query length in interactive information retrieval (NJB, DK, GK, JYK, HJL, GM, MC(T, XJY, CC), pp. 205–212.
SIGIRSIGIR-2003-BillerbeckZ
When query expansion fails (BB, JZ), pp. 387–388.
SIGIRSIGIR-2003-DarwishO #probability
Probabilistic structured query methods (KD, DWO), pp. 338–344.
SIGIRSIGIR-2003-HeWON #interactive
User-assisted query translation for interactive CLIR (DH, JW, DWO, MN), p. 461.
SIGIRSIGIR-2003-JonesF #predict #word
Query word deletion prediction (RJ, DCF), pp. 435–436.
SIGIRSIGIR-2003-KangK #classification #documentation #retrieval #web
Query type classification for web document retrieval (IHK, GCK), pp. 64–71.
SIGIRSIGIR-2003-LevinCS #effectiveness
Assessing the effectiveness of pen-based input queries (SL, PDC, MS), pp. 437–438.
SIGIRSIGIR-2003-Ruthven #effectiveness #interactive
Re-examining the potential effectiveness of interactive query expansion (IR), pp. 213–220.
SIGIRSIGIR-2003-ShenZ #documentation #information retrieval #interactive #ranking
Exploiting query history for document ranking in interactive information retrieval (XS, CZ), pp. 377–378.
SIGIRSIGIR-2003-SrikanthS #dependence #documentation #modelling #retrieval
Incorporating query term dependencies in language models for document retrieval (MS, RKS), pp. 405–406.
SIGIRSIGIR-2003-YuJR #keyword #using #xml
Querying XML using structures and keywords in timber (CY, HVJ, DRR), p. 463.
PADLPADL-2003-BarceloB #consistency #database #logic programming #source code
Logic Programs for Querying Inconsistent Databases (PB, LEB), pp. 208–222.
PPDPPPDP-2003-GrecoZ #bound #datalog #on the #performance
On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.
ASEASE-2003-RenierisR #fault #locality #nearest neighbour
Fault Localization With Nearest Neighbor Queries (MR, SPR), pp. 30–39.
SACSAC-2003-HuangC #generative #replication
Broadcast Program Generation for Unordered Queries with Data Replication (JLH, MSC), pp. 866–870.
SACSAC-2003-PaquesLP #adaptation #distributed #trade-off
Distributed Query Adaptation and Its Trade-offs (HP, LL, CP), pp. 528–535.
SACSAC-2003-SchmidtMK #xml
Integrated Querying of XML Data in RDBMSs (AS, SM, MLK), pp. 509–514.
SACSAC-2003-ShapiroT #natural language #web
Constructing Web Search Queries from the User’s Information Need Expressed in a Natural Language (JS, IT), pp. 1157–1162.
STOCSTOC-2003-KowalikK #constant #graph
Short path queries in planar graphs in constant time (LK, MK), pp. 143–148.
STOCSTOC-2003-Thorup03a #performance
Space efficient dynamic stabbing with fast queries (MT), pp. 649–658.
CAVCAV-2003-ChechikG #logic #named
TLQSolver: A Temporal Logic Query Checker (MC, AG), pp. 210–214.
CSLCSL-2003-EiterM #abduction #generative
Generating All Abductive Explanations for Queries on Propositional Horn Theories (TE, KM), pp. 197–211.
CSLCSL-2003-GroheS #finite #monad
Comparing the Succinctness of Monadic Query Languages over Finite Trees (MG, NS), pp. 226–240.
CSLCSL-2003-SamerV #revisited
Validity of CTL Queries Revisited (MS, HV), pp. 470–483.
ICLPICLP-2003-EiterFGL #evaluation #integration #logic programming #performance #source code
Efficient Evaluation of Logic Programs for Querying Data Integration Systems (TE, MF, GG, DL), pp. 163–177.
LICSLICS-2003-FrickGK #evaluation
Query Evaluation on Compressed Trees (MF, MG, CK), p. 188–?.
LICSLICS-2003-LibkinN #logic
Logical Definability and Query Languages over Unranked Trees (LL, FN), pp. 178–187.
DocEngDocEng-2002-WongL #multi #xml
Managing and querying multi-version XML data with update logging (RKW, NL), pp. 74–81.
TPDLECDL-2002-CastelliMP #library #multi
Foundations of a Multidimensional Query Language for Digital Libraries (DC, CM, PP), pp. 251–265.
TPDLECDL-2002-Strotgen #metadata #semantics
Meta-data Extraction and Query Translation. Treatment of Semantic Heterogeneity (RS), pp. 362–373.
JCDLJCDL-2002-HuD #comparison #database #retrieval #using
A comparison of melodic database retrieval techniques using sung queries (NH, RBD), pp. 301–307.
JCDLJCDL-2002-ShifrinPMB #retrieval
HMM-based musical query retrieval (JS, BP, CM, WPB), pp. 295–300.
JCDLJCDL-2002-VieiraCSLR #database #keyword #web
Structuring keyword-based queries for web databases (RCV, PC, ASdS, AHFL, BARN), pp. 94–95.
PODSPODS-2002-AfratiLM #using
Answering Queries Using Views with Arithmetic Comparisons (FNA, CL, PM), pp. 209–220.
PODSPODS-2002-ArasuBBMW #data type #memory management #requirements
Characterizing Memory Requirements for Queries over Continuous Data Streams (AA, BB, SB, JM, JW), pp. 221–232.
PODSPODS-2002-CadoliM #compilation #synthesis
Knowledge Compilation = Query Rewriting + View Synthesis (MC, TM), pp. 199–208.
PODSPODS-2002-ChatterjiEGY #approximate #complexity #on the #optimisation
On the Complexity of Approximate Query Optimization (SC, SSKE, SG, MDY), pp. 282–292.
PODSPODS-2002-ChenC #clustering #multi
From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries (CMC, CTC), pp. 29–38.
PODSPODS-2002-Chirkova #bound #problem
The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views (RC), pp. 159–168.
PODSPODS-2002-ChuHG #optimisation #question #what
Least Expected Cost Query Optimization: What Can We Expect? (FCC, JYH, JG), pp. 293–302.
PODSPODS-2002-MokhtarSI #on the
On Moving Object Queries (HM, JS, OHI), pp. 188–198.
PODSPODS-2002-Neven #on the #power of
On the Power of Walking for Querying Tree-Structured Data (FN), pp. 77–84.
PODSPODS-2002-SchmidtS #how #multi
How to Evaluate Multiple Range-Sum Queries Progressively (RRS, CS), pp. 133–141.
PODSPODS-2002-SpielmannTB #automaton #distributed #using #web
Distributed Computation of Web Queries Using Automata (MS, JT, JVdB), pp. 97–108.
SIGMODSIGMOD-2002-AbadiC #debugging #development #visual notation
Visual COKO: a debugger for query optimizer development (DJA, MC), p. 617.
SIGMODSIGMOD-2002-BrunoC #optimisation #statistics
Exploiting statistics on query expressions for optimization (NB, SC), pp. 263–274.
SIGMODSIGMOD-2002-ChangH
Minimal probing: supporting expensive predicates for top-k queries (KCCC, SwH), pp. 346–357.
SIGMODSIGMOD-2002-ChenRW #named #semantics #xml
XCache: a semantic caching system for XML queries (LC, EAR, SW), p. 618.
SIGMODSIGMOD-2002-ChoiC #estimation
Selectivity estimation for spatio-temporal queries to moving objects (YJC, CWC), pp. 440–451.
SIGMODSIGMOD-2002-DobraGGR #data type
Processing complex aggregate queries over data streams (AD, MNG, JG, RR), pp. 61–72.
SIGMODSIGMOD-2002-GaoW #similarity #streaming
Continually evaluating similarity-based pattern queries on a streaming time series (LG, XSW), pp. 370–381.
SIGMODSIGMOD-2002-GarofalakisGR #data type #mining #tutorial
Querying and mining data streams: you only get one look a tutorial (MNG, JG, RR), p. 635.
SIGMODSIGMOD-2002-JosifovskiSHL #named
Garlic: a new flavor of federated query processing for DB2 (VJ, PMS, LMH, ETL), pp. 524–532.
SIGMODSIGMOD-2002-KaushikBNK #branch
Covering indexes for branching path queries (RK, PB, JFN, HFK), pp. 133–144.
SIGMODSIGMOD-2002-MaddenH #network #power management
Distributing queries over low-power wireless sensor networks (SM, JMH), p. 622.
SIGMODSIGMOD-2002-MaddenSHR #adaptation
Continuously adaptive continuous queries over streams (SM, MAS, JMH, VR), pp. 49–60.
SIGMODSIGMOD-2002-PapakonstantinouPV #named #semistructured data
QURSED: querying and reporting semistructured data (YP, MP, VV), pp. 192–203.
SIGMODSIGMOD-2002-Ramanan #algorithm #performance
Efficient algorithms for minimizing tree pattern queries (PR), pp. 299–309.
SIGMODSIGMOD-2002-RamanH #online
Partial results for online query processing (VR, JMH), pp. 275–286.
SIGMODSIGMOD-2002-TaoP #database
Time-parameterized queries in spatio-temporal databases (YT, DP), pp. 334–345.
SIGMODSIGMOD-2002-TatarinovVBSSZ #database #order #relational #using #xml
Storing and querying ordered XML using a relational database system (IT, SV, KSB, JS, EJS, CZ), pp. 204–215.
SIGMODSIGMOD-2002-ViglasN #optimisation #streaming
Rate-based query optimization for streaming information sources (SV, JFN), pp. 37–48.
SIGMODSIGMOD-2002-WangTYGWP #effectiveness #information management #integration #named #towards #web
COMMIX: towards effective web information extraction, integration and query answering (TW, ST, DY, JG, YW, JP), p. 620.
SIGMODSIGMOD-2002-ZadorozhnyRVUB #evaluation #performance
Efficient evaluation of queries in a mediator for WebSources (VZ, LR, MEV, TU, LB), pp. 85–96.
VLDBVLDB-2002-BohannonGKNS #optimisation
Optimizing View Queries in ROLEX to Support Navigable Result Trees (PB, SG, HFK, PPSN, PS), pp. 119–130.
VLDBVLDB-2002-ChandrasekaranF #streaming
Streaming Queries over Streaming Data (SC, MJF), pp. 203–214.
VLDBVLDB-2002-ChoALS #evaluation #optimisation
Optimizing the Secure Evaluation of Twig Queries (SC, SAY, LVSL, DS), pp. 490–501.
VLDBVLDB-2002-GarofalakisG #data type #mining
Querying and Mining Data Streams: You Only Get One Look (MNG, JG).
VLDBVLDB-2002-GhoshPSH #clustering
Plan Selection Based on Query Clustering (AG, JP, VSS, JRH), pp. 179–190.
VLDBVLDB-2002-GottlobKP #algorithm #performance #xpath
Efficient Algorithms for Processing XPath Queries (GG, CK, RP), pp. 95–106.
VLDBVLDB-2002-HulgeriS #cost analysis #linear #optimisation #parametricity
Parametric Query Optimization for Linear and Piecewise Linear Cost Functions (AH, SS), pp. 167–178.
VLDBVLDB-2002-KarayannidisTSPMRFEB #clustering
Processing Star Queries on Hierarchically-Clustered Fact Tables (NK, AT, TKS, RP, VM, FR, RF, KE, RB), pp. 730–741.
VLDBVLDB-2002-KossmannRR #algorithm #online
Shooting Stars in the Sky: An Online Algorithm for Skyline Queries (DK, FR, SR), pp. 275–286.
VLDBVLDB-2002-LudascherMP #transducer #xml
A Transducer-Based XML Query Processor (BL, PM, YP), pp. 227–238.
VLDBVLDB-2002-OhuraTPK #internet #mining #using #web
Experiments on Query Expansion for Internet Yellow Page Services Using Web Log Mining (YO, KT, IP, MK), pp. 1008–1018.
VLDBVLDB-2002-ParkMC #recursion #xml
Structural Function Inlining Technique for Structurally Recursive XML Queries (CWP, JKM, CWC), pp. 83–94.
ICALPICALP-2002-CardelliGG #graph #logic
A Spatial Logic for Querying Graphs (LC, PG, GG), pp. 597–610.
ICALPICALP-2002-CharikarIP #algorithm #orthogonal #problem #set
New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems (MC, PI, RP), pp. 451–462.
AFPAFP-2002-Wadler02 #functional #named #xml #xquery
XQuery: A Typed Functional Language for Querying XML (PW), pp. 188–212.
CAiSECAiSE-2002-CombiM #multi
Querying Data with Multiple Temporal Dimensions (CC, AM), pp. 711–714.
CAiSECAiSE-2002-DomenigD #data flow #semistructured data
Query Explorativeness for Integrated Search in Heterogeneous Data Sources (RD, KRD), pp. 715–718.
CAiSECAiSE-2002-FilhaSLE #representation #using #web
Using Nested Tables for Representing and Querying Semistructured Web Data (IMREF, ASdS, AHFL, DWE), pp. 719–723.
CAiSECAiSE-2002-SunL #algorithm #parallel
Parallel Query Processing Algorithms for Semi-structured Data (WS, KL), pp. 770–773.
ICEISICEIS-2002-CarrascoMG #data mining #flexibility #mining #named
FSQL: A Flexible Query Language for Data Mining (RAC, MAVM, JG), pp. 50–56.
ICEISICEIS-2002-JuniorVF #database #documentation #relational #xml
XML-Based Document to Query a Relational Database (WMdAJ, CV, AF), pp. 26–33.
ICEISICEIS-2002-PanMMARV
A Model for Advanced Query Capability Description in Mediator Systems (AP, PM, AM, , JR, ÁV), pp. 140–147.
ICEISICEIS-2002-TanL #approach
A Hierarchical Approach to Complex Data Cube Queries (RBNT, GL), pp. 187–194.
ICEISICEIS-2002-TariTD #adaptation #database #design
Designing an Object and Query Cache Management System for CODAR Database Adapter (ZT, AT, VD), pp. 290–295.
ICEISICEIS-2002-Veryha #classification #database #fuzzy #implementation #relational #using
Implementation of Fuzzy Classification Query Language in Relational Databases Using Stored Procedures (YV), pp. 195–202.
CIKMCIKM-2002-Al-KhalifaJ #multi #xml
Multi-level operator combination in XML query processing (SAK, HVJ), pp. 134–141.
CIKMCIKM-2002-BruzaS #data flow #modelling
Inferring query models by computing information flow (PB, DS), pp. 260–269.
CIKMCIKM-2002-CaladoSVLR #database #keyword #web
Searching web databases by structuring keyword-based queries (PC, ASdS, RCV, AHFL, BARN), pp. 26–33.
CIKMCIKM-2002-ChenCA #biology #database #evaluation #on the #performance
On the efficient evaluation of relaxed queries in biological databases (YC, DC, KA), pp. 227–236.
CIKMCIKM-2002-FegarasLBC #xml
Query processing of streamed XML data (LF, DL, SB, VC), pp. 126–133.
CIKMCIKM-2002-GaoYW #nearest neighbour #streaming
Evaluating continuous nearest neighbor queries for streaming time series via pre-fetching (LG, ZY, XSW), pp. 485–492.
CIKMCIKM-2002-LeeCHT #evaluation #multi #performance #streaming #xml
Efficient evaluation of multiple queries on streaming XML data (MLL, BCC, WH, KLT), pp. 118–125.
CIKMCIKM-2002-LiuYM #category theory #personalisation #web
Personalized web search by mapping user queries to categories (FL, CTY, WM), pp. 558–565.
CIKMCIKM-2002-LohLAL #analysis
Analysis of pre-computed partition top method for range top-k queries in OLAP data cubes (ZXL, TWL, CHA, SYL), pp. 60–67.
CIKMCIKM-2002-PaquesLP #adaptation #named #self
Ginga: a self-adaptive query processing system (HP, LL, CP), pp. 655–658.
CIKMCIKM-2002-ScholerW #effectiveness #retrieval
Query association for effective retrieval (FS, HEW), pp. 324–331.
CIKMCIKM-2002-SistlaHC #automaton #database #retrieval #sequence #similarity #using
Similarity based retrieval from sequence databases using automata as queries (APS, TH, VC), pp. 237–244.
CIKMCIKM-2002-WuY #adaptation #monitoring #multi #performance #using
Efficient query monitoring using adaptive multiple key hashing (KLW, PSY), pp. 477–484.
CIKMCIKM-2002-ZhuSI #database
Trajectory queries and octagons in moving object databases (HZ, JS, OHI), pp. 413–421.
ECIRECIR-2002-BoughanemT #case study #documentation #optimisation #retrieval #search-based #using
A Study on Using Genetic Niching for Query Optimisation in Document Retrieval (MB, LT), pp. 135–149.
ECIRECIR-2002-Sormunen #evaluation #interactive #performance
A Retrospective Evaluation Method for Exact-Match and Best-Match Queries Applying an Interactive Query Performance Analyser (ES), pp. 334–352.
ECIRECIR-2002-Vakkari
Subject Knowledge, Source of Terms, and Term Selection in Query Expansion: An Analytical Study (PV), pp. 110–123.
ICPRICPR-v2-2002-GiugnoS #graph #named #performance
GraphGrep: A Fast and Universal Method for Querying Graphs (RG, DS), pp. 112–115.
ICPRICPR-v3-2002-FauqueurB #detection #image
Coarse Detection and Fine Color Description for Region-Based Image Queries (JF, NB), pp. 1027–1034.
ICPRICPR-v3-2002-Sakano #how #learning #search-based
Genetic Translator: How to Apply Query Learning to Practical OCR (HS), pp. 184–187.
ICPRICPR-v4-2002-CinqueRLLT #image #retrieval #using
Image Retrieval Using Resegmentation Driven by Query Rectangles (LC, FDR, FL, SL, SLT), pp. 142–145.
KDDKDD-2002-StolteTH #analysis #using #visualisation
Query, analysis, and visualization of hierarchically structured data using Polaris (CS, DT, PH), pp. 112–122.
KDDKDD-2002-TuzhilinL #multi #set
Querying multiple sets of discovered rules (AT, BL), pp. 52–60.
KRKR-2002-CalmesDHPS #approach #flexibility #fuzzy
A Fuzzy Approach to Flexible Case-based Querying: Methodology and Experimentation (MdC, DD, EH, HP, FS), pp. 449–458.
SIGIRSIGIR-2002-AllanR #ambiguity #using
Using part-of-speech patterns to reduce query ambiguity (JA, HR), pp. 307–314.
SIGIRSIGIR-2002-BahleWZ #performance
Efficient phrase querying with an auxiliary index (DB, HEW, JZ), pp. 215–221.
SIGIRSIGIR-2002-CarmelFPS #automation #information management #refinement #using
Automatic query refinement using lexical affinities with maximal information gain (DC, EF, YP, AS), pp. 283–290.
SIGIRSIGIR-2002-Cronen-TownsendZC #performance #predict
Predicting query performance (SCT, YZ, WBC), pp. 299–306.
SIGIRSIGIR-2002-FedericoB #information retrieval #statistics #using
Statistical cross-language information retrieval using n-best query translations (MF, NB), pp. 167–174.
SIGIRSIGIR-2002-FengZP #approach #database #music #scalability
A hierarchical approach: query large music database by acoustic input (YF, YZ, YP), pp. 441–442.
SIGIRSIGIR-2002-GaoZNHC #ambiguity #dependence #using
Resolving query translation ambiguity using a decaying co-occurrence model and syntactic dependence relations (JG, MZ, JYN, HH, WC), pp. 183–190.
SIGIRSIGIR-2002-Hiemstra #approach #information retrieval #modelling
Term-specific smoothing for the language modeling approach to information retrieval: the importance of a query term (DH), pp. 35–41.
SIGIRSIGIR-2002-KeskustaloHA #framework
UTACLIR -: general query translation framework for several language pairs (HK, TH, EA), p. 448.
SIGIRSIGIR-2002-Kwok #precise
Higher precision for two-word queries (KLK), pp. 395–396.
SIGIRSIGIR-2002-McNameeM
Comparing cross-language query expansion techniques by degrading translation resources (PM, JM), pp. 159–166.
SIGIRSIGIR-2002-ScholerWYZ #evaluation #performance
Compression of inverted indexes for fast query evaluation (FS, HEW, JY, JZ), pp. 222–229.
SIGIRSIGIR-2002-Shalev-ShwartzDFS #modelling #robust
Robust temporal and spectral modeling for query By melody (SSS, SD, NF, YS), pp. 331–338.
SIGIRSIGIR-2002-SormunenHKPS #information retrieval #performance #research
Query performance analyser: a web-based tool for IR research and instruction (ES, SH, PK, PP, BS), p. 450.
SIGIRSIGIR-2002-VermaB #named #performance
K-tree/forest: efficient indexes for boolean queries (RMV, SB), pp. 433–434.
LOPSTRLOPSTR-2002-GrecoGTZ #optimisation #source code
Translating Datalog-Like Optimization Queries into ILOG Programs (GG, SG, IT, EZ), pp. 48–49.
RERE-2002-Cleland-HuangCSJHX #automation #requirements #traceability
Automating Speculative Queries through Event-Based Requirements Traceability (JCH, CKC, GS, KJ, HH, JX), pp. 289–298.
FSEFSE-2002-GurfinkelDC #logic
Model exploration with temporal logic query checking (AG, BD, MC), pp. 139–148.
SACSAC-2002-BordognaP #documentation #flexibility #web
Flexible querying of WEB documents (GB, GP), pp. 675–680.
SACSAC-2002-BoscDP #database
About possibilistic queries against possibilistic databases (PB, LD, OP), pp. 807–811.
SACSAC-2002-FerriPR #correctness #database #semantics
The syntactic and semantic correctness of pictorial configurations to query geographic databases by PQL (FF, EP, MR), pp. 432–437.
SACSAC-2002-HaratyH #database
Iterative querying in web-based database applications (RAH, MH), pp. 458–462.
SACSAC-2002-MorvanH #execution #memory management #parallel
Dynamic memory allocation strategies for parallel query execution (FM, AH), pp. 897–901.
SACSAC-2002-Norvag #database #xml
Temporal query operators in XML databases (KN), pp. 402–406.
SACSAC-2002-WangW #approach #data mining #mining #optimisation #relational
Optimizing relational store for e-catalog queries: a data mining approach (MW, XSW), pp. 1147–1152.
HPDCHPDC-2002-LaszewskiGPF #execution #grid #named
InfoGram: A Grid Service that Supports Both Information Queries and Job Execution (GvL, JG, CJP, ITF), pp. 333–342.
ICLPICLP-2002-BryS #declarative #model transformation #semistructured data #simulation #towards #transformation language #unification #xml
Towards a Declarative Query and Transformation Language for XML and Semistructured Data: Simulation Unification (FB, SS), pp. 255–270.
LICSLICS-2002-BenediktL #algebra #automaton #logic
Tree Extension Algebras: Logics, Automata, and Query Languages (MB, LL), p. 203–?.
LICSLICS-2002-GottlobK #monad
Monadic Queries over Tree-Structured Data (GG, CK), pp. 189–202.
SATSAT-2002-PrestwichB #approach #optimisation #satisfiability
A SAT approach to query optimization in mediator systems (SP, SB), p. 33.
DocEngDocEng-2001-Wong #database #scalability #xml
The extended XQL for querying and updating large XML databases (RKW), pp. 95–104.
JCDLJCDL-2001-AbdullaBCKLMTLS #ad hoc #approximate #simulation
Approximate ad-hoc query engine for simulation data (GA, CB, TC, RK, IL, RM, NAT, BSL, RRS), pp. 255–256.
JCDLJCDL-2001-YuSMQ #database #distributed #nearest neighbour
Database selection for processing k nearest neighbors queries in distributed environments (CTY, PS, WM, YQ), pp. 215–222.
PODSPODS-2001-AbiteboulSV #representation #xml
Representing and Querying XML with Incomplete Information (SA, LS, VV).
PODSPODS-2001-BenediktLSS #string
String Operations in Query Languages (MB, LL, TS, LS).
PODSPODS-2001-CohenNS
Equivalences among Aggregate Queries with Negation (SC, WN, YS).
PODSPODS-2001-Grohe #complexity #database
The Parameterized Complexity of Database Queries (MG), pp. 82–92.
PODSPODS-2001-JimS #distributed #evaluation
Dynamically Distributed Query Evaluation (TJ, DS).
PODSPODS-2001-KanzaS #flexibility #semistructured data
Flexible Queries Over Semistructured Data (YK, YS).
PODSPODS-2001-MendelzonM #data flow
Querying Partially Sound and Complete Data Sources (AOM, GAM).
PODSPODS-2001-PapadimitriouY #multi #optimisation
Multiobjective Query Optimization (CHP, MY).
PODSPODS-2001-RajaramanU #using
Querying Websites Using Compact Skeletons (AR, JDU).
PODSPODS-2001-SadriZZA #database #optimisation #sequence
Optimization of Sequence Queries in Database Systems (RS, CZ, AMZ, JA).
VLDBVLDB-2001-AgrawalSX #e-commerce
Storage and Querying of E-Commerce Data (RA, AS, YX), pp. 149–158.
VLDBVLDB-2001-BohmMSW #evaluation #performance #similarity
Fast Evaluation Techniques for Complex Similarity Queries (KB, MM, HJS, RW), pp. 211–220.
VLDBVLDB-2001-ChungCLL
Dynamic Update Cube for Range-sum Queries (SJC, CWC, JHL, SLL), pp. 521–530.
VLDBVLDB-2001-FegarasE #xml
Query Engines for Web-Accessible XML Data (LF, RE), pp. 251–260.
VLDBVLDB-2001-GarofalakisG #approximate
Approximate Query Processing: Taming the TeraBytes (MNG, PBG).
VLDBVLDB-2001-Gibbons
Distinct Sampling for Highly-Accurate Answers to Distinct Values Queries and Event Reports (PBG), pp. 541–550.
VLDBVLDB-2001-GilbertKMS #approximate #summary
Surfing Wavelets on Streams: One-Pass Summaries for Approximate Aggregate Queries (ACG, YK, SM, MS), pp. 79–88.
VLDBVLDB-2001-LiM #xml
Indexing and Querying XML Data for Regular Path Expressions (QL, BM), pp. 361–370.
VLDBVLDB-2001-ManolescuFK #data flow #semistructured data #xml
Answering XML Queries on Heterogeneous Data Sources (IM, DF, DK), pp. 241–250.
VLDBVLDB-2001-NatsevCSLV #incremental
Supporting Incremental Join Queries on Ranked Inputs (AN, YCC, JRS, CSL, JSV), pp. 281–290.
VLDBVLDB-2001-OzsuLON #database #image #multi #similarity
An Extendible Hash for Multi-Precision Similarity Querying of Image Databases (SL, MTÖ, VO, RTN), pp. 221–230.
VLDBVLDB-2001-PapadiasT #named
MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries (YT, DP), pp. 431–440.
VLDBVLDB-2001-SadriZZA #data mining #mining
A Sequential Pattern Query Language for Supporting Instant Data Mining for e-Services (RS, CZ, AMZ, JA), pp. 653–656.
VLDBVLDB-2001-SakuraiYKU #adaptation #similarity #using
Similarity Search for Adaptive Ellipsoid Queries Using Spatial Transformation (YS, MY, RK, SU), pp. 231–240.
VLDBVLDB-2001-SeegerBBKSDS #approach #database #implementation #library #named #performance
XXL — A Library Approach to Supporting Efficient Implementations of Advanced Database Queries (JVdB, BB, JPD, JK, TS, MS, BS), pp. 39–48.
VLDBVLDB-2001-ShanmugasundaramKSFF #relational #xml
Querying XML Views of Relational Data (JS, JK, EJS, CF, JEF), pp. 261–270.
VLDBVLDB-2001-UrhanF #interactive #performance #pipes and filters #scheduling
Dynamic Pipeline Scheduling for Improving Interactive Query Performance (TU, MJF), pp. 501–510.
VLDBVLDB-2001-WaasCB #approach #interactive #named #similarity
FeedbackBypass: A New Approach to Interactive Similarity Query Processing (IB, PC, FW), pp. 201–210.
VLDBVLDB-2001-WiesnerK #distributed #internet #named
Hyperqueries: Dynamic Distributed Query Processing on the Internet (AK, CW), pp. 551–560.
GT-VMTGT-VMT-2001-FlescaFG #graph grammar
Graph Grammars for Querying Graph-like Data (SF, FF, SG), pp. 247–256.
CAiSECAiSE-2001-ShaoLFEG #data-driven #design #source code
Querying Data-Intensive Programs for Data Design (JS, XL, GF, SME, WAG), pp. 203–218.
ICEISICEIS-v1-2001-BernardinoM
Data Warehouse Striping: Improved Query Response Time (JB, HM), pp. 122–129.
ICEISICEIS-v1-2001-HergulaBH
Supporting Query Processing across Application Systems (KH, GB, TH), pp. 110–115.
ICEISICEIS-v1-2001-ShahabiC #framework #image #retrieval
A Unified Framework to Incorporate Soft Query into Image Retrieval Systems (CS, YSC), pp. 216–224.
ICEISICEIS-v1-2001-TehZL #algorithm #automation
Automation Query Processing Selection Algorithms (YWT, ABZ, SPL), pp. 283–286.
CIKMCIKM-2001-BlokHCJBA #database #design #information retrieval #optimisation #predict #trade-off
Predicting the Cost-Quality Trade-Off for Information Retrieval Queries: Facilitating Database Design and Query Optimization (HEB, DH, SC, FdJ, HMB, PMGA), pp. 207–214.
CIKMCIKM-2001-BressanDLLLNW #benchmark #metric #named #xml
X007: Applying 007 Benchmark to XML Query Processing Tool (SB, GD, ZL, MLL, YGL, UN, BW), pp. 167–174.
CIKMCIKM-2001-CaiRJ #automation
Automatic Query Expansion Based on Divergence (DC, CJvR, JMJ), pp. 419–426.
CIKMCIKM-2001-FerhatosmanogluAA #performance
Efficient Processing of Conical Queries (HF, DA, AEA), pp. 1–8.
CIKMCIKM-2001-HaaseH #database
Exposing the Vagueness of Query Results on Partly Inaccessible Databases (OH, AH), pp. 49–56.
CIKMCIKM-2001-HergulaH #how #integration
How Foreign Function Integration Conquers Heterogeneous Query Processing (KH, TH), pp. 215–222.
CIKMCIKM-2001-JamilMT #database #interface #towards #visual notation
Towards a Visual Query Interface for Phylogenetic Databases (HMJ, GAM, MAT), pp. 57–64.
CIKMCIKM-2001-NieK #integration #optimisation
Joint Optimization of Cost and Coverage of Query Plans in Data Integration (ZN, SK), pp. 223–230.
CIKMCIKM-2001-OgilvieC #distributed #effectiveness #information retrieval
The Effectiveness of Query Expansion for Distributed Information Retrieval (PO, JPC), pp. 183–190.
ICMLICML-2001-DomeniconiG #approach #approximate #classification #dataset #multi #nearest neighbour #performance #scalability
An Efficient Approach for Approximating Multi-dimensional Range Queries and Nearest Neighbor Classification in Large Datasets (CD, DG), pp. 98–105.
KDDKDD-2001-PavlovS #modelling #probability #transaction
Probabilistic query models for transaction data (DP, PS), pp. 164–173.
MLDMMLDM-2001-GiacintoRF #adaptation #image #retrieval
Adaptive Query Shifting for Content-Based Image Retrieval (GG, FR, GF), pp. 337–346.
SIGIRSIGIR-2001-AllenL #distributed #web
Searching the Deep Web — Distributed Explorit Directed Query Applications (VSA, AL), p. 456.
SIGIRSIGIR-2001-FuhrG #documentation #information retrieval #named #xml
XIRQL: A Query Language for Information Retrieval in XML Documents (NF, KG), pp. 172–180.
SIGIRSIGIR-2001-GaoXZHNZ #information retrieval #modelling #statistics #using
Improving Query Translation for Cross-Language Information Retrieval Using Statistical Models (JG, EX, MZ, CH, JYN, JZ), pp. 96–104.
SIGIRSIGIR-2001-GhaniJM #automation #corpus #generative #web
Automatic Web Search Query Generation to Create Minority Language Corpora (RG, RJ, DM), pp. 432–433.
SIGIRSIGIR-2001-GodaKTFC #optimisation #problem
Query Optimization for Vector Space Problems (KG, MK, TT, OF, AC), pp. 416–417.
SIGIRSIGIR-2001-HoashiMIH #algorithm #collaboration #predict
Query Expansion Based on Predictive Algorithms for Collaborative Filtering (KH, KM, NI, KH), pp. 414–415.
SIGIRSIGIR-2001-LaffertyZ #documentation #information retrieval #modelling
Document Language Models, Query Models, and Risk Minimization for Information Retrieval (JDL, CZ), pp. 111–119.
SIGIRSIGIR-2001-LuLC #mining
Anchor Text Mining for Translation Extraction of Query Terms (WHL, HJL, LFC), pp. 388–389.
SIGIRSIGIR-2001-ManoO #automation
Selecting Expansion Terms in Automatic Query Expansion (HM, YO), pp. 390–391.
SIGIRSIGIR-2001-MuramatsuP #modelling
Transparent Queries: Investigating Users’ Mental Models of Search Engines (JM, WP), pp. 217–224.
SIGIRSIGIR-2001-RuthvenRL #abduction #empirical #using
Empirical Investigations on Query Modification Using Abductive Explanations (IR, CJvR, ML), pp. 181–189.
SIGIRSIGIR-2001-WenZN #clustering #feedback #using #word
Query Clustering Using Content Words and User Feedback (JRW, HZ, JYN), pp. 442–443.
UMLUML-2001-AkehurstB #modelling #ocl #on the #uml
On Querying UML Data Models with OCL (DHA, BB), pp. 91–103.
OOPSLAOOPSLA-2001-Nakamura #incremental
Incremental Computation of Complex Objects Queries (HN), pp. 156–165.
AdaSIGAda-2001-LaskiSP #database
Beyond ASIS: program data bases and tool-oriented queries (JWL, WS, PP), pp. 81–90.
SACSAC-2001-Comai #experience #graph #user interface #xml
Graph-based GUIs for querying XML data: the XML-GL experience (SC), pp. 269–274.
SACSAC-2001-GuPH #analysis #data type #database #design #image
Design and analysis of data structures for querying image databases (YG, BP, KAH), pp. 236–241.
SACSAC-2001-VuHT #algorithm #detection #image #performance
An efficient core-area detection algorithm for fast noise-free image query processing (KV, KAH, DAT), pp. 258–263.
HPDCHPDC-2001-SkicewiczDS #behaviour #multi #using
Multi-Resolution Resource Behaviour Queries Using Wavelets (JAS, PAD, JMS), pp. 395–394.
ESOPESOP-2001-CardelliG #logic
A Query Language Based on the Ambient Logic (LC, GG), pp. 1–22.
STOCSTOC-2001-GroheSS #evaluation #question
When is the evaluation of conjunctive queries tractable? (MG, TS, LS), pp. 657–666.
ICLPICLP-2001-GrecoGZ #approach #consistency #database #integration #logic programming
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases (GG, SG, EZ), pp. 348–364.
IJCARIJCAR-2001-DoutreM #framework
Preferred Extensions of Argumentation Frameworks: Query Answering and Computation (SD, JM), pp. 272–288.
LICSLICS-2001-BrunsG #logic
Temporal Logic Query Checking (GB, PG), pp. 409–417.
ADLADL-2000-CheongL
A Boolean Query Processing with a Result Cache in Mediator Systems (JHC, SgL), pp. 218–227.
ADLADL-2000-Crestani #fault #recognition #word
Effects of Word Recognition Errors in Spoken Query Processing (FC), pp. 39–47.
ADLADL-2000-ZhangMWZ #documentation #multi #named #web
WebSSQL — A Query Language for Multimedia Web Documents (CZ, WM, ZW, ZZ), pp. 58–67.
DL-2000-GerweV #interface
User effort in query construction and interface selection (PG, CLV), pp. 246–247.
DL-2000-HoubenB #ad hoc #automation #generative #hypermedia
Automatic hypermedia generation for ad hoc queries on semi-structured data (GJH, PDB), pp. 240–241.
TPDLECDL-2000-Crestani #information management #library
Spoken Query Processing for Information Access in Digital Libraries (FC), pp. 324–327.
TPDLECDL-2000-HessMD #named #web
QUEST — Querying Specialized Collections on the Web (MH, CM, OD), pp. 117–126.
TPDLECDL-2000-KovacsMPZ #architecture #user interface
AQUA (Advanced Query User Interface Architecture) (LK, AM, BP, IZ), pp. 372–375.
PODSPODS-2000-AtallahP #data access #parallel
(Almost) Optimal Parallel Block Access for Range Queries (MJA, SP), pp. 205–215.
PODSPODS-2000-BenediktGLS #constraints #database #reachability
Reachability and Connectivity Queries in Constraint Databases (MB, MG, LL, LS), pp. 104–115.
PODSPODS-2000-CalvaneseGLV
View-Based Query Processing for Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 58–66.
PODSPODS-2000-ChenKKM #estimation
Selectivity Estimation for Boolean Queries (ZC, FK, NK, SM), pp. 216–225.
PODSPODS-2000-DantsinV #complexity
Expressive Power and Data Complexity of Query Languages for Trees and Lists (ED, AV), pp. 157–165.
PODSPODS-2000-KoudasMS
Optimal Histograms for Hierarchical Range Queries (NK, SM, DS), pp. 196–204.
PODSPODS-2000-Kreutzer #constraints #database #fixpoint #linear
Fixed-Point Query Languages for Linear Constraint Databases (SK), pp. 116–125.
PODSPODS-2000-MillsteinLF #integration
Query Containment for Data Integration Systems (TDM, AYL, MF), pp. 67–75.
SIGMODSIGMOD-2000-AcharyaGP #approximate
Congressional Samples for Approximate Answering of Group-By Queries (SA, PBG, VP), pp. 487–498.
SIGMODSIGMOD-2000-BerckenDS #algorithm #library #prototype
javax.XXL: A prototype for a Library of Query processing Algorithms (JVdB, JPD, BS), p. 588.
SIGMODSIGMOD-2000-ChangBCLLS #linear #optimisation
The Onion Technique: Indexing for Linear Optimization Queries (YCC, LDB, VC, CSL, MLL, JRS), pp. 391–402.
SIGMODSIGMOD-2000-ChenDLT #learning #named #web
Fact: A Learning Based Web Query Processing System (SC, YD, HL, ZT), p. 587.
SIGMODSIGMOD-2000-ChenJDTW #database #internet #named #scalability
NiagaraCQ: A Scalable Continuous Query System for Internet Databases (JC, DJD, FT, YW), pp. 379–390.
SIGMODSIGMOD-2000-ChristophidesCS #integration #on the #performance #xml
On Wrapping Query Languages and Efficient XML Integration (VC, SC, JS), pp. 141–152.
SIGMODSIGMOD-2000-CorralMTV #database
Closest Pair Queries in Spatial Databases (AC, YM, YT, MV), pp. 189–200.
SIGMODSIGMOD-2000-GoldmanW #approach #database #named #web
WSQ/DSQ: A Practical Approach for Combined Querying of Databases and the Web (RG, JW), pp. 285–296.
SIGMODSIGMOD-2000-GunopulosKTD #approximate #multi
Approximating Multi-Dimensional Aggregate Range Queries over Real Attributes (DG, GK, VJT, CD), pp. 463–474.
SIGMODSIGMOD-2000-HellersteinA #adaptation #named
Eddies: Continuously Adaptive Query Processing (RA, JMH), pp. 261–272.
SIGMODSIGMOD-2000-KornM #nearest neighbour #set
Influence Sets Based on Reverse Nearest Neighbor Queries (FK, SM), pp. 201–212.
SIGMODSIGMOD-2000-LiuPBHPT #adaptation #data-driven #distributed #middleware #named
AQR-Toolkit: An Adaptive Query Routing Middleware for Distributed Data Intensive Systems (LL, CP, DB, WH, HP, WT), p. 597.
SIGMODSIGMOD-2000-RoySSB #algorithm #multi #optimisation #performance
Efficient and Extensible Algorithms for Multi Query Optimization (PR, SS, SS, SB), pp. 249–260.
SIGMODSIGMOD-2000-WaasG #cost analysis #execution
Counting, Enumerating, and Sampling of Execution Plans in a Cost-Based Query Optimizer (FW, CAGL), pp. 499–509.
SIGMODSIGMOD-2000-WattezCBFF #benchmark #learning #metric
Benchmarking Queries over Trees: Learning the Hard Truth the Hard Way (FW, SC, VB, GF, CF), pp. 510–511.
SIGMODSIGMOD-2000-ZaharioudakisCLPU #automation #sql #summary #using
Answering Complex SQL Queries Using Automatic Summary Tables (MZ, RC, GL, HP, MU), pp. 105–116.
VLDBVLDB-2000-BalminPP
Hypothetical Queries in an OLAP Environment (AB, TP, YP), pp. 220–231.
VLDBVLDB-2000-Bar-YossefBCFW #approximate #random #web
Approximating Aggregate Queries about Web Pages via Random Walks (ZBY, ACB, SC, JF, DW), pp. 535–544.
VLDBVLDB-2000-ChakrabartiGRS #approximate #using
Approximate Query Processing Using Wavelets (KC, MNG, RR, KS), pp. 111–122.
VLDBVLDB-2000-ChangG #approximate
Approximate Query Translation Across Heterogeneous Information Sources (KCCC, HGM), pp. 566–577.
VLDBVLDB-2000-DiaoLCT #learning #towards #web
Toward Learning Based Web Query Processing (YD, HL, SC, ZT), pp. 317–328.
VLDBVLDB-2000-GantiLR #approximate #named #self
ICICLES: Self-Tuning Samples for Approximate Query Answering (VG, MLL, RR), pp. 176–187.
VLDBVLDB-2000-GuntzerBK #database #image #multi #optimisation
Optimizing Multi-Feature Queries for Image Databases (UG, WTB, WK), pp. 419–428.
VLDBVLDB-2000-JohnsonA #optimisation
Optimizing Queries on Compressed Bitmaps (SAY, TJ), pp. 329–338.
VLDBVLDB-2000-LingLL
Hierarchical Compact Cube for Range-Max Queries (SYL, TWL, HGL), pp. 232–241.
VLDBVLDB-2000-MendelzonV
Temporal Queries in OLAP (AOM, AAV), pp. 242–253.
VLDBVLDB-2000-MillerHH
Schema Mapping as Query Discovery (RJM, LMH, MAH), pp. 77–88.
VLDBVLDB-2000-OlstonW #trade-off
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data (CO, JW), pp. 144–155.
VLDBVLDB-2000-PfoserJT #novel
Novel Approaches in Query Processing for Moving Object Trajectories (DP, CSJ, YT), pp. 395–406.
VLDBVLDB-2000-PottingerL #algorithm #scalability #using
A Scalable Algorithm for Answering Queries Using Views (RP, AYL), pp. 484–495.
VLDBVLDB-2000-RisheYACLMVSV #database #interface #semantics
Semantic Access: Semantic Interface for Querying Databases (NR, JY, RA, SCC, XL, XM, AV, AS, DV), pp. 591–594.
ICALPICALP-2000-Merkle #power of
The Global Power of Additional Queries to p-Random Oracles (WM), pp. 914–925.
ICFPICFP-2000-Wong #functional
The functional guts of the Kleisli query system (LW), pp. 1–10.
ICEISICEIS-2000-OommenR #comparison #empirical #optimisation
An Empirical Comparison of Histogram-Like Techniques for Query Optimization (BJO, LR), pp. 71–78.
CIKMCIKM-2000-BoughanemT #algorithm #optimisation #search-based #using
Query Optimization Using An Improved Genetic Algorithm (MB, LT), pp. 368–373.
CIKMCIKM-2000-DomenigD #approach #data flow #semistructured data
A Query based Approach for Integrating Heterogeneous Data Sources (RD, KRD), pp. 453–460.
CIKMCIKM-2000-OrlandicY #multi #reuse
Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse (RO, BY), pp. 141–149.
CIKMCIKM-2000-PedersenSGJ #database
Extending OLAP Querying to External Object Databases (TBP, AS, JG, CSJ), pp. 405–413.
CIKMCIKM-2000-SadriB #database #equivalence #nondeterminism #on the
On Equivalence of Queries in Uncertain Databases (FS, MFB), pp. 264–271.
CIKMCIKM-2000-SpinkMS #elicitation #web
Elicitations Queries to the Excite Web Search Engine (AS, SM, MS), pp. 134–140.
CIKMCIKM-2000-StojanovicDS #analysis #framework #visual notation
Visual Query and Analysis Tool of the Object-Relational GIS Framework (ZS, SDK, DS), pp. 328–335.
CIKMCIKM-2000-WangWWSHS #information management #internet #semantics
Semantic Search on Internet Tabular Information Extraction for Answering Queries (HLW, SHW, ICW, CLS, WLH, WKS), pp. 243–249.
CIKMCIKM-2000-WuAA #approximate #composition #using
Using Wavelet Decomposition to Support Progressive and Approximate Range-Sum Queries over Data Cubes (YLW, DA, AEA), pp. 414–421.
ICMLICML-2000-CampbellCS #classification #learning #scalability
Query Learning with Large Margin Classifiers (CC, NC, AJS), pp. 111–118.
ICMLICML-2000-MamitsukaA #database #learning #mining #performance #scalability
Efficient Mining from Large Databases by Query Learning (HM, NA), pp. 575–582.
ICPRICPR-v3-2000-SekimotoNTO #retrieval #using #video
Continuous Retrieval of Video Using Segmentation-Free Query (NS, TN, HT, RO), pp. 3375–3378.
ICPRICPR-v4-2000-BrunelliM #image #retrieval
Query Simplification and Strategy Selection for Image Retrieval (RB, OM), pp. 4279–4282.
ICPRICPR-v4-2000-FolkersSS #multi #using
Processing Pictorial Queries with Multiple Instances Using Isomorphic Subgraphs (AF, HS, AS), pp. 4051–4054.
ICPRICPR-v4-2000-HachimuraT #composition #image #interactive #retrieval #specification
Image Retrieval Based on Compositional Features and Interactive Query Specification (KH, AT), pp. 4262–4266.
ICPRICPR-v4-2000-HeisterkampPD #image #learning #retrieval
Feature Relevance Learning with Query Shifting for Content-Based Image Retrieval (DRH, JP, HKD), pp. 4250–4253.
ICPRICPR-v4-2000-PatriceK #feedback #image #retrieval #similarity
Texture Similarity Queries and Relevance Feedback for Image Retrieval (BP, HK), pp. 4055–4058.
KDDKDD-2000-BeefermanB #clustering
Agglomerative clustering of a search engine query log (DB, ALB), pp. 407–416.
KRKR-2000-CalvaneseGLV
Containment of Conjunctive Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 176–185.
KRKR-2000-FattahP #approach #automation #composition
A Compositional Structured Query Approach to Automated Inference (YEF, MAP), pp. 213–224.
SIGIRSIGIR-2000-BaekLR #semantics
Latent semantic indexing model for boolean query formulation (DHB, HSL, HCR), pp. 310–312.
SIGIRSIGIR-2000-BruzaMD #interactive #internet #keyword
Interactive Internet search: keyword, directory and query reformulation mechanisms compared (PB, RM, SD), pp. 280–287.
SIGIRSIGIR-2000-DingC00a
Beyond the traditional query operators (C(D, CHC), pp. 377–378.
SIGIRSIGIR-2000-EfthimiadisF #behaviour #case study #database #image
The effect of query type on subject searching behavior of image databases: an exploratory study (ENE, RF), pp. 328–330.
SIGIRSIGIR-2000-NaritaO #information retrieval #using
The use of phrases from query texts in information retrieval (MN, YO), pp. 318–320.
SIGIRSIGIR-2000-Sormunen #effectiveness #evaluation #novel
A novel method for the evaluation of Boolean query effectiveness across a wide operational range (ES), pp. 25–32.
OOPSLAOOPSLA-2000-KiernanC #middleware
Middleware object query processing with deferred updates and autonomous sources (JK, MJC), pp. 118–129.
ASEASE-2000-MenziesS #assessment #case study #risk management #scalability
Practical Large Scale What-If Queries: Case Studies with Software Risk Assessment (TM, ES), p. 165–?.
SACSAC-2000-CeriCDFT
Complex Queries in XML-GL (SC, SC, ED, PF, LT), pp. 888–893.
SACSAC-2000-HaratyF #distributed #optimisation #using
Distributed Query Optimization Using PERF Joins (RAH, RCF), pp. 284–288.
SACSAC-2000-RennieLW #database #network #web
Web Access to Environmental Databases: a Database Query and Presentation System for the UK Environmental Change Network (SCR, AMJL, MW), pp. 894–897.
SACSAC-2000-ZhangP #distributed #network #using
Distributed Query Processing Using Active Networks (ZZ, WP), pp. 374–380.
HPDCHPDC-2000-PlaleS #data flow #embedded #named #scalability #using
dQUOB: Managing Large Data Flows using Dynamic Embedded Queries (BP, KS), pp. 263–270.
STOCSTOC-2000-BlumKW #learning #problem #statistics
Noise-tolerant learning, the parity problem, and the statistical query model (AB, AK, HW), pp. 435–440.
STOCSTOC-2000-CharikarFGKRS
Query strategies for priced information (MC, RF, VG, JMK, PR, AS), pp. 582–591.
STOCSTOC-2000-ChenX #graph
Shortest path queries in planar graphs (DZC, JX), pp. 469–478.
STOCSTOC-2000-GoldsmithS
More theory revision with queries (JG, RHS), pp. 441–448.
STOCSTOC-2000-SamorodnitskyT #complexity
A PCP characterization of NP with optimal amortized query complexity (AS, LT), pp. 191–199.
CAVCAV-2000-Chan
Temporal-Locig Queries (WC), pp. 450–463.
ICLPCL-2000-ArenasBK #calculus #consistency #database
Applications of Annotated Predicate Calculus to Querying Inconsistent Databases (MA, LEB, MK), pp. 926–941.
ICLPCL-2000-Brass #named #web
SLDMagic — The Real Magic (With Applications to Web Queries) (SB), pp. 1063–1077.
ICLPCL-2000-CelleB #algorithm #consistency #database #implementation
Querying Inconsistent Databases: Algorithms and Implementation (AC, LEB), pp. 942–956.
ICLPCL-2000-OliboniT #recursion #xml
Querying XML Specified WWW Sites: Links and Recursion in XML-GL (BO, LT), pp. 1167–1181.
LICSLICS-2000-CalvaneseGLV #constraints
View-Based Query Processing and Constraint Satisfaction (DC, GDG, ML, MYV), pp. 361–371.
LICSLICS-2000-GroheS #first-order #on the
On First-Order Topological Queries (MG, LS), pp. 349–360.
ADLADL-1999-PlaisantVNBHW #multi
Refining Query Previews Techniques for Data with Multivalued Attributes: The Case of NASA EOSDIS (CP, MV, KN, RB, BH, WW), pp. 50–59.
DL-1999-DushayFL #distributed #library #using
Using Query Mediators for Distributed Searching in Federated Digital Libraries (ND, JCF, CL), pp. 171–178.
DL-1999-KovacsMP #library #named #visualisation
AQUA: Query Visualization for the NCSTRL Digital Library (LK, AM, BP), pp. 230–231.
TPDLECDL-1999-AdrianiR #information retrieval #similarity
Term Similarity-Based Query Expansion for Cross-Language Information Retrieval (MA, CJvR), pp. 311–322.
TPDLECDL-1999-CarpinetoR #automation #effectiveness #towards
Towards More Effective Techniques for Automatic Query Expansion (CC, GR), pp. 126–141.
ICDARICDAR-1999-SchomakerVL #image
New Use for the Pen: Outline-based Image Queries (LS, LV, EdL), pp. 293–296.
PODSPODS-1999-ArenasBC #consistency #database
Consistent Query Answers in Inconsistent Databases (MA, LEB, JC), pp. 68–79.
PODSPODS-1999-BenediktL #approximate #constraints
Exact and Approximate Aggregation in Constraint Query (MB, LL), pp. 102–113.
PODSPODS-1999-CalvaneseGLV #regular expression
Rewriting of Regular Expressions and Regular Path Queries (DC, GDG, ML, MYV), pp. 194–204.
PODSPODS-1999-ChuHS #optimisation
Least Expected Cost Query Optimization: An Exercise in Utility (FCC, JYH, PS), pp. 138–147.
PODSPODS-1999-CohenNS #using
Rewriting Aggregate Queries Using Views (SC, WN, AS), pp. 155–166.
PODSPODS-1999-Cosmadakis #complexity #recursion
Inherent Complexity of Recursive Queries (SSC), pp. 148–154.
PODSPODS-1999-GottlobLS
Hypertree Decompositions and Tractable Queries (GG, NL, FS), pp. 21–32.
PODSPODS-1999-GrumbachRT
Querying Aggregate Data (SG, MR, LT), pp. 174–184.
PODSPODS-1999-KanzaNS #semistructured data
Queries with Incomplete Answers over Semistructured Data (YK, WN, YS), pp. 227–236.
PODSPODS-1999-MiloS #semistructured data #type inference
Type Inference for Queries on Semistructured Data (TM, DS), pp. 215–226.
PODSPODS-1999-NevenS #automaton
Query Automata (FN, TS), pp. 205–214.
SIGMODSIGMOD-1999-AcharyaGPR #approximate
The Aqua Approximate Query Answering System (SA, PBG, VP, SR), pp. 574–576.
SIGMODSIGMOD-1999-AcharyaGPR99a #approximate
Join Synopses for Approximate Query Answering (SA, PBG, VP, SR), pp. 275–286.
SIGMODSIGMOD-1999-BlohsfeldKS #comparison #metric
A Comparison of Selectivity Estimators for Range Queries on Metric Attributes (BB, DK, BS), pp. 239–250.
SIGMODSIGMOD-1999-ChangG
Mind Your Vocabulary: Query Mapping Across Heterogeneous Information Sources (KCCC, HGM), pp. 335–346.
SIGMODSIGMOD-1999-ChanI #encoding #performance
An Efficient Bitmap Encoding Scheme for Selection Queries (CYC, YEI), pp. 215–226.
SIGMODSIGMOD-1999-CruzJ #database #distributed #interface #multi
A User-Centered Interface for Querying Distributed Multimedia Databases (IFC, KMJ), pp. 590–592.
SIGMODSIGMOD-1999-DavulcuFKR #architecture #web
A Layered Architecture for Querying Dynamic Web Content (HD, JF, MK, IVR), pp. 491–502.
SIGMODSIGMOD-1999-FlorescuLMS #data access #optimisation
Query Optimization in the Presence of Limited Access Patterns (DF, AYL, IM, DS), pp. 311–322.
SIGMODSIGMOD-1999-IvesFFLW #adaptation #execution #integration
An Adaptive Query Execution System for Data Integration (ZGI, DF, MF, AYL, DSW), pp. 299–310.
SIGMODSIGMOD-1999-JagadishLMSV #network
Querying Network Directories (HVJ, LVSL, TM, DS, DV), pp. 133–144.
SIGMODSIGMOD-1999-LakshmananNHP #constraints #optimisation #set
Optimization of Constrained Frequent Set Queries with 2-variable Constraints (LVSL, RTN, JH, AP), pp. 157–168.
SIGMODSIGMOD-1999-MaratheS #array
Query Processing Techniques for Arrays (APM, KS), pp. 323–334.
SIGMODSIGMOD-1999-MayrS
Client-Site Query Extensions (TM, PS), pp. 347–358.
SIGMODSIGMOD-1999-NgLHM #mining #set
Exploratory Mining via Constrained Frequent Set Queries (RTN, LVSL, JH, TM), pp. 556–558.
SIGMODSIGMOD-1999-PapakonstantinouV #semistructured data
Query Rewriting for Semistructured Data (YP, VV), pp. 455–466.
SIGMODSIGMOD-1999-Wu #optimisation #using
Query Optimization for Selections Using Bitmaps (MCW), pp. 227–238.
VLDBVLDB-1999-AcharyaGP #approximate #named #performance #using
Aqua: A Fast Decision Support Systems Using Approximate Query Answers (SA, PBG, VP), pp. 754–757.
VLDBVLDB-1999-Blum #automation #database #relational #semantics
Microsoft English Query 7.5: Automatic Extraction of Semantics from Relational Databases and OLAP Cubes (AB), pp. 247–248.
VLDBVLDB-1999-ChanI
Hierarchical Prefix Cubes for Range-Sum Queries (CYC, YEI), pp. 675–686.
VLDBVLDB-1999-ChaudhuriG
Evaluating Top-k Selection Queries (SC, LG), pp. 397–410.
VLDBVLDB-1999-ChengGKLLQS #database #implementation #optimisation #semantics
Implementation of Two Semantic Query Optimization Techniques in DB2 Universal Database (QC, JG, FK, TYCL, LL, XQ, KBS), pp. 687–698.
VLDBVLDB-1999-DonjerkovicR #optimisation #probability
Probabilistic Optimization of Top N Queries (DD, RR), pp. 411–422.
VLDBVLDB-1999-DyresonBJ #aspect-oriented #multi #semistructured data
Capturing and Querying Multiple Aspects of Semistructured Data (CED, MHB, CSJ), pp. 290–301.
VLDBVLDB-1999-HaasKU
Loading a Cache with Query Results (LMH, DK, IU), pp. 351–362.
VLDBVLDB-1999-KonigW #estimation #parametricity
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation (ACK, GW), pp. 423–434.
VLDBVLDB-1999-McHughW #optimisation #xml
Query Optimization for XML (JM, JW), pp. 315–326.
VLDBVLDB-1999-ShanmugasundaramGTZDN #database #documentation #relational #xml
Relational Databases for Querying XML Documents: Limitations and Opportunities (JS, KT, CZ, GH, DJD, JFN), pp. 302–314.
VLDBVLDB-1999-TanGO #feedback #multi #online #thread
Online Feedback for Nested Aggregate Queries with Multi-Threading (KLT, CHG, BCO), pp. 18–29.
CSMRCSMR-1999-EbertKW #re-engineering
Querying as an Enabling Technology in Software Reengineering (BK, AW), pp. 42–50.
PASTEPASTE-1999-Balmas #paradigm #source code
Query by Outlines: A New Paradigm to Help Manage Programs (FB), pp. 86–94.
WCREWCRE-1999-Balmas #named #source code
QBO: A Query Tool Specially Developed to Explore Programs (FB), pp. 270–279.
DLTDLT-1999-AndreBC #bound #decidability #on the
On decidability of boundedness property for regular path queries (YA, FB, ACC), pp. 245–256.
ICALPICALP-1999-FlescaG #graph #order #regular expression
Partially Ordered Regular Languages for Graph Queries (SF, SG), pp. 321–330.
CHICHI-1999-CzerwinskiDRDTD #information management #retrieval #visualisation
Visualizing Implicit Queries for Information Management and Retrieval (MC, STD, GGR, SD, SLT, MvD), pp. 560–567.
CAiSECAiSE-1999-CalvaneseGL #constraints
Queries and Constraints on Semi-structured Data (DC, GDG, ML), pp. 434–438.
ICEISICEIS-1999-Ribiero
An Applet Based Query Tool (NVR), pp. 706–710.
ICEISICEIS-1999-RossiterNH #architecture #database
Three-Level Architecture for Query Closure in Database Systems (BNR, DAN, MAH), p. 760.
ICEISICEIS-1999-ThiyagarajahO #database #optimisation #prototype #validation
Prototype Validation of the Trapezoidal Attribute Cardinality Map for Query Optimization in Database Systems (MT, BJO), pp. 156–162.
CIKMCIKM-1999-Gal #enterprise #information management
Obsolescent Materialized Views in Query Processing of Enterprise Information Systems (AG), pp. 367–374.
CIKMCIKM-1999-LeeB #multi #named #semantics
SemQL: A Semantic Query Language for Multidatabase Systems (JOL, DKB), pp. 259–266.
CIKMCIKM-1999-LeeC #semantics #web
Semantic Caching via Query Matching for Web Sources (DL, WWC), pp. 77–85.
CIKMCIKM-1999-LinXLN #database #named
ZBroker: A Query Routing Broker for Z39.50 Databases (YL, JX, EPL, WKN), pp. 202–209.
CIKMCIKM-1999-WarshawM #optimisation #revisited #rule-based
Rule-Based Query Optimization, Revisited (LW, DPM), pp. 267–275.
KDDKDD-1999-BennettFG #approximate #nearest neighbour
Density-Based Indexing for Approximate Nearest-Neighbor Queries (KPB, UMF, DG), pp. 233–243.
KDDKDD-1999-HuangY #adaptation
Adaptive Query Processing for Time-Series Data (YWH, PSY), pp. 282–286.
KDDKDD-1999-ShanmugasundaramFB #approximate
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions (JS, UMF, PSB), pp. 223–232.
SIGIRSIGIR-1999-GolovchinskyPS #retrieval
From Reading to Retrieval: Freeform Ink Annotations as Queries (GG, MNP, BNS), pp. 19–25.
SIGIRSIGIR-1999-LimaP #recognition
Phrase Recognition and Expansion for Short, Precision-Biased Queries Based on a Query Log (EFdL, JOP), pp. 145–152.
SIGIRSIGIR-1999-MandalaTT #multi
Combining Multiple Evidence from Different Types of Thesaurus for Query Expansion (RM, TT, HT), pp. 191–197.
SIGIRSIGIR-1999-Nordlie #comparison #development #interactive #online #quote
“User Revealment” — a Comparison of Initial Queries and Ensuing Question Development in Online Searching and in Human Reference Interactions (RN), pp. 11–18.
TOOLSTOOLS-ASIA-1999-Jin
Translating Object Query Language (BJ), pp. 380–385.
TOOLSTOOLS-ASIA-1999-SheuY #corba
Federated Query Service Based on CORBA (RKS, SMY), pp. 392–399.
TOOLSTOOLS-PACIFIC-1999-Taniar #object-oriented #optimisation #traversal
Optimizing Object-Oriented Collection Join Queries through Path Traversals (DT), pp. 295–304.
PADLPADL-1999-HakliNTU #declarative #implementation #string
Implementing a Declarative String Query Language with String Restructuring (RH, MN, HT, EU), pp. 179–195.
SACSAC-1999-StaudtSQJ #optimisation
Query Optimization for Repository-Based Applications (MS, RS, CQ, MJ), pp. 197–203.
HPDCHPDC-1999-LowekampOG #distributed #network
Direct Queries for Discovering Network Resource Properties in a Distributed Environment (BL, DRO, TRG), pp. 38–46.
STOCSTOC-1999-NayakW #approximate #complexity #quantum #statistics
The Quantum Query Complexity of Approximating the Median and Related Statistics (AN, FW), pp. 384–393.
CSLCSL-1999-Balcazar #consistency #learning
The Consistency Dimension, Compactness, and Query Learning (JLB), pp. 2–13.
CSLCSL-1999-Beklemishev #bound
Open Least Element Principle and Bounded Query Computation (LDB), pp. 389–404.
CSLCSL-1999-Vianu #database
Topological Queries in Spatial Databases (VV), p. 1.
ICLPICLP-1999-Greco #optimisation
Optimization of Disjunctive Queries (SG), pp. 441–455.
ICLPICLP-1999-OsorioJN #declarative #functional
Declarative Pruning in a Functional Query Language (MO, BJ, JCN), pp. 588–604.
LICSLICS-1999-Libkin #bound #invariant #logic
Logics with Counting, Auxiliary Relations, and Lower Bounds for Invariant Queries (LL), pp. 316–325.
ADLADL-1998-BohmAOG #documentation #optimisation
Query Optimization for Structured Documents Based on Knowledge on the Document Type Definition (KB, KA, MTÖ, KG), pp. 196–205.
ADLADL-1998-Dao #documentation
An Indexing Model for Structured Documents to Support Queries on Content, Structure, and Attributes (TD), pp. 88–97.
ADLADL-1998-DjerabaBB #concept #information management #visual notation
Concept-Based Query in Visual Information Systems (CD, MB, HB), pp. 299–308.
ADLADL-1998-LiSCH #implementation #modelling #named #web
WebDB: A Web Query System and Its Modeling, Language, and Implementation (WSL, JS, KSC, YH), pp. 216–227.
DL-1998-BaldonadoKPCGW #agile #design #interactive
An Extensible Constructor Tool for the Rapid, Interactive Design of Query Synthesizers (MQWB, SK, AP, KCCC, HGM, TW), pp. 19–28.
DL-1998-JansenSS #analysis #scalability #web
Failure Analysis in Query Construction: Data and Analysis from a Large Sample of Web Queries (BJJ, AS, TS), pp. 289–290.
DL-1998-Jones #library
Dynamic Query Result Previews for a Digital Library (SJ), pp. 291–292.
DL-1998-LimTLN #web
Querying Structured Web Resources (EPL, CHT, BWL, WKN), pp. 297–298.
DL-1998-Ribeiro-NetoB #distributed #library #performance
Query Performance for Tightly Coupled Distributed Digital Libraries (BARN, RAB), pp. 182–190.
DL-1998-XuCLN #database
Database Selection Techniques for Routing Bibliographic Queries (JX, YC, EPL, WKN), pp. 264–273.
TPDLECDL-1998-BecksST #documentation #library #semantics #visual notation
Semantic Structuring and Visual Querying of Document Abstracts in Digital Libraries (AB, SS, CT), pp. 443–458.
TPDLECDL-1998-BosmanBWW #approach #documentation #navigation
Documentation, Cataloging and Query by Navigation: A Practical and Sound Approach (FJMB, PB, TPvdW, LVMW), pp. 459–478.
TPDLECDL-1998-BraschlerPPS #approach #web
Cross-Language Web Querying: The EuroSearch Approach (MB, CP, EP, PS), pp. 701–702.
TPDLECDL-1998-ChidlovskiiB #semantics
Signature File Methods for Semantic Query Caching (BC, UMB), pp. 479–498.
HTHT-1998-TajimaMKT #email
Cut as a Querying Unit for WWW, Netnews, e-mail (KT, YM, MK, KT), pp. 235–244.
PODSPODS-1998-AbiteboulD #complexity #using
Complexity of Answering Queries Using Materialized Views (SA, OMD), pp. 254–263.
PODSPODS-1998-BenediktL #constraints
Safe Constraint Queries (MB, LL), pp. 99–108.
PODSPODS-1998-CalvaneseGL #constraints #decidability #on the
On the Decidability of Query Containment under Constraints (DC, GDG, ML), pp. 149–158.
PODSPODS-1998-Chaudhuri #optimisation #overview #relational
An Overview of Query Optimization in Relational Systems (SC), pp. 34–43.
PODSPODS-1998-CiacciaPZ #cost analysis #metric #similarity
A Cost Model for Similarity Queries in Metric Spaces (PC, MP, PZ), pp. 59–68.
PODSPODS-1998-Fagin #database #fuzzy #multi
Fuzzy Queries in Multimedia Database Systems (RF), pp. 1–10.
PODSPODS-1998-FlorescuLS #regular expression
Query Containment for Conjunctive Queries with Regular Expressions (DF, AYL, DS), pp. 139–148.
PODSPODS-1998-GradelGH #complexity #reliability
The Complexity of Query Reliability (EG, YG, CH), pp. 227–234.
PODSPODS-1998-KolaitisMT #complexity #on the #problem
On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.
PODSPODS-1998-NevenB #attribute grammar #documentation
Expressiveness of Structured Document Query Languages Based on Attribute Grammars (FN, JVdB), pp. 11–17.
PODSPODS-1998-NevenBGV #database
Typed Query Languages for Databases Containing Queries (FN, JVdB, DVG, GV), pp. 189–196.
PODSPODS-1998-NuttSS
Deciding Equivalences Among Aggregate Queries (WN, YS, SS), pp. 214–223.
PODSPODS-1998-SamoladasM #bound #multi #theorem
A Lower Bound Theorem for Indexing Schemes and Its Application to Multidimensional Range Queries (VS, DPM), pp. 44–51.
PODSPODS-1998-SegoufinV #database #invariant
Querying Spatial Databases via Topological Invariants (LS, VV), pp. 89–98.
PODSPODS-1998-VandeurzenGG #database #linear
An Expressive Language for Linear Spatial Database Queries (LV, MG, DVG), pp. 109–118.
SIGMODSIGMOD-1998-ChenWZ
A Protein Patent Query System Powered By Kleisli (JC, LW, LZ), pp. 593–595.
SIGMODSIGMOD-1998-Cohen #database #integration #semistructured data #similarity #using
Integration of Heterogeneous Databases Without Common Domains Using Queries Based on Textual Similarity (WWC), pp. 201–212.
SIGMODSIGMOD-1998-Cohen98a #similarity #using #web
Providing Database-like Access to the Web Using Queries Based on Textual Similarity (WWC), pp. 558–560.
SIGMODSIGMOD-1998-DeshpandeRSN #multi #using
Caching Multidimensional Queries Using Chunks (PD, KR, AS, JFN), pp. 259–270.
SIGMODSIGMOD-1998-Fegaras #database #object-oriented
Query Unnesting in Object-Oriented Databases (LF), pp. 49–60.
SIGMODSIGMOD-1998-GibbonsM #approximate #statistics #summary
New Sampling-Based Summary Statistics for Improving Approximate Query Answers (PBG, YM), pp. 331–342.
SIGMODSIGMOD-1998-GrumbachRS
The DEDALE System for Complex Spatial Queries (SG, PR, LS), pp. 213–224.
SIGMODSIGMOD-1998-JonssonFS #evaluation #information retrieval #interactive
Interaction of Query Evaluation and Buffer Management for Information Retrieval (BÞJ, MJF, DS), pp. 118–129.
SIGMODSIGMOD-1998-KabraD #execution #performance
Efficient Mid-Query Re-Optimization of Sub-Optimal Query Execution Plans (NK, DJD), pp. 106–117.
SIGMODSIGMOD-1998-PapadopoulosM #array #similarity #using
Similarity Query Processing Using Disk Arrays (AP, YM), pp. 225–236.
SIGMODSIGMOD-1998-RaoR #correlation #invariant #reuse
Reusing Invariants: A New Strategy for Correlated Queries (JR, KAR), pp. 37–48.
SIGMODSIGMOD-1998-SubramanianV #cost analysis #optimisation #using
Cost-Based Optimization of Decision Support Queries Using Transient Views (SNS, SV), pp. 319–330.
SIGMODSIGMOD-1998-TsurUACMNR #mining
Query Flocks: A Generalization of Association-Rule Mining (ST, JDU, SA, CC, RM, SN, AR), pp. 1–12.
SIGMODSIGMOD-1998-UrhanFA
Cost Based Query Scrambling for Initial Delays (TU, MJF, LA), pp. 130–141.
SIGMODSIGMOD-1998-ZhaoDNS #evaluation #multi #optimisation
Simultaneous Optimization and Evaluation of Multiple Dimensional Queries (YZ, PD, JFN, AS), pp. 271–282.
VLDBVLDB-1998-AnkerstBKS #adaptation #approximate #similarity #using
Improving Adaptable Similarity Query Processing by Using Approximations (MA, BB, HPK, TS), pp. 206–217.
VLDBVLDB-1998-CareyK #distance #sql
Reducing the Braking Distance of an SQL Query Engine (MJC, DK), pp. 158–169.
VLDBVLDB-1998-CherniackZ #semantics
Inferring Function Semantics to Optimize Queries (MC, SBZ), pp. 239–250.
VLDBVLDB-1998-FangSGMU
Computing Iceberg Queries Efficiently (MF, NS, HGM, RM, JDU), pp. 299–310.
VLDBVLDB-1998-Ganguly #algorithm #analysis #design #optimisation #parametricity
Design and Analysis of Parametric Query Optimization Algorithms (SG), pp. 228–238.
VLDBVLDB-1998-GrovlenHT #low cost
Low-Cost Compensation-Based Query Processing (ØG, SOH, ØT), pp. 182–193.
VLDBVLDB-1998-IshikawaSF #database #multi #named
MindReader: Querying Databases Through Multiple Examples (YI, RS, CF), pp. 218–227.
VLDBVLDB-1998-LinR #sequence
Querying Continuous Time Sequences (LL, TR), pp. 170–181.
VLDBVLDB-1998-PapadiasMD #algorithm
Algorithms for Querying by Spatial Structure (DP, NM, VD), pp. 546–557.
VLDBVLDB-1998-VenkataramanZ #database #optimisation #semistructured data
Heterogeneous Database Query Optimization in DB2 Universal DataJoiner (SV, TZ), pp. 685–689.
CAiSECAiSE-1998-LacroixSC #approach #database #information management #web
Information Extraction and Database Techniques: A User-Oriented Approach to Querying the Web (ZL, AS, RC), pp. 289–304.
ECIRACIR-1998-OunisP #concept #effectiveness #graph #performance #relational #using
Effective and Efficient Relational Query Processing Using Conceptual Graphs (IO, MP).
ECIRACIR-1998-SmeatonK #information retrieval #interactive
User-Chosen Phrases in Interactive Query Formulation for Information Retrieval (AFS, FK).
CIKMCIKM-1998-BouganimKV #adaptation #execution #scalability #scheduling
Memory-Adaptive Scheduling for Large Query Execution (LB, OK, PV), pp. 105–115.
CIKMCIKM-1998-DumasFS #pattern matching
Handling Temporal Grouping and Pattern-Matching Queries in a Temporal Object Model (MD, MCF, PCS), pp. 424–431.
CIKMCIKM-1998-FinanceDR #network
Querying Future Telecommunication Networks (BF, TD, AR), pp. 226–233.
CIKMCIKM-1998-JacksonAKG #generative #information management #parsing #retrieval
Information Extraction from Case Low and Retrieval of Prior Cases by Partial Parsing and Query Generation (PJ, KAK, CK, BG), pp. 60–67.
CIKMCIKM-1998-KimC #clustering #performance
Sibling Clustering of Tree-Based Spatial Indexes for Efficient Spatial Query Processing (KK, SKC), pp. 398–405.
CIKMCIKM-1998-NagD #memory management
Memory Allocation Strategies for Complex Decision Support Queries (BN, DJD), pp. 116–123.
CIKMCIKM-1998-ProviettiF #estimation
Selectivity Estimation of Window Queries (GP, CF), pp. 340–347.
ICMLICML-1998-AbeM #learning #using
Query Learning Strategies Using Boosting and Bagging (NA, HM), pp. 1–9.
ICPRICPR-1998-JainVX #video
Query by video clip (AKJ, AV, WX), pp. 909–911.
ICPRICPR-1998-LazarescuVWC #video
Combining NL processing and video data to query American Football (ML, SV, GAWW, TC), pp. 1238–1240.
ICPRICPR-1998-SofferSZ #database #image #specification
Pictorial query trees for query specification in image databases (AS, HS, DNZ), pp. 919–921.
ICPRICPR-1998-Yamada #pattern matching #retrieval #using
Handwritten text retrieval using two-stage pattern matching with handwritten query (KY), pp. 621–625.
KDDKDD-1998-ThomasS #mining #sql #using
Mining Generalized Association Rules and Sequential Patterns Using SQL Queries (ST, SS), pp. 344–348.
SIGIRSIGIR-1998-FranzR #correlation
A Method for Scoring Correlated Features in Query Expansion (MF, SR), pp. 337–338.
SIGIRSIGIR-1998-Jean-David #automation #corpus
Automatic Acquisition of Terminological Relations from a Corpus for Query Expansion (SJD), pp. 371–372.
SIGIRSIGIR-1998-JoseFH #evaluation #image #retrieval
Spatial Querying for Image Retrieval: A User-Oriented Evaluation (JMJ, JF, DJH), pp. 232–240.
SIGIRSIGIR-1998-KaszkielZ #database #documentation #evaluation #scalability
Term-Ordered Query Evaluation versus Document-Ordered Query Evaluation for Large Document Databases (MK, JZ), pp. 343–344.
SIGIRSIGIR-1998-KekalainenJ #performance #retrieval
The Impact of Query Structure and Query Expansion on Retrieval Performance (JK, KJ), pp. 130–137.
SIGIRSIGIR-1998-KwokC #ad hoc #retrieval
Improving Two-Stage Ad-Hoc Retrieval for Short Queries (KLK, MC), pp. 250–256.
SIGIRSIGIR-1998-McNabWWG #predict
Predicting Query Times (RJM, YW, IHW, CG), pp. 355–356.
SIGIRSIGIR-1998-MitraSB #automation
Improving Automatic Query Expansion (MM, AS, CB), pp. 206–214.
SIGIRSIGIR-1998-OgawaM #evaluation #n-gram #optimisation
Optimizing Query Evaluation in n-gram Indexing (YO, TM), pp. 367–368.
SIGIRSIGIR-1998-Pirkola #information retrieval #taxonomy
The Effects of Query Structure and Dictionary Setups in Dictionary-Based Cross-Language Information Retrieval (AP), pp. 55–63.
SIGIRSIGIR-1998-TombrosS #information retrieval #summary
Advantages of Query Biased Summaries in Information Retrieval (AT, MS), pp. 2–10.
TOOLSTOOLS-PACIFIC-1998-Taniar #traversal
Forward vs. Reverse Traversal in Path Expression Query Processing (DT), pp. 127–140.
PPDPALP-PLILP-1998-BruynoogheVWD #detection #logic programming #source code
Detecting Unsolvable Queries for Definite Logic Programs (MB, HV, DAdW, MD), pp. 118–133.
ICSEICSE-1998-BaniassadM #concept #re-engineering
Conceptual Module Querying for Software Reengineering (ELAB, GCM), pp. 64–73.
SACSAC-1998-KottkampZ #database #mobile
Location-aware query processing in mobile database systems (HEK, OZ), pp. 416–423.
SACSAC-1998-LazanoM #using
Querying virtual videos using path and temporal expressions (RL, HM), pp. 248–252.
SACSAC-1998-TrainaTSS #database #image #object-oriented
Support to content-based image query in object-oriented databases (CTJ, AJMT, RRdS, EYS), pp. 241–247.
HPDCHPDC-1998-LowekampMSGSS #interface
A Resource Query Interface for Network-Aware Applications (BL, NM, DS, TRG, PS, JS), pp. 189–196.
STOCSTOC-1998-Trevisan #testing
Recycling Queries in PCPs and in Linearity Tests (LT), pp. 299–308.
ADLADL-1997-SenguptaD #approach #database #visual notation
Query by Templates: A Generalized Approach for Visual Query Formulation for Text Dominated Databases (AS, AD), pp. 36–47.
DL-1997-ChangG #cost analysis
Evaluating the Cost of Boolean Query Mapping (KCCC, HGM), pp. 103–112.
DL-1997-CooperB #navigation #refinement #visual notation
Lexical Navigation: Visually Prompted Query Expansion and Refinement (JWC, RJB), pp. 237–246.
TPDLECDL-1997-SmeatonC #feedback #library #web
Relevance Feedback and Query Expansion for Searching the Web: A Model for Searching a Digital Library (AFS, FC), pp. 99–112.
HTHT-1997-Golovchinsky #hypermedia #information retrieval #integration #what
What the Query Told the Link: The Integration of Hypertext and Information Retrieval (GG), pp. 67–74.
PODSPODS-1997-AbiteboulV #constraints
Regular Path Queries with Constraints (SA, VV), pp. 122–133.
PODSPODS-1997-AlbertIR #equivalence #relational
Conjunctive Query Equivalence of Keyed Relational Schemas (JA, YEI, RR), pp. 44–50.
PODSPODS-1997-BeeriLR #logic #using
Rewriting Queries Using Views in Description Logics (CB, AYL, MCR), pp. 99–108.
PODSPODS-1997-DuschkaG #recursion #using
Answering Recursive Queries Using Views (OMD, MRG), pp. 109–116.
PODSPODS-1997-GoldsteinRSY #constraints #linear
Processing Queries By Linear Constraints (JG, RR, US, JBY), pp. 257–267.
PODSPODS-1997-GyssensBG #geometry
Complete Geometrical Query Languages (MG, JVdB, DVG), pp. 62–67.
PODSPODS-1997-HoBA #using
Partial-Sum Queries in Data Cubes Using Covering Codes (CTH, JB, RA), pp. 228–237.
PODSPODS-1997-IbarraS #constraints #database #equivalence #linear #on the
On the Containment and Equivalence of Database Queries with Linear Constraints (OHI, JS), pp. 32–43.
PODSPODS-1997-LevyS
Deciding Containment for Queries with Complex Objects (AYL, DS), pp. 20–31.
PODSPODS-1997-MendelzonM #formal method #modelling #web
Formal Models of Web Queries (AOM, TM), pp. 134–143.
PODSPODS-1997-PapadimitriouY #complexity #database #on the
On the Complexity of Database Queries (CHP, MY), pp. 12–19.
SIGMODSIGMOD-1997-GriffinH #framework #implementation
A Framework for Implementing Hypothetical Queries (TG, RH), pp. 231–242.
SIGMODSIGMOD-1997-HoAMS
Range Queries in OLAP Data Cubes (CTH, RA, NM, RS), pp. 73–88.
SIGMODSIGMOD-1997-KatayamaS #nearest neighbour
The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries (NK, SS), pp. 369–380.
SIGMODSIGMOD-1997-KornJF #ad hoc #dataset #scalability #sequence
Efficiently Supporting Ad Hoc Queries in Large Datasets of Time Sequences (FK, HVJ, CF), pp. 289–300.
SIGMODSIGMOD-1997-LiCHH #image #interface #named #retrieval #visual notation
SEMCOG: An Object-based Image Retrieval System and Its Visual Query Interface (WSL, KSC, KH, YH), pp. 521–524.
SIGMODSIGMOD-1997-LivnyRBCDLMW #dataset #named #scalability #visualisation
DEVise: Integrated Querying and Visualization of Large Datasets (ML, RR, KSB, GC, DD, SL, JM, RKW), pp. 301–312.
SIGMODSIGMOD-1997-LivnyRBCDLMW97a #dataset #named #scalability #visual notation
DEVise: Integrated Querying and Visual Exploration of Large Datasets (ML, RR, KSB, GC, DD, SL, JM, RKW), pp. 517–520.
SIGMODSIGMOD-1997-ONeilQ #performance
Improved Query Performance with Variant Indexes (PEO, DQ), pp. 38–49.
SIGMODSIGMOD-1997-RafieiM #similarity
Similarity-Based Queries for Time Series Data (DR, AOM), pp. 13–25.
VLDBVLDB-1997-ChatziantoniouR #relational
Groupwise Processing of Relational Queries (DC, KAR), pp. 476–485.
VLDBVLDB-1997-ChavdaW #towards #visual notation
Towards an ODMG-Compliant Visual Object Query Language (MC, PTW), pp. 456–465.
VLDBVLDB-1997-ClaussenKMP #database #object-oriented #optimisation #quantifier
Optimizing Queries with Universal Quantification in Object-Oriented and Object-Relational Databases (JC, AK, GM, KP), pp. 286–295.
VLDBVLDB-1997-GarofalakisI #optimisation #parallel #scheduling
Parallel Query Scheduling and Optimization with Time- and Space-Shared Resources (MNG, YEI), pp. 296–305.
VLDBVLDB-1997-GoldmanW #database #named #optimisation #semistructured data
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases (RG, JW), pp. 436–445.
VLDBVLDB-1997-HaasKWY #data flow #optimisation
Optimizing Queries Across Diverse Data Sources (LMH, DK, ELW, JY), pp. 276–285.
VLDBVLDB-1997-LiCHH #database #interface #multi #visual notation
Facilitating Multimedia Database Exploration through Visual Interfaces and Perpetual Query Reformulations (WSL, KSC, KH, YH), pp. 538–547.
VLDBVLDB-1997-VassalosP #using
Describing and Using Query Capabilities of Heterogeneous Sources (VV, YP), pp. 256–265.
CHICHI-1997-Golovchinsky #difference #question
Queries? Links? Is there a Difference? (GG), pp. 407–414.
HCIHCI-SEC-1997-SantucciT #interactive
Table Expander: Hypertabular Interaction with Query Results (GS, LT), pp. 731–734.
CIKMCIKM-1997-ChangKC #database #image #representation
A Spatial Match Representation Scheme for Indexing and Querying in Iconic Image Databases (JWC, YJK, KJC), pp. 169–176.
CIKMCIKM-1997-GauchW #analysis #approach #automation #corpus
A Corpus Analysis Approach for Automatic Query Expansion (SG, JW), pp. 278–284.
CIKMCIKM-1997-LiuU #framework #optimisation
A Framework for Global Optimization of Aggregate Queries (CL, AU), pp. 262–269.
CIKMCIKM-1997-YoonSP #data mining #mining #using
Intensional Query Processing Using Data Mining Approaches (SCY, IYS, EKP), pp. 201–208.
SIGIRSIGIR-1997-BallesterosC #information retrieval
Phrasal Translation and Query Expansion Techniques for Cross-language Information Retrieval (LB, WBC), pp. 84–91.
SIGIRSIGIR-1997-FitzpatrickD #automation #feedback #question #social #using
Automatic Feedback Using Past Queries: Social Searching? (LF, MD), pp. 306–313.
SIGIRSIGIR-1997-MagennisR #effectiveness #interactive
The Potential and Actual Effectiveness of Interactive Query Expansion (MM, CJvR), pp. 324–332.
SIGIRSIGIR-1997-SinghalMB #learning
Learning Routing Queries in a Query Zone (AS, MM, CB), pp. 25–32.
SIGIRSIGIR-1997-VelezWSG #effectiveness #performance #refinement
Fast and Effective Query Refinement (BV, RW, MAS, DKG), pp. 6–15.
UMLUML-1997-GogollaR #constraints #on the #uml
On Constraints and Queries in UML (MG, MR), pp. 109–121.
TOOLSTOOLS-ASIA-1997-WangWDR #framework
A Uniform Framework for Processing Temporal Object Queries (LW, MW, CD, NR), pp. 28–37.
SACSAC-1997-DuschkaG
Query Planning in Infomaster (OMD, MRG), pp. 109–111.
SACSAC-1997-Liu #algorithm #evaluation #execution #parallel #performance
Performance evaluation of processor allocation algorithms for parallel query execution (KHL), pp. 393–402.
SACSAC-1997-PerrizoZK #multi
A query processing method for data warehouses which contain multimedia (WP, ZZ, SK), pp. 323–327.
STOCSTOC-1997-Clarkson #metric #nearest neighbour
Nearest Neighbor Queries in Metric Spaces (KLC), pp. 609–617.
CAVCAV-1997-LindenstraussSS #logic programming #named #source code #termination
TermiLog: A System for Checking Termination of Queries to Logic Programs (NL, YS, AS), pp. 444–447.
ICLPILPS-1997-BressanGLMS
A Procedure for Mediation of Queries to Sources in Disparate Contexts (SB, CHG, TL, SEM, MS), pp. 213–227.
ADLADL-1996-DoanPS #information management
Query Previews in Networked Information Systems (KD, CP, BS), pp. 120–129.
PODSPODS-1996-AbiteboulHB #database #first-order #logic
Temporal Versus First-Order Logic to Query Temporal Databases (SA, LH, JVdB), pp. 49–57.
PODSPODS-1996-BenediktDLW #constraints #power of #relational
Relational Expressive Power of Constraint Query Languages (MB, GD, LL, LW), pp. 5–16.
PODSPODS-1996-GangulyGS #cost analysis #modelling #optimisation #parallel #performance
Efficient and Acurate Cost Models for Parallel Query Optimization (SG, AG, AS), pp. 172–181.
PODSPODS-1996-GyssensLS #paradigm
Tables as a Paradigm for Querying and Restructuring (MG, LVSL, INS), pp. 93–103.
PODSPODS-1996-LevyRU #using
Answering Queries Using Limited External Processors (AYL, AR, JDU), pp. 227–237.
PODSPODS-1996-PagelS #question
Are Window Queries Representative for Arbitrary Range Queries? (BUP, HWS), pp. 150–160.
PODSPODS-1996-PapadimitriouSV #database
Topological Queries in Spatial Databases (CHP, DS, VV), pp. 81–92.
PODSPODS-1996-StolboushkinT #database #linear #order
Linear vs. Order Contstrained Queries Over Rational Databases (APS, MAT), pp. 17–27.
PODSPODS-1996-Toman #database
Point vs. Interval-based Query Languages for Temporal Databases (DT), pp. 58–67.
SIGMODSIGMOD-1996-AdaliCPS #distributed #optimisation
Query Caching and Optimization in Distributed Mediator Systems (SA, KSC, YP, VSS), pp. 137–148.
SIGMODSIGMOD-1996-BunemanDHS #optimisation #semistructured data
A Query Language and Optimization Techniques for Unstructured Data (PB, SBD, GGH, DS), pp. 505–516.
SIGMODSIGMOD-1996-ChaudhuriG #multi #optimisation #repository
Optimizing Queries over Multimedia Repositories (SC, LG), pp. 91–102.
SIGMODSIGMOD-1996-ChristophidesCM
Evaluating Queries with Generalized Path Expressions (VC, SC, GM), pp. 413–422.
SIGMODSIGMOD-1996-FranklinJK #performance #trade-off
Performance Tradeoffs for Client-Server Query Processing (MJF, BÞJ, DK), pp. 149–160.
SIGMODSIGMOD-1996-GarofalakisI #parallel #scheduling
Multi-dimensional Resource Scheduling for Parallel Queries (MNG, YEI), pp. 365–376.
SIGMODSIGMOD-1996-GoelI #optimisation #order #sql
SQL Query Optimization: Reordering for a General Class of Queries (PG, BRI), pp. 47–56.
SIGMODSIGMOD-1996-HellersteinN #execution
Query Execution Techniques for Caching Expensive Methods (JMH, JFN), pp. 423–434.
SIGMODSIGMOD-1996-LibkinMW #array #design #implementation #multi #optimisation
A Query Language for Multidimensional Arrays: Design, Implementation, and Optimization Techniques (LL, RM, LW), pp. 228–239.
SIGMODSIGMOD-1996-RaoBG
Providing Better Support for a Class of Decision Support Queries (SR, AB, DVG), pp. 217–227.
VLDBVLDB-1996-BerckenS #data access #multi
Query Processing Techniques for Multiversion Access Methods (JVdB, BS), pp. 168–179.
VLDBVLDB-1996-CareyHMW #database
PESTO : An Integrated Query/Browser for Object Databases (MJC, LMH, VM, JHW), pp. 203–214.
VLDBVLDB-1996-Celis #sql
The Query Optimizer in Tandem’s new ServerWare SQL Product (PC), p. 592.
VLDBVLDB-1996-ChatziantoniouR #database #multi #relational
Querying Multiple Features of Groups in Relational Databases (DC, KAR), pp. 295–306.
VLDBVLDB-1996-ChaudhuriS #optimisation
Optimization of Queries with User-defined Predicates (SC, KS), pp. 87–98.
VLDBVLDB-1996-Cuppens #analysis #database #logic #multi
Querying a Multilevel Database: A Logical Analysis (FC), pp. 484–494.
VLDBVLDB-1996-GardarinST #cost analysis #database #object-oriented
Calibrating the Query Optimizer Cost Model of IRO-DB, an Object-Oriented Federated Database System (GG, FS, ZHT), pp. 378–389.
VLDBVLDB-1996-LevyRO #using
Querying Heterogeneous Information Sources Using Source Descriptions (AYL, AR, JJO), pp. 251–262.
VLDBVLDB-1996-McKennaBHT #named #tool support
EROC: A Toolkit for Building NEATO Query Optimizers (WJM, LB, CH, MT), pp. 111–121.
VLDBVLDB-1996-SarawagiS #database #execution #memory management #order
Reordering Query Execution in Tertiary Memory Databases (SS, MS), pp. 156–167.
VLDBVLDB-1996-SrivastavaDJL #using
Answering Queries with Aggregation Using Views (DS, SD, HVJ, AYL), pp. 318–329.
VLDBVLDB-1996-Suciu #composition #maintenance #semistructured data
Query Decomposition and View Maintenance for Query Languages for Unstructured Data (DS), pp. 227–238.
VLDBVLDB-1996-Suciu96a #analysis #implementation #parallel
Implementation and Analysis of a Parallel Collection Query Language (DS), pp. 366–377.
KDDAKDDM-1996-HsuK #induction #learning #optimisation #semantics #using
Using Inductive Learning To Generate Rules for Semantic Query Optimization (CNH, CAK), pp. 425–445.
CIKMCIKM-1996-BayardoM
Processing Queries for First Few Answers (RJBJ, DPM), pp. 45–52.
CIKMCIKM-1996-HuangJR #clustering #database #effectiveness #graph
Effective Graph Clustering for Path Queries in Digital Map Databases (YWH, NJ, EAR), pp. 215–222.
CIKMCIKM-1996-LeeO #automation #distributed
Distributed Processing of Time-Constrained Queries in CASE-DB (SL, ), pp. 279–287.
CIKMCIKM-1996-LeePHC #composition #using
Spatial Query Processing Using Object Decomposition Method (YJL, HHP, NHH, CWC), pp. 53–61.
CIKMCIKM-1996-LinO #algebra
Processing OODB Queries by O-Algebra (JL, ZMÖ), pp. 134–142.
CIKMCIKM-1996-OzcanNKED #distributed #framework #optimisation #platform
Dynamic Query Optimization on a Distributed Object Management Platform (, SN, PK, CE, AD), pp. 117–124.
CIKMCIKM-1996-Pulido #graph #recursion #traversal #using
Recursive Query Processing Using Graph Traversal Techniques (EP), pp. 37–44.
CIKMCIKM-1996-ShinKC #named #performance
S-signature: A New Scheme for Efficient Query Processing of Complex Objects in OODB (HS, KK, JWC), pp. 207–214.
ICPRICPR-1996-SofferS #image #similarity
Pictorial queries by image similarity (AS, HS), pp. 114–119.
KDDKDD-1996-ImielinskiVA #database #interface #mining #named #programming
DataMine: Application Programming Interface and Query Language for Database Mining (TI, AV, AA), pp. 256–262.
KDDKDD-1996-RyuE #programming #search-based #using
Deriving Queries from Results Using Genetic Programming (TWR, CFE), pp. 303–306.
KRKR-1996-BorgidaM
Asking Queries about Frames (AB, DLM), pp. 340–349.
SEKESEKE-1996-CheeJR #process
An Intelligent Process for Formulating and Anwering Project Queries (CLC, SJ, CVR), pp. 309–316.
SEKESEKE-1996-PaulKGDS #database #interface #metric #visual notation
A Visual Query Interface for Software Metrics Databases (RAP, AK, AG, YFD, YS), pp. 317–322.
SEKESEKE-1996-YoonH #framework #object-oriented #optimisation #semantics
Finding Interesting Knowledge in Object-Oriented Frameworks for Semantic Query Optimization (SCY, LJH), pp. 108–115.
SIGIRSIGIR-1996-HullG #approach #information retrieval #multi
Querying Across Languages: A Dictionary-Based Approach to Multilingual Information Retrieval (DAH, GG), pp. 49–57.
SIGIRSIGIR-1996-JarvelinKNSK #deduction
A Deductive Data Model for Query Expansion (KJ, JK, TN, ES, HK), pp. 235–243.
SIGIRSIGIR-1996-Kwok #ad hoc #retrieval
A New Method of Weighting Query Terms for Ad-Hoc Retrieval (KLK), pp. 187–195.
SIGIRSIGIR-1996-LiuLYR #2d #memory management #performance #proximity
Efficient Processing of One and Two Dimensional Proximity Queries in Associative Memory (KLL, GJL, CTY, NR), pp. 138–146.
SIGIRSIGIR-1996-XuC #analysis #documentation #using
Query Expansion Using Local and Global Document Analysis (JX, WBC), pp. 4–11.
OOPSLAOOPSLA-1996-NishimuraOT #equation #object-oriented
An Equational Object-Oriented Data Model and its Data-Parallel Query Language (SN, AO, KT), pp. 1–17.
SACSAC-1996-BordognaBP #database #fuzzy #information retrieval
Fuzzy inclusion in database and information retrieval query interpretation (GB, PB, GP), pp. 547–551.
SACSAC-1996-HarangsriSN #classification #multi #optimisation #using
Query optimisation in multidatabase systems using query classification (BH, JS, AHHN), pp. 173–177.
SACSAC-1996-LeeL #concurrent #constraints #incremental
Incremental querying in the concurrent CLP language IFD-Constraint Pandora (JHML, HfL), pp. 387–392.
SACSAC-1996-LiuC #algorithm #distributed #heuristic
A heuristic algorithm for partition strategy in distributed query processing (CL, HC), pp. 196–200.
SACSAC-1996-PetkovicNFSLYHTTDGVVHHWEB #image
Recent applications of IBM’s query by image content (QBIC) (DP, WN, MF, DS, DL, JY, JH, FT, HT, RD, MG, MV, PV, BJH, JH, KW, PE, CB), pp. 2–6.
SACSAC-1996-ZadroznyK #consistency #towards #user interface
FQUERY for Access: towards human consistent querying user interface (SZ, JK), pp. 532–536.
HPCAHPCA-1996-YangSD #parallel
Parallel Intersecting Compressed Bit Vectors in a High Speed Query Server for Processing Postal Addresses (WjY, RS, VD), pp. 232–241.
STOCSTOC-1996-AngluinWZ #navigation
Robot Navigation with Range Queries (DA, JW, WZ), pp. 469–478.
STOCSTOC-1996-BergadanoCV #learning
Learning Sat-k-DNF Formulas from Membership Queries (FB, DC, SV), pp. 126–130.
CSLCSL-1996-Dziembowski #bound #fixpoint
Bounded-Variable Fixpoint Queries are PSPACE-complete (SD), pp. 89–105.
ICLPJICSLP-1996-Mesnard #constraints #logic programming #source code
Inferring Left-terminating Classes of Queries for Constraint Logic Programs (FM), pp. 7–21.
ICLPJICSLP-1996-ZukowskiF #database #evaluation #flexibility
Adding Flexibility to Query Evaluation for Modularly Stratified Databases (UZ, BF), pp. 304–318.
LICSLICS-1996-BenediktL #constraints #on the
On the Structure of Queries in Constraint Query Languages (MB, LL), pp. 25–34.
DL-1995-VeerasamyN #library #navigation #visualisation
Querying, Navigating, and Visualizing a Digital Library Catalog (AV, SBN).
ICDARICDAR-v1-1995-LiangLY
False hits of tri-syllabic queries in a Chinese signature file (TL, SYL, WPY), pp. 159–162.
PODSPODS-1995-ChekuriHM #optimisation #parallel #problem #scheduling
Scheduling Problems in Parallel Query Optimization (CC, WH, RM), pp. 255–265.
PODSPODS-1995-ConsensM #algebra
Algebras for Querying Text Regions (MPC, TM), pp. 11–22.
PODSPODS-1995-JagadishMM #similarity
Similarity-Based Queries (HVJ, AOM, TM), pp. 36–45.
PODSPODS-1995-LevyMSS #using
Answering Queries Using Views (AYL, AOM, YS, DS), pp. 95–104.
PODSPODS-1995-LevyS #datalog #optimisation #semantics #source code
Semantic Query Optimization in Datalog Programs (AYL, YS), pp. 163–173.
PODSPODS-1995-Papadimitriou #database
Database Metatheory: Asking the Big Queries (CHP), pp. 1–10.
PODSPODS-1995-RajaramanSU #using
Answering Queries Using Templates with Binding Patterns (AR, YS, JDU), pp. 105–112.
PODSPODS-1995-Rougemont #reliability
The Reliability of Queries (MdR), pp. 286–291.
PODSPODS-1995-StoloboushkinT #effectiveness #finite #syntax
Finite Queries do not Have Effective Syntax (APS, MAT), pp. 277–285.
PODSPODS-1995-Vardi #bound #complexity #on the
On the Complexity of Bounded-Variable Queries (MYV), pp. 266–276.
SIGMODSIGMOD-1995-AshleyFHLNP #image
The Query By Image Content (QBIC) System (JA, MF, JLH, DL, WN, DP), p. 475.
SIGMODSIGMOD-1995-BettiniWBJ #database #evaluation #semantics
Semantic Assumptions and Query Evaluation in Temporal Databases (CB, XSW, EB, SJ), pp. 257–268.
SIGMODSIGMOD-1995-BhargavaGI
Hypergraph Based Reorderings of Outer Join Queries with Complex Predicates (GB, PG, BRI), pp. 304–315.
SIGMODSIGMOD-1995-BrodskyK #constraints
The LyriC Language: Querying Constraint Objects (AB, YK), pp. 35–46.
SIGMODSIGMOD-1995-ChaudhuriDY #execution #optimisation
Join Queries with External Text Sources: Execution and Optimization Techniques (SC, UD, TWY), pp. 410–422.
SIGMODSIGMOD-1995-DavisonG #execution #multi
Dynamic Resource Brokering for Multi-User Query Execution (DLD, GG), pp. 281–292.
SIGMODSIGMOD-1995-DuSD #multi
Reducing Multidatabase Query Response Time by Tree Balancing (WD, MCS, UD), pp. 293–303.
SIGMODSIGMOD-1995-FegarasM #calculus #effectiveness #towards
Towards an Effective Calculus for Object Query Languages (LF, DM), pp. 47–58.
SIGMODSIGMOD-1995-GardarinMP #execution #functional #named
OFL: A Functional Execution Model for Object Query Languages (GG, FM, PP), pp. 59–70.
SIGMODSIGMOD-1995-IoannidisP #estimation
Balancing Histogram Optimality and Practicality for Query Result Size Estimation (YEI, VP), pp. 233–244.
SIGMODSIGMOD-1995-MassariPSC #named
QBI: Query By Icons (AM, SP, LS, PKC), p. 477.
SIGMODSIGMOD-1995-RoussopoulosKV #nearest neighbour
Nearest Neighbor Queries (NR, SK, FV), pp. 71–79.
SIGMODSIGMOD-1995-WilschutFA #evaluation #parallel
Parallel Evaluation of Multi-Join Queries (ANW, JF, PMGA), pp. 115–126.
VLDBVLDB-1995-AgrawalPWZ
Querying Shapes of Histories (RA, GP, ELW, MZ), pp. 502–514.
VLDBVLDB-1995-BelussiF #correlation #using
Estimating the Selectivity of Spatial Queries Using the “Correlation” Fractal Dimension (AB, CF), pp. 299–310.
VLDBVLDB-1995-FlodinR #bound #object-oriented
Processing Object-Oriented Queries with Invertible Late Bound Functions (SF, TR), pp. 335–344.
VLDBVLDB-1995-HasanM #communication #optimisation #parallel
Coloring Away Communication in Parallel Query Optimization (WH, RM), pp. 239–250.
VLDBVLDB-1995-KonopnickiS #named #web
W3QS: A Query System for the World-Wide Web (DK, OS), pp. 54–65.
VLDBVLDB-1995-LuTD #adaptation #approach #optimisation
The Fittest Survives: An Adaptive Approach to Query Optimization (HL, KLT, SD), pp. 251–262.
VLDBVLDB-1995-Sarawagi #database #memory management
Query Processing in Tertiary Memory Databases (SS), pp. 585–596.
VLDBVLDB-1995-SteinbrunnPMK
Bypassing Joins in Disjunctive Queries (MS, KP, GM, AK), pp. 228–238.
VLDBVLDB-1995-SubietaKL #object-oriented
Procedures in Object-Oriented Query Languages (KS, YK, JL), pp. 182–193.
VLDBVLDB-1995-Wang #implementation #parallel #staging
DB2 Query Parallelism: Staging and Implementation (YW), pp. 686–691.
ICALPICALP-1995-ChaudhuriZ #graph
Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.
CHICHI-1995-FishkinS
Enhanced Dynamic Queries via Movable Filters (KPF, MCS), pp. 415–420.
CIKMCIKM-1995-HameurlainM #execution #parallel #scheduling #sql
Scheduling and Mapping for Parallel Execution of Extended SQL Queries (AH, FM), pp. 197–204.
CIKMCIKM-1995-IkejiF #adaptation #using
Computation of Partial Query Results Using An Adaptive Stratified Sampling Technique (ACI, FF), pp. 145–149.
CIKMCIKM-1995-OzsuMS
An Extensible Query Optimizer for an Objectbase Management System (MTÖ, AM, DS), pp. 188–196.
CIKMCIKM-1995-ShrufiT #knowledge base #using
Query Processing for Knowledge Bases Using Join Indices (AS, TT), pp. 158–166.
CIKMCIKM-1995-Wang #algebra #database #multi
Algebraic Query Languages on Temporal Databases with Multiple Time Granularities (XSW), pp. 304–311.
CIKMCIKM-1995-YoonSP #approach #database #deduction #object-oriented #semantics #using
Semantic Query Processing in Object-Oriented Databases Using Deductive Approach (SCY, IYS, EKP), pp. 150–157.
KDDKDD-1995-Siebes #induction
Data Surveying: Foundations of an Inductive Query Language (AS), pp. 269–274.
SEKESEKE-1995-Miur #optimisation #visual notation
Optimizing Complex Objects Queries in A Visual Data Manipulation Language (TM), pp. 153–157.
SEKESEKE-1995-PanY #database #named #object-oriented
EQL: A Learn-Easy and Use-Easy Query Language for Object-Oriented Databases (WWP, WPY), pp. 366–373.
SEKESEKE-1995-YoonK #database #deduction #object-oriented #semantics
Semantic Query Processing in Deductive Object-Oriented Databases (SCY, CSK), pp. 358–365.
SIGIRSIGIR-1995-Brown #evaluation #information retrieval #performance
Fast Evaluation of Structured Queries for Information Retrieval (EWB0), pp. 30–38.
SIGIRSIGIR-1995-NavarroB
A Language for Queries on Structure and Contents of Textual (GN, RABY), pp. 93–101.
SIGIRSIGIR-1995-PfeiferF #approach #data type #performance #using
Efficient Processing of Vague Queries using a Data Stream Approach (UP, NF), pp. 189–197.
SIGIRSIGIR-1995-RaghavanS #on the #reuse #using
On the Reuse of Past Optimal Queries (VVR, HS), pp. 344–350.
PPDPPLILP-1995-ShimajiriSI #database #logic
Goal-Directed Query Processing in Disjunctive Logic Databases (YS, HS, HI), pp. 415–430.
SACSAC-1995-BoscLP #flexibility #quantifier #relational
Quantified statements in a flexible relational query language (PB, LL, OP), pp. 488–492.
SACSAC-1995-PandaP #cost analysis #execution
Query execution in prism and seaview: a cost analysis (BP, WP), pp. 65–70.
SACSAC-1995-PerrizoG
Domain vector hashing for earth system data querying (WP, VNRG), pp. 71–75.
STOCSTOC-1995-HellersteinPRW #how #question
How many queries are needed to learn? (LH, KP, VR, DW), pp. 190–199.
STOCSTOC-1995-KavrakiLMR #random
Randomized query processing in robot path planning (LEK, JCL, RM, PR), pp. 353–362.
ICLPICLP-1995-NilssonTW #deduction #distributed #memory management #named #realtime
Amnesia — A Distributed Real-Time Primary Memory DBMS with a Deductive Query Language (HN, TT, CW), p. 821.
ICLPICLP-1995-ShimajiriSI #database #logic
Making Query Processing Goal-Directed in Disjunctive Logic Databases (YS, HS, HI), p. 820.
LICSLICS-1995-ParedaensBG #finite #first-order
First-order Queries on Finite Structures over the Reals (JP, JVdB, DVG), pp. 79–87.
HTHT-ECHT-1994-AmannSR #multi
Querying Typed Hypertexts in Multicard/O2 (BA, MS, AR), pp. 198–205.
HTHT-ECHT-1994-ChristophidesR #documentation #hypermedia #using
Querying Structured Documents with Hypertext Links using OODBMS (VC, AR), pp. 186–197.
PODSPODS-1994-Afrati #bound #datalog #exclamation #graph
Bounded Arity Datalog (!=) Queries on Graphs (FNA), pp. 97–106.
PODSPODS-1994-ColbyRSG
A Query Language for List-Based Complex Objects (LSC, ELR, LVS, DVG), pp. 179–189.
PODSPODS-1994-HillebrandK #database #functional #order #λ-calculus
Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (GGH, PCK), pp. 222–231.
PODSPODS-1994-ParedaensBG #database #formal method #towards
Towards a Theory of Spatial Database Queries (JP, JVdB, DVG), pp. 279–288.
PODSPODS-1994-StuckeyS #compilation #constraints
Compiling Query Constraints (PJS, SS), pp. 56–67.
PODSPODS-1994-SuciuT
A Query Language for NC (DS, VT), pp. 167–178.
SIGMODSIGMOD-1994-BrinkhoffKSS94a #named #performance
GENESYS: A System for Efficient Spatial Query Processing (TB, HPK, RS, BS), p. 519.
SIGMODSIGMOD-1994-CatarciS #database #diagrams #visual notation
Query by Diagram: A Graphical Environment for Querying Databases (TC, GS), p. 515.
SIGMODSIGMOD-1994-ChenR #adaptation #estimation #feedback #using
Adaptive Selectivity Estimation Using Query Feedback (CMC, NR), pp. 161–172.
SIGMODSIGMOD-1994-ChristophidesACS #documentation #novel
From Structured Documents to Novel Query Facilities (VC, SA, SC, MS), pp. 313–324.
SIGMODSIGMOD-1994-ColeG #evaluation #optimisation
Optimization of Dynamic Query Evaluation Plans (RLC, GG), pp. 150–160.
SIGMODSIGMOD-1994-ConsensM #optimisation
Optimizing Queries on Files (MPC, TM), pp. 301–312.
SIGMODSIGMOD-1994-DewanSHH #distributed #parallel #predict
Predictive Dynamic Load Balancing of Parallel and Distributed Rule and Query Processing (HMD, SJS, MAH, JJH), pp. 277–288.
SIGMODSIGMOD-1994-KemperMPS #optimisation
Optimizing Disjunctive Queries with Expensive Predicates (AK, GM, KP, MS), pp. 336–347.
SIGMODSIGMOD-1994-PangCL #memory management #realtime
Managing Memory for Real-Time Queries (HP, MJC, ML), pp. 221–232.
SIGMODSIGMOD-1994-SeshadriLR #sequence
Sequence Query Processing (PS, ML, RR), pp. 430–441.
VLDBVLDB-1994-ChaudhuriS #optimisation
Including Group-By in Query Optimization (SC, KS), pp. 354–366.
VLDBVLDB-1994-Guting #database #graph #modelling #named
GraphDB: Modeling and Querying Graphs in Databases (RHG), pp. 297–308.
VLDBVLDB-1994-HjelsvoldM #modelling #video
Modelling and Querying Video Data (RH, RM), pp. 686–694.
VLDBVLDB-1994-LevyMS #optimisation
Query Optimization by Predicate Move-Around (AYL, ISM, YS), pp. 96–107.
VLDBVLDB-1994-PoulovassilisS #algebra #database #optimisation #programming language
Investigation of Algebraic Query Optimisation Techniques for Database Programming Languages (AP, CS), pp. 415–426.
VLDBVLDB-1994-ShatdalKN #algorithm #relational
Cache Conscious Algorithms for Relational Query Processing (AS, CK, JFN), pp. 510–521.
VLDBVLDB-1994-SteenhagenABB
From Nested-Loop to Join Queries in OODB (HJS, PMGA, HMB, RAdB), pp. 618–629.
ICSMEICSM-1994-PaulP #algebra #source code #using
Querying Source Code Using an Algebraic Query Language (SP, AP), pp. 127–136.
CHICHI-1994-AhlbergS94c #visual notation
Visual information seeking: tight coupling of dynamic query filters with starfield displays (CA, BS), pp. 313–317.
CHICHI-1994-GoldsteinR94a #scalability #set #using
Using aggregation and dynamic queries for exploring large data sets (JG, SFR), pp. 23–29.
CAiSECAiSE-1994-AbererKF #database #design #object-oriented
Designing a User-Oriented Query Modification Facility in Object-Oriented Database Systems (KA, WK, ALF), pp. 380–393.
CAiSECAiSE-1994-Rosengren #using #visual notation
Using Visual ER Query Systems in Real World Applications (PR), pp. 394–405.
CIKMCIKM-1994-AlhajjP #maintenance #object-oriented
Closure Maintenance in An Object-Oriented Query Model (RA, FP), pp. 72–79.
CIKMCIKM-1994-KwonKC #adaptation #using
Query Expansion Using Domain Adapted, Weighted Thesaurus in an Extended Boolean Model (OWK, MCK, KSC), pp. 140–146.
CIKMCIKM-1994-LeeL #database #object-oriented #using
Using Path Information for Query Processing in Object-Oriented Database Systems (DLL, WCL), pp. 64–71.
CIKMCIKM-1994-YoonSP #database #deduction #object-oriented
Intelligent Query Answering in Deductive and Object-Oriented Databases (SCY, IYS, EKP), pp. 244–251.
ICMLICML-1994-CravenS #network #using
Using Sampling and Queries to Extract Rules from Trained Neural Networks (MC, JWS), pp. 37–45.
ICMLICML-1994-HsuK #optimisation #semantics
Rule Introduction for Semantic Query Optimization (CNH, CAK), pp. 112–120.
KDDKDD-1994-AnandBH #architecture #database #mining #optimisation #preprocessor #semantics
Database Mining in the Architecture of a Semantic Preprocessor for State Aware Query Optimization (SSA, DAB, JGH), pp. 287–298.
KDDKDD-1994-HsuK #induction #optimisation #semantics
Rule Induction for Semantic Query Optimization (CNH, CAK), pp. 311–322.
KRKR-1994-CadoliEG #logic
Default Logic as a Query Language (MC, TE, GG), pp. 99–108.
SEKESEKE-1994-GuoSRD #database #optimisation #reduction #semantics
Semantic query optimization by class reference reduction in object- oriented databases (SG, WS, NR, YD), pp. 306–313.
SIGIRSIGIR-1994-Spink #design #feedback
Term Relevance Feedback and Query Expansion: Relation to Design (AS), pp. 81–90.
SIGIRSIGIR-1994-Turtle #comparison #evaluation #natural language #performance #retrieval
Natural Language vs. Boolean Query Evaluation: A Comparison of Retrieval Performance (HRT), pp. 212–220.
SIGIRSIGIR-1994-Voorhees #semantics #using
Query Expansion Using Lexical-Semantic Relations (EMV), pp. 61–69.
SACSAC-1994-BordognaP #fuzzy
A fuzzy query language with a linguistic hierarchical aggregator (GB, GP), pp. 184–187.
SACSAC-1994-BoscP #database #fuzzy #relational
Fuzzy queries and relational databases (PB, OP), pp. 170–174.
SACSAC-1994-GhazalO #constraints #source code #termination
Termination of programs in constraint query languages (AG, AMO), pp. 266–270.
SACSAC-1994-LeeL #concurrent #constraints #incremental #logic programming #named #nondeterminism #towards
IQ: towards incremental query processing in non-deterministic concurrent constraint logic programming (JHML, HfL), pp. 405–409.
SACSAC-1994-PandaPH #database #multi #transaction
Secure transaction management and query processing in multilevel secure database systems (BP, WP, RAH), pp. 363–368.
STOCSTOC-1994-BlumFJKMR #analysis #fourier #learning #statistics #using
Weakly learning DNF and characterizing statistical query learning using Fourier analysis (AB, MLF, JCJ, MJK, YM, SR), pp. 253–262.
CADECADE-1994-Iwanuma #normalisation #parallel
Conservative Query Normalization on Parallel Circumscription (KI), pp. 296–310.
CADECADE-1994-RoyerQ #on the
On Intuitionistic Query Answering in Description Bases (VR, JQ), pp. 326–340.
ICLPILPS-1994-RamakrishnanRSS #evaluation #incremental #performance
Efficient Incremental Evaluation of Queries with Aggregation (RR, KAR, DS, SS), pp. 204–218.
HTHT-1993-CharoenkitkarnTCG #design
Browsing Through Querying: Designing for Electronic Books (NC, JT, MHC, GG), pp. 206–216.
PODSPODS-1993-ChaudhuriV #optimisation
Optimization of Real Conjunctive Queries (SC, MYV), pp. 59–70.
PODSPODS-1993-ChenW #evaluation #semantics
Query Evaluation under the Well Founded Semantics (WC, DSW), pp. 168–179.
PODSPODS-1993-Escobar-MolanoHJ #calculus #safety
Safety and Translation of Calculus Queries with Scalar Functions (MEM, RH, DJ), pp. 253–264.
PODSPODS-1993-LibkinW #semantics
Semantic Representations and Query Languages for Or-sets (LL, LW), pp. 37–48.
PODSPODS-1993-PagelSTW #analysis #data type #performance #towards
Towards an Analysis of Range Query Performance in Spatial Data Structures (BUP, HWS, HT, PW), pp. 214–221.
PODSPODS-1993-Wong #normalisation
Normal Forms and Conservative Properties for Query Languages over Collection Types (LW), pp. 26–36.
SIGMODSIGMOD-1993-BlakeleyMG #case study #experience
Experiences Building the Open OODB Query Optimizer (JAB, WJM, GG), pp. 287–296.
SIGMODSIGMOD-1993-ConsensM #visualisation
Hy+: A Hygraph-based Query and Visualization System (MPC, AOM), pp. 511–516.
SIGMODSIGMOD-1993-Guting #higher-order #modelling #optimisation #specification
Second-Order Signature: A Tool for Specifying Data Models, Query Processing, and Optimization (RHG), pp. 277–286.
SIGMODSIGMOD-1993-HellersteinS #migration #optimisation
Predicate Migration: Optimizing Queries with Expensive Predicates (JMH, MS), pp. 267–276.
VLDBVLDB-1993-AbiteboulCM
Querying and Updating the File (SA, SC, TM), pp. 73–84.
VLDBVLDB-1993-ChaudhuriS #optimisation
Query Optimization in the Presence of Foreign Functions (SC, KS), pp. 529–542.
VLDBVLDB-1993-ChenR93a #adaptation #database #feedback #using
Adaptive Database Buffer Allocation Using Query Feedback (CMC, NR), pp. 342–353.
VLDBVLDB-1993-Cohen #database #scalability
A Practical Issue Concerning Very Large Data Bases: The Need for Query Governors (GC), pp. 705–706.
VLDBVLDB-1993-KemperMP #architecture #optimisation
A Blackboard Architecture for Query Optimization in Object Bases (AK, GM, KP), pp. 543–554.
VLDBVLDB-1993-LevyS #independence
Queries Independent of Updates (AYL, YS), pp. 171–181.
VLDBVLDB-1993-MitchellDZ #approach
Control of an Extensible Query Optimizer: A Planning-Based Approach (GM, UD, SBZ), pp. 517–528.
FMFME-1993-KalinichenkoNZ #composition #development #semantics #synthesis
Application of Composition Development Method for definition of SYNTHESIS information resource query language semantics (LAK, NSN, VZ), pp. 428–441.
HCIHCI-SHI-1993-StaesT #recursion #visual notation
OOQBE*: An Intuitive Graphical Query Language with Recursion (FS, LT), pp. 603–608.
HCIHCI-SHI-1993-TrabelsiKN #database #generative #heuristic #interface #natural language
Heuristics for Generating Informative Responses to Failing User’s Queries in Natural Language Database Interfaces (ZT, YK, HN), pp. 362–367.
CIKMCIKM-1993-CosarLS #bound #multi #optimisation
Multiple Query Optimization with Depth-First Branch-and-Bound and Dynamic Query Ordering (AC, EPL, JS), pp. 433–438.
CIKMCIKM-1993-Derr #adaptation #database #deduction #optimisation
Adaptive Query Optimization in a Deductive Database System (MAD), pp. 206–215.
CIKMCIKM-1993-Devanbu #logic
Translating Description Logics to Information Server Queries (PTD), pp. 256–263.
CIKMCIKM-1993-HsuK #multi
Reformulating Query Plans for Multidatabase Systems (CNH, CAK), pp. 423–432.
CIKMCIKM-1993-LimS #database #optimisation
Query Optimization and Processing in Federated Database Systems (EPL, JS), pp. 720–722.
CIKMCIKM-1993-MontesiB #constraints #transaction
Queries, Constraints, Updates and Transactions Within a Logic-Based Language (DM, EB), pp. 500–506.
CIKMCIKM-1993-NaqviIKV #database #evaluation
Speculative Query Evaluation over Databases of Plans (SAN, TI, MK, KVV), pp. 439–450.
CIKMCIKM-1993-OliveiraA #database #object-oriented
Browsing and Querying in Object-Oriented Database (JLdO, RdOA), pp. 364–373.
CIKMCIKM-1993-PetersLOS #behaviour
An Extensible Query Model and Its Languages for a Uniform Behavioral Object Management System (RJP, AL, MTÖ, DS), pp. 403–412.
CIKMCIKM-1993-RaschidCD #multi
Interoperable Query Processing with Multiple Heterogeneous Knowledge Servers (LR, YC, BJD), pp. 461–470.
CIKMCIKM-1993-Saraiya
Projection-Propagation in Complex-Object Query Languages (YPS), pp. 413–422.
CIKMCIKM-1993-Xie #encapsulation #optimisation
Optimization of Object Queries Containing Encapsulated Methods (ZX), pp. 451–460.
CIKMCIKM-1993-ZhangOCF #data type #optimisation #using
A Method of Using Semijoins to Optimizing Queries with ADT Functions (XZ, NO, HC, YF), pp. 723–725.
ICMLICML-1993-Tadepalli #bias #learning
Learning from Queries and Examples with Tree-structured Bias (PT), pp. 322–329.
SEKESEKE-1993-LiuWN #documentation #retrieval
An OI5ce Document Retrieval System with the Capability of Processing Incomplete and Vague Queries (QL, JTLW, PAN), pp. 11–17.
SEKESEKE-1993-Semmel #information management #representation
Knowledge Representation for Intelligent Query Processing (RDS), pp. 18–27.
SEKESEKE-1993-YoshitakaHI #framework
A Framework for Query Processing Utilizing Knowledge (AY, MH, TI), pp. 1–10.
SIGIRSIGIR-1993-AktugC #analysis #multi
Analysis of Multiterm Queries in a Dynamic Signature File Organization (DA, FC), pp. 96–105.
SIGIRSIGIR-1993-BelkinCCC #information retrieval #multi #performance
Effect of Multiple Query Representations on Information Retrieval System Performance (NJB, CC, WBC, JPC), pp. 339–346.
SIGIRSIGIR-1993-CallanC #evaluation #using
An Evaluation of Query Processing Strategies Using the TIPSTER Collection (JPC, WBC), pp. 347–355.
SIGIRSIGIR-1993-Efthimiadis #evaluation #interactive #ranking
A User-Centered Evaluation of Ranking Algorithims for Interactive Query Expansion (ENE), pp. 146–159.
SIGIRSIGIR-1993-QiuF #concept
Concept Based Query Expansion (YQ, HPF), pp. 160–169.
SACSAC-1993-Phillips #database
Stream Driven Query Processing in a Database (NCKP), pp. 593–597.
DACDAC-1993-LaiFW #data type #performance
HV/VH Trees: A New Spatial Data Structure for Fast Region Queries (GGL, DSF, DFW), pp. 43–47.
STOCSTOC-1993-CohenBKT #data type
Reinventing the wheel: an optimal data structure for connectivity queries (RFC, GDB, AK, RT), pp. 194–200.
STOCSTOC-1993-Kearns #learning #performance #statistics
Efficient noise-tolerant learning from statistical queries (MJK), pp. 392–401.
ICLPICLP-1993-KempS #analysis #constraints #optimisation
Analysis Based Constraint Query Optimization (DBK, PJS), pp. 666–682.
ICLPILPS-1993-BerryE #generative #recursion
Generating Goals and Their Use In Recursive Query Processing (VB, ), p. 649.
ICLPILPS-1993-DongL #approach #deduction
A Deductive Approach to Hypothetical Query Answering (FD, LVSL), pp. 609–628.
ICLPILPS-1993-Drabent
Completeness of SLDNF-Resolution for Non-Floundering Queries (WD), p. 643.
ICLPILPS-1993-GrecoSZ #logic #optimisation #programming
Dynamic Programming Optimization for Logic Queries with Aggregates (SG, DS, CZ), pp. 575–589.
HTHT-ECHT-1992-AmannS #graph #named
Gram: A Graph Data Model and Query Language (BA, MS), pp. 201–211.
PODSPODS-1992-AbiteboulCV
Queries Are Easier Than You Thought (Probably) (SA, KJC, VV), pp. 23–32.
PODSPODS-1992-Chan
Containment and Minimization of Positive Conjunctive Queries in OODB’s (EPFC), pp. 202–211.
PODSPODS-1992-Dong #datalog #tool support
Datalog Expressiveness of Chain Queries: Grammar Tools and Characterizations (GD), pp. 81–90.
PODSPODS-1992-GinsburgW #approach #pattern matching #towards
Pattern Matching by Rs-Operations: Toward a Unified Approach to Querying Sequenced Data (SG, XSW), pp. 293–300.
PODSPODS-1992-Greiner #learning #performance
Learning Efficient Query Processing Strategies (RG), pp. 33–46.
PODSPODS-1992-Jakobsson #evaluation #on the
On Tree-Based Techniques for Query Evaluation (HJ), pp. 380–392.
PODSPODS-1992-Meyden #complexity #order
The Complexity of Querying Indefinite Data about Linearly Ordered Domains (RvdM), pp. 331–345.
SIGMODSIGMOD-1992-CluetD #framework #object-oriented #optimisation
A General Framework for the Optimization of Object-Oriented Queries (SC, CD), pp. 383–392.
SIGMODSIGMOD-1992-GangulyHK #execution #optimisation #parallel
Query Optimization for Parallel Execution (SG, WH, RK), pp. 9–18.
SIGMODSIGMOD-1992-HaasS #estimation
Sequential Sampling Procedures for Query Size Estimation (PJH, ANS), pp. 341–350.
SIGMODSIGMOD-1992-KiferKS #database #object-oriented
Querying Object-Oriented Databases (MK, WK, YS), pp. 393–402.
SIGMODSIGMOD-1992-LanzelotteVZ #object-oriented #optimisation #recursion #using
Optimization of Object-Oriented Recursive Queries using Cost-Controlled Strategies (RSGL, PV, MZ), pp. 256–265.
SIGMODSIGMOD-1992-MerzK #database #multi #named
DIRECT: A Query Facility for Multiple Databases (UM, RK), p. 2.
SIGMODSIGMOD-1992-OrensteinHMS #database
Query Processing in the ObjectStore Database System (JAO, SH, BM, DS), pp. 403–412.
SIGMODSIGMOD-1992-PiraheshHH #optimisation #rule-based
Extensible/Rule Based Query Rewrite Optimization in Starburst (HP, JMH, WH), pp. 39–48.
SIGMODSIGMOD-1992-SrinivasanC #online
Compensation-Based On-Line Query Processing (VS, MJC), pp. 331–340.
SIGMODSIGMOD-1992-TerryGNO #database
Continuous Queries over Append-Only Databases (DBT, DG, DAN, BMO), pp. 321–330.
SIGMODSIGMOD-1992-Wang #experience
Experience from a Real Life Query Optimizer (YW), p. 286.
VLDBVLDB-1992-BoberC #multi
Multiversion Query Locking (PMB, MJC), pp. 497–510.
VLDBVLDB-1992-ChuITB #image #object-oriented
A Temporal Evolutionary Object-Oriented Data Model and Its Query Language for Medical Image Management (WWC, ITI, RKT, CMB), pp. 53–64.
VLDBVLDB-1992-DayalW #approach
A Uniform Approach to Processing Temporal Queries (UD, GTJW), pp. 407–418.
VLDBVLDB-1992-DuKS #optimisation
Query Optimization in a Heterogeneous DBMS (WD, RK, MCS), pp. 277–291.
VLDBVLDB-1992-ImielinskiB #distributed #mobile
Querying in Highly Mobile Distributed Environments (TI, BRB), pp. 41–52.
VLDBVLDB-1992-IoannidisNSS #optimisation #parametricity
Parametric Query Optimization (YEI, RTN, KS, TKS), pp. 103–114.
VLDBVLDB-1992-LeungM #database #multi #optimisation
Temporal Query Processing and Optimization in Multiprocessor Database Machines (TYCL, RRM), pp. 383–394.
VLDBVLDB-1992-Muralikrishna #algorithm #sql
Improved Unnesting Algorithms for Join Aggregate SQL Queries (MM), pp. 91–102.
CHICHI-1992-AhlbergWS #evaluation #implementation
Dynamic Queries for Information Exploration: An Implementation and Evaluation (CA, CW, BS), pp. 619–626.
CHICHI-1992-ShneidermanWA #database
Dynamic Queries: Database Searching by Direct Manipulation (BS, CW, CA), pp. 669–670.
CAiSECAiSE-1992-LeoneMRR
The Basic Query Machine of the KIWIS System (NL, AM, GR, PR), pp. 632–650.
CIKMCIKM-1992-AlhajjA #database #object-oriented
Queries in Object-Oriented Database Systems (RA, MEA), pp. 36–52.
KRKR-1992-NejdlB #semantics
Asking About Possibilities — Revision and Update Semantics for Subjunctive Queries (WN, MB), pp. 697–708.
SEKESEKE-1992-AbateDNP #analysis #specification
Querying and Analysis of Software Specifications (AFA, CD, GN, GP), pp. 470–478.
SEKESEKE-1992-ChunH #approach #compilation #knowledge base
Compiling Rules and Queries in Knowledge Base Systems: A Substitution-Based Approach (JC, LJH), pp. 109–115.
SEKESEKE-1992-Semmel #database #design
An Integrated System for Query Formulation and Database Design (RDS), pp. 40–46.
SIGIRSIGIR-1992-WilliamsonS
The Dynamic HomeFinder: Evaluating Dynamic Queries in a Real-Estate Information Exploration System (CW, BS), pp. 338–346.
TOOLSTOOLS-USA-1992-Odberg #database #object-oriented #what
What “What” is and isn’t: On Query Languages for Object-Oriented Databases, or: Closing the Gap — Again (EO), pp. 13–24.
LOPSTRLOPSTR-1992-Giacomo #partial evaluation
Intensional Query Answering: An Application of Partial Evaluation (GDG), pp. 132–150.
LOPSTRLOPSTR-1992-NardiR #deduction #source code #synthesis
Deductive Synthesis of Programs for Query Answering (DN, RR), pp. 15–29.
PPDPPLILP-1992-Ducasse #prolog
A General Trace Query Mechanism Based on Prolog (MD), pp. 400–414.
ICSEICSE-1992-ConsensMR #visualisation
Visualizing and Querying Software Structures (MPC, AOM, AGR), pp. 138–156.
ASEKBSE-1992-MatwinB #database #reuse
Reusing Database Queries in Analogical Domains (SM, HOB), p. 16.
STOCSTOC-1992-BlumR #learning #performance
Fast Learning of k-Term DNF Formulas with Queries (AB, SR), pp. 382–389.
CSLCSL-1992-Stewart #bound #logic #polynomial
Logical Characterization of Bounded Query Classes II: Polynomial-Time Oracle Machines (IAS), pp. 410–424.
ICLPJICSLP-1992-KempSS #bottom-up #evaluation #logic programming #source code #strict
Query Restricted Bottom-Up Evaluation of Normal Logic Programs (DBK, PJS, DS), pp. 288–302.
ICLPJICSLP-1992-SatohI #abduction #evaluation #logic programming
A Query Evaluation Method for Abductive Logic Programming (KS, NI), pp. 671–685.
PODSPODS-1991-BaudinetNW #infinity #on the #representation
On the Representation of Infinite Temporal Data and Queries (MB, MN, PW), pp. 280–290.
PODSPODS-1991-Chaudhuri #detection #evaluation #tuple
Detecting Redundant Tuples During Query Evaluation (SC), pp. 115–126.
PODSPODS-1991-GrumbachV #database
Tractable Query Languages for Complex Object Databases (SG, VV), pp. 315–327.
PODSPODS-1991-HelmMO #constraints #database #optimisation
Constraint-Based Query Optimization for Spatial Databases (RH, KM, MO), pp. 181–191.
PODSPODS-1991-LakshmananH #database #deduction #framework #optimisation #semantics
Structural Query Optimization — A uniform Framework for Semantic Query Optimization in Deductive Databases (LVSL, HJH), pp. 102–114.
PODSPODS-1991-MumickP #bound #linear
Overbound and Right-Linear Queries (ISM, HP), pp. 127–141.
PODSPODS-1991-Roy #clustering #complexity #independence #relational #semantics
Semantic Complexity of Classes of Relational Queries and Query Independent Data Partitioning (SR), pp. 259–267.
PODSPODS-1991-SeshadriN #datalog #on the #recursion
On the Expected Size of Recursive Datalog Queries (SS, JFN), pp. 268–279.
SIGMODSIGMOD-1991-HouOD #constraints #database #evaluation #relational
Error-Constraint COUNT Query Evaluation in Relational Databases (WCH, , ED), pp. 278–287.
SIGMODSIGMOD-1991-IoannidisK #analysis #optimisation
Left-Deep vs. Bushy Trees: An Analysis of Strategy Spaces and its Implications for Query Optimization (YEI, YCK), pp. 168–177.
SIGMODSIGMOD-1991-Neugebauer #database #embedded #evaluation #optimisation
Optimization and Evaluation of Database Queries Including Embedded Interpolation Procedures (LN), pp. 118–127.
VLDBVLDB-1991-ArefS #optimisation
Optimization for Spatial Query Processing (WGA, HS), pp. 81–90.
VLDBVLDB-1991-GuptaWJ #semantics
Semantic Queries with Pictures: The VIMSYS Model (AG, TEW, RJ), pp. 69–79.
VLDBVLDB-1991-SiegelmannB #object-oriented
Integrating Implicit Answers with Object-Oriented Queries (HTS, BRB), pp. 15–24.
RTARTA-1991-DenneheuvelKLS #optimisation #using
Query Optimization Using Rewrite Rules (SvD, KLK, GRRdL, ES), pp. 252–263.
CHICHI-1991-FischerHR #evaluation
Intertwining query construction and relevance evaluation (GF, SH, DFR), pp. 55–62.
KDDKDD-1991-SiegelSS #optimisation
Rule Discovery for Query Optimization (MS, ES, SCS), pp. 411–430.
ICMLML-1991-BhatiaDR #information management
Query Formulation Through Knowledge Acquisition (SKB, JSD, VVR), pp. 250–254.
ICMLML-1991-Kwok #adaptation #architecture #learning #using
Query Learning Using an ANN with Adaptive Architecture (KLK), pp. 260–264.
SIGIRSIGIR-1991-CelentanoFP #documentation
Querying Office Systems About Document Roles (AC, MGF, SP), pp. 183–190.
SIGIRSIGIR-1991-CroftTL #information retrieval #using
The Use of Phrases and Structured Queries in Information Retrieval (WBC, HRT, DDL), pp. 32–45.
SIGIRSIGIR-1991-FowlerFW #documentation #representation #visual notation
Integrating Query, Thesaurus, and Documents Through a Common Visual Representation (RHF, WALF, BAW), pp. 142–151.
SIGIRSIGIR-1991-Korfhage #question
To See, or Not to See: Is That the Query? (RK), pp. 134–141.
SIGIRSIGIR-1991-Kwok #adaptation #architecture #network
Query Modification and Expansion in a Network with Adaptive Architecture (KLK), pp. 192–201.
SIGIRSIGIR-1991-Rabitti #image #multi
Image Query Processing Based on Multi-Level Signatures (FR, PS), pp. 305–314.
LOPSTRLOPSTR-1991-JiaoG #database #object-oriented #optimisation #prolog #using
Query Optimization in an Object-Oriented Database using Prolog (ZJ, PMDG), pp. 332–334.
STOCSTOC-1991-AngluinK #question
When Won’t Membership Queries Help? (DA, MK), pp. 444–454.
CSLCSL-1991-Hirshfeld #database #relational
Safe Queries in Relational Databases with Functions (YH), pp. 173–183.
CSLCSL-1991-Tyszkiewicz #logic #transitive
Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic (JT), pp. 396–410.
LICSLICS-1991-AvronH #database #first-order #on the
On First Order Database Query Languages (AA, YH), pp. 226–231.
HTECHT-1990-AfratiK #hypermedia
A Hypertext Model Supporting Query Mechanisms (FNA, CDK), pp. 52–66.
HTECHT-1990-BeeriK #hypermedia #logic
A Logical Query Language for Hypertext Systems (CB, YK), pp. 67–80.
PODSPODS-1990-ArefS #data type #performance
Efficient Processing of Window Queries in The Pyramid Data Structure (WGA, HS), pp. 265–272.
PODSPODS-1990-Chomicki #database #deduction #polynomial
Polynomial Time Query Processing in Temporal Deductive Databases (JC), pp. 379–391.
PODSPODS-1990-Elkan #database #independence #logic
Independence of Logic Database Queries and Updates (CE), pp. 154–160.
PODSPODS-1990-KanellakisKR #constraints
Constraint Query Languages (PCK, GMK, PZR), pp. 299–313.
PODSPODS-1990-Lassez #constraints
Querying Constraints (JLL), pp. 288–298.
PODSPODS-1990-LiptonN #adaptation #estimation
Query Size Estimation by Adaptive Sampling (RJL, JFN), pp. 40–46.
PODSPODS-1990-Plambeck #optimisation #recursion
Semigroup Techniques in Recursive Query Optimization (TEP), pp. 145–153.
SIGMODSIGMOD-1990-BlumS
The INA: A Simple Query Language with Only Attribute Names (BIB, RDS), p. 390.
SIGMODSIGMOD-1990-ChaW #interface #named
Kaleidoscope: A Cooperative Menu-Guided Query Interface (SKC, GW), p. 387.
SIGMODSIGMOD-1990-ConsensM #visual notation
The G+/GraphLog Visual Query System (MPC, AOM), p. 388.
SIGMODSIGMOD-1990-GangulyST #datalog #framework #parallel
A Framework for the Parallel Processing of Datalog Queries (SG, AS, ST), pp. 143–152.
SIGMODSIGMOD-1990-Graefe #encapsulation #parallel
Encapsulation of Parallelism in the Volcano Query Processing System (GG), pp. 102–111.
SIGMODSIGMOD-1990-IoannidisK #algorithm #optimisation #random #scalability
Randomized Algorithms for Optimizing Large Join Queries (YEI, YCK), pp. 312–321.
SIGMODSIGMOD-1990-MotroY #database
Querying Database Knowledge (AM, QY), pp. 173–183.
SIGMODSIGMOD-1990-Orenstein #comparison #parametricity
A Comparison of Spatial Query Processing Techniques for Native and Parameter Spaces (JAO), pp. 343–352.
SIGMODSIGMOD-1990-RosenthalG #graph #implementation
Query Graphs, Implementing Trees, and Freely-Reorderable Outerjoins (AR, CAGL), pp. 291–299.
VLDBVLDB-1990-Fuhr #database #framework #probability
A Probabilistic Framework for Vague Queries and Imprecise Information in Databases (NF), pp. 696–707.
VLDBVLDB-1990-HaradaNKT #clustering #multi
Query Processing for Multi-Attribute Clustered Records (LH, MN, MK, MT), pp. 59–70.
VLDBVLDB-1990-KemperM #data access #using
Advanced Query Processing in Object Bases Using Access Support Relations (AK, GM), pp. 290–301.
VLDBVLDB-1990-KuittinenNSS #bottom-up #evaluation #implementation #logic #performance
Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries (JK, ON, SS, ESS), pp. 372–379.
VLDBVLDB-1990-OnoL #complexity #optimisation
Measuring the Complexity of Join Enumeration in Query Optimization (KO, GML), pp. 314–325.
VLDBVLDB-1990-SchneiderD #database #multi #trade-off
Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines (DAS, DJD), pp. 469–480.
VLDBVLDB-1990-WangS #distance #metric
Query Processing for Distance Metrics (JTLW, DS), pp. 602–613.
ICALPICALP-1990-BookLT #pseudo #random
Additional Queries to Random and Pseudorandom Oracles (RVB, JHL, ST), pp. 283–293.
ICALPICALP-1990-Watanabe #formal method #learning
A Formal Study of Learning via Queries (OW0), pp. 139–152.
SIGIRSIGIR-1990-AnickBFHAR #information retrieval #interface #natural language
A Direct Manipulation Interface for Boolean Information Retrieval via Natural Language Query (PGA, JDB, RAF, DRH, BA, JMR), pp. 135–150.
SIGIRSIGIR-1990-ChenD #information retrieval #interactive #online #process #refinement
Online Query Refinement on Information Retrieval Systems: A Process Model of Searcher/System Interactions (HC, VD), pp. 115–133.
SIGIRSIGIR-1990-CroftD #documentation #retrieval
Experiments with Query Acquisition and Use in Document Retrieval Systems (WBC, RD), pp. 349–368.
SIGIRSIGIR-1990-CrouchCN #automation #generative
The Automatic Generation of Extended Queries (CJC, DBC, KRN), pp. 369–383.
OOPSLAOOPSLA-ECOOP-1990-StraubeO #consistency #database #object-oriented
Type Consistency of Queries in an Object-Oriented Database System (DDS, MTÖ), pp. 224–233.
PPDPALP-1990-Han #graph #recursion
Recursive Query Processing in Predicate-Goal Graph (JLH), pp. 247–261.
ICLPCLP-1990-SchreyeVB90 #detection #graph #horn clause #strict #using
A Practical Technique for Detecting Non-terminating Queries for a Restricted Class of Horn Clauses, Using Directed, Weighted Graphs (DDS, KV, MB), pp. 649–663.
ICLPCLP-1990-ShmueliT90 #incremental
Incremental Re-evaluation of LDL Queries (OS, ST), pp. 99–111.
HTHT-1989-ConsensM #hypermedia
Expressing Structural Hypertext Queries in GraphLog (MPC, AOM), pp. 269–292.
PODSPODS-1989-Borgida #inheritance #strict #type system
Type Systems for Querying Class Hierarchies with Non-strict Inheritance (AB), pp. 394–400.
PODSPODS-1989-Cosmadakis #first-order #on the #recursion
On the First-Order Expressibility of Recursive Queries (SSC), pp. 311–323.
PODSPODS-1989-DublishM #bound #fixpoint
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies (PD, SNM), pp. 324–335.
PODSPODS-1989-Elkan
A Decision Procedure for Conjunctive Query Disjointness (CE), pp. 134–139.
PODSPODS-1989-HullS #set
Untyped Sets, Invention, and Computable Queries (RH, JS), pp. 347–359.
PODSPODS-1989-ImielinskiV #complexity #database
Complexity of Query Processing in Databases with OR-Objects (TI, KVV), pp. 51–65.
PODSPODS-1989-SagivV #database #datalog #infinity #safety
Safety of Datalog Queries over Infinite Databases (YS, MYV), pp. 160–171.
PODSPODS-1989-YuanC #algorithm #database #evaluation #relational
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information (LYY, DAC), pp. 66–74.
SIGMODSIGMOD-1989-AbiteboulK
Object Identity as a Query Language Primitive (SA, PCK), pp. 159–173.
SIGMODSIGMOD-1989-Bry #evaluation #performance #quantifier #revisited #towards
Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited (FB), pp. 193–204.
SIGMODSIGMOD-1989-ChomickiI #infinity #relational #specification
Relational Specifications of Infinite Query Answers (JC, TI), pp. 174–183.
SIGMODSIGMOD-1989-Colby #algebra #optimisation #recursion
A Recursive Algebra and Query Optimization for Nested Relations (LSC), pp. 273–283.
SIGMODSIGMOD-1989-Dong #database #datalog #distributed #on the
On Distributed Processibility of Datalog Queries by Decomposing Databases (GD), pp. 26–35.
SIGMODSIGMOD-1989-GraefeW #evaluation
Dynamic Query Evaluation Plans (GG, KW), pp. 358–366.
SIGMODSIGMOD-1989-HaasFLP
Extensible Query Processing in Starburst (LMH, JCF, GML, HP), pp. 377–388.
SIGMODSIGMOD-1989-HouOT #constraints #relational
Processing Aggregate Relational Queries with Hard Time Constraints (WCH, , BKT), pp. 68–77.
SIGMODSIGMOD-1989-SalzaT #database #dependence #probability #relational
Evaluating the Size of Queries on Relational Databases with non Uniform Distribution and Stochastic Dependence (SS, MT), pp. 8–14.
SIGMODSIGMOD-1989-Swami #combinator #heuristic #optimisation #scalability
Optimization of Large Join Queries: Combining Heuristic and Combinatorial Techniques (ANS), pp. 367–376.
VLDBVLDB-1989-AlashqurSL #database #named #object-oriented
OQL: A Query Language for Manipulating Object-oriented Databases (AMA, SYWS, HL), pp. 433–442.
VLDBVLDB-1989-CornellY #database #integration #optimisation #relational
Integration of Buffer Management and Query Optimization in Relational Database Environment (DWC, PSY), pp. 247–255.
VLDBVLDB-1989-Hulin #architecture #distributed #parallel #recursion
Parallel Processing of Recursive Queries in Distributed Architectures (GH), pp. 87–96.
VLDBVLDB-1989-Kim #database #object-oriented
A Model of Queries for Object-Oriented Databases (WK), pp. 423–432.
VLDBVLDB-1989-KuntzM #visual notation
Pasta-3’s Graphical Query Language: Direct Manipulation, Cooperative Queries, Full Expressive Power (MK, RM), pp. 97–105.
VLDBVLDB-1989-Motro #constraints #relational #using
Using Integrity Constraints to Provide Intensional Answers to Relational Queries (AM), pp. 237–246.
VLDBVLDB-1989-Muralikrishna #algorithm #data flow #optimisation
Optimization and Dataflow Algorithms for Nested Tree Queries (MM), pp. 77–85.
SEKESEKE-1989-ChenTY #optimisation #prolog #semantics
Semantic Query Optimization and Prolog (JTC, CRT, WPY), pp. 146–151.
SEKESEKE-1989-Czejdo #database #recursion #specification #using
Recursive Query Specification Using Nested Databases (BDC), pp. 140–145.
SEKESEKE-1989-WangS #database
A Form-based Pictorial Query Language For Pictorial Database (JW, QYS), pp. 152–157.
SEKESEKE-1989-WuCZT #identification #morphism #novel #subclass
A Novel Way 1o Identify IneguaIity Query Subclasses Which possess the Homomorphism Property (TW, JLC, NZ, KT), pp. 158–163.
STOCSTOC-1989-AfratiC #recursion #strict
Expressiveness of Restricted Recursive Queries (FNA, SSC), pp. 113–126.
ICLPNACLP-1989-BonnerMV #database #logic
Expressing Database Queries with Intuitionistic Logic (AJB, LTM, KVV), pp. 831–850.
ICLPNACLP-1989-MaherS #constraints #logic programming #programming language
Expanding Query Power in Constraint Logic Programming Languages (MJM, PJS), pp. 20–36.
PODSPODS-1988-BunemanDW #approximate #semantics
A Semantics for Complex Objects and Approximate Queries (PB, SBD, AW), pp. 305–314.
PODSPODS-1988-Chandra #database
Theory of Database Queries (AKC), pp. 1–9.
PODSPODS-1988-HullS #database #on the #power of
On the Expressive Power of Database Queries with Intermediate Types (RH, JS), pp. 39–51.
PODSPODS-1988-KiferRS #approach #axiom #database #deduction #safety
An Axiomatic Approach to Deciding Query Safety in Deductive Databases (MK, RR, AS), pp. 52–60.
PODSPODS-1988-MuralikrishnaD #multi #optimisation
Optimization of Multiple-Relation Multiple-Disjunct Queries (MM, DJD), pp. 263–275.
PODSPODS-1988-RamakrishnanBK #datalog #optimisation
Optimizing Existential Datalog Queries (RR, CB, RK), pp. 89–102.
PODSPODS-1988-SippuS #relational #transitive
A Generalized Transitive Closure for Relational Queries (SS, ESS), pp. 325–332.
PODSPODS-1988-Vardi #bound #decidability #linear #recursion
Decidability and Undecidability Results for Boundedness of Linear Recursive Queries (MYV), pp. 341–351.
SIGMODSIGMOD-1988-CareyDV
A Data Model and Query Language for EXODUS (MJC, DJD, SLV), pp. 413–423.
SIGMODSIGMOD-1988-Hanson #analysis #database #performance
Processing Queries Against Database Procedures: A Performance Analysis (ENH), pp. 295–302.
SIGMODSIGMOD-1988-Lohman #functional #optimisation #representation
Grammar-like Functional Rules for Representing Query Optimization Alternatives (GML), pp. 18–27.
SIGMODSIGMOD-1988-MuralikrishnaD #multi
Equi-Depth Histograms For Estimating Selectivity Factors For Multi-Dimensional Queries (MM, DJD), pp. 28–36.
SIGMODSIGMOD-1988-RamnarayanL #knowledge base
A Data/Knowledge Base Management Testbed and Experimental Results on Data/Knowledge Base Query and Update Processing (RR, HL), pp. 387–395.
SIGMODSIGMOD-1988-SwamiG #optimisation #scalability
Optimization of Large Join Queries (ANS, AG), pp. 8–17.
SIGMODSIGMOD-1988-YuanC #algorithm #database #evaluation #null #relational
A Sound and Complete Query Evaluation Algorithm for Relational Databases with Null Values (LYY, DAC), pp. 74–81.
VLDBVLDB-1988-EgenhoferF #towards #user interface
Towards a Spatial Query Language: User Interface Considerations (MJE, AUF), pp. 124–133.
VLDBVLDB-1988-Jhingran #algorithm #database #optimisation #performance
A Performance Study of Query Optimization Algorithms on a Database System Supporting Procedures (AJ), pp. 88–99.
VLDBVLDB-1988-LecluseS #implementation #interface
Implementing Queries and Updates on Universal Scheme Interfaces (CL, NS), pp. 62–75.
VLDBVLDB-1988-LeeFL #functional #implementation #interpreter
Implementing an Interpreter for Functional Rules in a Query Optimizer (MKL, JCF, GML), pp. 218–229.
VLDBVLDB-1988-Lynch #database #estimation #optimisation #scalability
Selectivity Estimation and Query Optimization in Large Databases with Highly Skewed Distribution of Column Values (CAL), pp. 240–251.
VLDBVLDB-1988-MaindrevilleS #database #deduction #modelling
Modelling Non Deterministic Queries and Updates in Deductive Databases (CdM, ES), pp. 395–406.
VLDBVLDB-1988-RosenthalC #multi
Anatomy of a Mudular Multiple Query Optimizer (AR, USC), pp. 230–239.
VLDBVLDB-1988-ShekarSD #execution #formal method #optimisation #semantics #trade-off
A Formal Model of Trade-off between Optimization and Execution Costs in Semantic Query Optimization (SS, JS, SD), pp. 457–467.
SIGIRSIGIR-1988-Harman #interactive #towards
Towards Interactive Query Expansion (DH), pp. 321–331.
SIGIRSIGIR-1988-Simpson #network #retrieval
Query Processing in a Heterogeneous Retrieval Network (PS), pp. 359–370.
SIGIRSIGIR-1988-SmeatonR #documentation #empirical #retrieval
Experiment on Incorporation Syntactic Processing of User Queries into a Document Retrieval Strategy (AFS, CJvR), pp. 31–51.
ESOPESOP-1988-Horwitz #development #relational
Adding Relational Query Facilities to Software Development Environments (SH), pp. 269–283.
CADECADE-1988-ChiH #horn clause #recursion
Recursive Query Answering with Non-Horn Clauses (SC, LJH), pp. 294–312.
CADECADE-1988-Subrahmanian #logic programming
Query Processing in Quantitative Logic Programming (VSS), pp. 81–100.
ICLPJICSCP-1988-KempT88 #database #evaluation #top-down
Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases (DBK, RWT), pp. 178–194.
ICLPJICSCP-1988-SekiI88 #evaluation #source code
A Query Evaluation Method for Stratified Programs Under the Extended CWA (HS, HI), pp. 195–211.
PODSPODS-1987-AfratiP #complexity #parallel
The Parallel Complexity of Simple Chain Queries (FNA, CHP), pp. 210–213.
PODSPODS-1987-DAtriFM #database #relational
Dynamic Query Interpretation in Relational Databases (AD, PDF, MM), pp. 70–78.
PODSPODS-1987-GrahneSS #evaluation #performance #recursion #set
Efficient Evaluation for a Subset of Recursive Queries (GG, SS, ESS), pp. 284–293.
PODSPODS-1987-Malvestuto #database
Answering Queries in Categorial Data Bases (FMM), pp. 87–96.
PODSPODS-1987-Marchetti-SpaccamelaPS #analysis #complexity #implementation #logic #worst-case
Worst-case Complexity Analysis of Methods for Logic Query Implementation (AMS, AP, DS), pp. 294–301.
PODSPODS-1987-Shmueli #decidability #logic
Decidability and Expressiveness of Logic Queries (OS), pp. 237–249.
SIGMODSIGMOD-1987-AbiteboulKG #on the #representation #set
On the Representation and Querying of Sets of Possible Worlds (SA, PCK, GG), pp. 34–48.
SIGMODSIGMOD-1987-AlyO #database #deduction #logic #modelling #nondeterminism
Non-deterministic Modelling of Logical Queries in Deductive Databases (HA, ZMÖ), pp. 60–72.
SIGMODSIGMOD-1987-CruzMW #recursion #visual notation
A Graphical Query Language Supporting Recursion (IFC, AOM, PTW), pp. 323–330.
SIGMODSIGMOD-1987-Freytag #optimisation #rule-based
A Rule-Based View of Query Optimization (JCF), pp. 173–180.
SIGMODSIGMOD-1987-GanskiW #optimisation #revisited #sql
Optimization of Nested SQL Queries Revisited (RAG, HKTW), pp. 23–33.
SIGMODSIGMOD-1987-HanH #database #recursion
Handling Redundancy in the Processing of Recursive Database Queries (JH, LJH), pp. 73–81.
SIGMODSIGMOD-1987-Ioannidis #optimisation
Query Optimization by Simulated Annealing (YEI, EW), pp. 9–22.
SIGMODSIGMOD-1987-ShenoyO #optimisation #semantics
A System for Semantic Query Optimization (STS, ZMÖ), pp. 181–195.
VLDBVLDB-1987-Bultzingsloewen #optimisation #sql
Translating and Optimizing SQL Queries Having Aggregates (GvB), pp. 235–243.
VLDBVLDB-1987-CeriT #algebra #datalog #equation #optimisation
Optimization of Systems of Algebraic Equations for Evaluating Datalog Queries (SC, LT), pp. 31–41.
VLDBVLDB-1987-Dayal #approach #quantifier
Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers (UD), pp. 197–208.
VLDBVLDB-1987-HowellsFG #relational #text-to-text
A Source-to-Source Meta-Translation System for Relational Query Languages (DIH, NJF, WAG), pp. 227–234.
VLDBVLDB-1987-HwangY
An Analytical Method for Estimating and Interpreting Query Time (HYH, YTY), pp. 347–358.
VLDBVLDB-1987-LacroixL
Preferences; Putting More Knowledge into Queries (ML, PL), pp. 217–225.
VLDBVLDB-1987-Nejdl #recursion
Recursive Strategies for Answering Recursive Queries — The RQA/FQI Strategy (WN), pp. 43–50.
VLDBVLDB-1987-SubietaR #optimisation
Query Optimization by Stored Queries (KS, WR), pp. 369–380.
VLDBVLDB-1987-WhangN #approach #logic #normalisation #optimisation #recursion
An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments (KYW, SBN), pp. 275–287.
VLDBVLDB-1987-YangL
Query Transformation for PSJ-Queries (HZY, PÅL), pp. 245–254.
HCIHCI-CE-1987-Gonzalez-SustaetaM #database #natural language #paradigm #semantics
A Semantic Paradigm to Solve Natural Language Database Queries (JGS, CM), pp. 113–120.
SIGIRSIGIR-1987-ChouekaFKS
Improved Techniques for Processing Queries in Full-Text Systems (YC, ASF, STK, ES), pp. 306–315.
SIGIRSIGIR-1987-Eastman #incremental
File Organizations and Incrementally Specified Queries (CME), pp. 217–222.
SIGIRSIGIR-1987-Kwok #approximate
Some Considerations for Approximate Optimal Queries (KLK), pp. 19–23.
DACDAC-1987-RosenthalH #approach #knowledge-based
Querying Part Hierarchies: A Knowledge-Based Approach (AR, SH), pp. 328–334.
ICLPICLP-1987-RamamohanaraoS87 #database #deduction
Answering Queries in Deductive Database Systems (KR, JS), pp. 1014–1033.
ICLPICLP-1987-SaccaZ87 #implementation #logic #recursion
Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic (DS, CZ), pp. 104–135.
PODSPODS-1986-AfratiPPRSU #convergence #evaluation
Convergence of Sideways Query Evaluation (FNA, CHP, GP, AR, YS, JDU), pp. 24–30.
PODSPODS-1986-CosmadakisK #evaluation #parallel #recursion
Parallel Evaluation of Recursive Rule Queries (SSC, PCK), pp. 280–293.
PODSPODS-1986-MannilaR #relational #testing
Test Data for Relational Queries (HM, KJR), pp. 217–223.
PODSPODS-1986-Naqvi #first-order
Negation as Failure for First-Order Queries (SAN), pp. 114–122.
PODSPODS-1986-SaccaZ #database #implementation #logic #on the
On the Implementation of a Simple Class of Logic Queries for Databases (DS, CZ), pp. 16–23.
PODSPODS-1986-SagivS #equivalence
The Equivalence of Solving Queries and Production Tree Projections (YS, OS), pp. 160–172.
SIGMODSIGMOD-1986-BancilhonR #recursion
An Amateur’s Introduction to Recursive Query Processing Strategies (FB, RR), pp. 16–52.
SIGMODSIGMOD-1986-FreytagG #relational #rule-based #source code
Rule-Based Translation of Relational Queries into Iterative Programs (JCF, NG), pp. 206–214.
SIGMODSIGMOD-1986-Gelder #evaluation #framework #logic #message passing
A Message Passing Framework for Logical Query Evaluation (AVG), pp. 155–165.
SIGMODSIGMOD-1986-Imielinski #database #deduction
Query Processing in Deductive Databases with Incomplete Information (TI), pp. 268–280.
SIGMODSIGMOD-1986-LehmanC #database #in memory #memory management
Query Processing in Main Memory Database Management Systems (TJL, MJC), pp. 239–250.
SIGMODSIGMOD-1986-MackertL #evaluation #performance #validation
R* Optimizer Validation and Performance Evaluation for Local Queries (LFM, GML), pp. 84–95.
SIGMODSIGMOD-1986-Motro
Constructing Queries from Tokens (AM), pp. 120–131.
SIGMODSIGMOD-1986-Orenstein #database #object-oriented
Spatial Query Processing in an Object-Oriented Database System (JAO), pp. 326–336.
SIGMODSIGMOD-1986-Sellis #optimisation
Global Query Optimization (TKS), pp. 191–205.
VLDBVLDB-1986-CeriGL #algebra #approach #logic #optimisation
Translation and Optimization of Logic Queries: The Algebraic Approach (SC, GG, LL), pp. 395–402.
VLDBVLDB-1986-ChakravarthyM #database #deduction #graph #multi #using
Multiple Query Processing in Deductive Databases using Query Graphs (USC, JM), pp. 384–391.
VLDBVLDB-1986-Freytag #source code
Translating Aggregate Queries into Iterative Programs (JCF, NG), pp. 138–146.
VLDBVLDB-1986-JunetFL #database #named #semantics
ECRINS/86: An Extended Entity-Relationship Data Base Management System and its Semantic Query Language (MJ, GF, ML), pp. 259–266.
VLDBVLDB-1986-KrishnamurthyBZ #optimisation #recursion
Optimization of Nonrecursive Queries (RK, HB, CZ), pp. 128–137.
VLDBVLDB-1986-LowdenR #natural language #relational
The REMIT System for Paraphrasing Relational Query Expressions into Natural Language (BGTL, ANDR), pp. 365–371.
VLDBVLDB-1986-MackertL #distributed #evaluation #performance #validation
R* Optimizer Validation and Performance Evaluation for Distributed Queries (LFM, GML), pp. 149–159.
VLDBVLDB-1986-Motro
Completeness Information and Its Application to Query Processing (AM), pp. 170–178.
VLDBVLDB-1986-RaschidS #parallel #recursion
A Parallel Processing Strategy for Evaluating Recursive Queries (LR, SYWS), pp. 412–419.
VLDBVLDB-1986-Yokomori #database #logic #on the
On Analogical Query Processing in Logic Database (TY), pp. 376–383.
ICALPICALP-1986-Willard #bound #problem
Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (DEW), pp. 444–453.
SIGIRSIGIR-1986-GibbsT #documentation
Document Presentation and Query Formulation in Muse (SJG, DT), pp. 23–30.
SIGIRSIGIR-1986-WongZRW #on the
On Extending the Vector Space Model for Boolean Query Processing (SKMW, WZ, VVR, PCNW), pp. 175–185.
PODSPODS-1985-AtzeniC #approach #performance
Efficient Query Answering in the Representative Instance Approach (PA, EPFC), pp. 181–188.
PODSPODS-1985-Connors #capacity #equivalence
Equivalence of Views by Query Capacity (TC), pp. 143–148.
PODSPODS-1985-GadiaV #database
A Query Language for a Homogeneous Temporal Database (SKG, JHV), pp. 51–56.
PODSPODS-1985-OzsoyogluM #on the #optimisation
On Optimizing Summary-Table-by-Example Queries (, VM), pp. 38–50.
PODSPODS-1985-Vardi #database #logic
Querying Logical Databases (MYV), pp. 57–65.
SIGMODSIGMOD-1985-SellisS #database #optimisation
Optimization of Extended Database Query Languages (TKS, LDS), pp. 424–436.
SIGMODSIGMOD-1985-Ullman #database #implementation #logic
Implementation of Logical Query Languages for Databases (JDU), p. 444.
SIGMODSIGMOD-1985-YuC #adaptation #design #information management
Adaptive Information System Design: One Query at a Time (CTY, CHC), pp. 280–290.
VLDBVLDB-1985-FaloutsosC #design
Design of a Signature File Method that Accounts for Non-Uniform Occurrence and Query Frequencies (CF, SC), pp. 165–170.
VLDBVLDB-1985-Kiessling #correlation #on the #performance #semantics
On Semantic Reefs and Efficient Processing of Correlation Queries with Aggregates (WK), pp. 241–250.
VLDBVLDB-1985-LarsonY
Computing Queries from Derived Relations (PÅL, HZY), pp. 259–269.
VLDBVLDB-1985-SatohTNO #database #optimisation #relational
Local and Global Query Optimization Mechanisms for Relational Databases (KS, MT, FN, KO), pp. 405–417.
SIGIRSIGIR-1985-Jochum #on the #retrieval #testing
On Retrieval Tests with an Inhomogeneous Query Collection (FJ), pp. 215–224.
SIGIRSIGIR-1985-ShepherdLP #case study
A Study of the Relationship between User Profiles and User Queries (MAS, AL, WJP), pp. 274–281.
STOCSTOC-1985-Vaidya #orthogonal #trade-off
Space-Time Tradeoffs for Orthogonal Range Queries (PMV), pp. 169–174.
STOCSTOC-1985-YaoY #approach #geometry
A General Approach to d-Dimensional Geometric Queries (ACCY, FFY), pp. 163–168.
PODSPODS-1984-HwangDG #multi #process #using
Using Semiouterjoins to Process Queries in Multidatabase Systems (HYH, UD, MGG), pp. 153–162.
PODSPODS-1984-OzsoyogluC #on the
On the Cyclic to Acyclic Scheme Transformation and Solving Cyclic Queries (ZMÖ, EC), pp. 133–142.
PODSPODS-1984-Snodgrass
The Temporal Query Language TQuel (RTS), pp. 204–213.
PODSPODS-1984-Yannakakis
Querying Weak Instances (MY), pp. 275–280.
PODSPODS-1984-YokotaKKMSM #algebra #generative #relational
An Enhanced Inference Mechanism for Generating Relational Algebra Queries (HY, SK, TK, NM, SS, KM), pp. 229–238.
SIGMODSIGMOD-1984-Fogg #database #interface #lessons learnt #visual notation
Lessons from a “Living in a Database” Graphical Query Interface (DF), pp. 100–106.
SIGMODSIGMOD-1984-JarkeCV #optimisation #prolog #relational
An Optimizing Prolog Front-End to a Relational Query System (MJ, JC, YV), pp. 296–306.
SIGMODSIGMOD-1984-Willard #calculus #performance #relational #using
Efficient Processing of Relational Calculus Expressions Using Range Query Theory (DEW), pp. 164–175.
VLDBVLDB-1984-ChenL #database #distributed #optimisation
Optimizing Star Queries in a Distributed Database System (ALPC, VOKL), pp. 429–438.
VLDBVLDB-1984-DeenAT
A Strategy for Decomposing Complex Queries in a Heterogeneous DDB (SMD, RRA, MCT), pp. 397–400.
VLDBVLDB-1984-GinsburgT
Interval Queries on Object Histories: Extended Abstract (SG, KT), pp. 208–217.
VLDBVLDB-1984-GoldhirschY
Processing Read-Only Queries Over Views With Generalization (DG, LY), pp. 344–348.
VLDBVLDB-1984-KrishnamurthyM #approach
Query Processing on Personal Computers: A Pragmatic Approach (RK, SPM), pp. 26–29.
VLDBVLDB-1984-LohmanDHKS #database #distributed #optimisation #relational
Optimization of Nested Queries in a Distributed Relational Database (GML, DD, LMH, RK, PGS), pp. 403–415.
VLDBVLDB-1984-RosenthalHM #knowledge-based
An Example of Knowledge-Based Query Processing in a CAD/CAM DBMS (AR, SH, FM), pp. 363–370.
VLDBVLDB-1984-RosenthalR #algebra #framework
Extending the Algebraic Framework of Query Processing to Handle Outerjoins (AR, DSR), pp. 334–343.
VLDBVLDB-1984-YoshikawaK #difference
Processing Inequality Queries Based on Generalized Semi-Joins (MY, YK), pp. 416–428.
SIGIRSIGIR-1984-Korfhage
Query Enhancement by User Profiles (RK), pp. 111–121.
PODSPODS-1983-Cosmadakis #complexity #relational
The Complexity of Evaluating Relational Queries (SSC), pp. 149–155.
PODSPODS-1983-Dayal #approach #quantifier
Processing Queries with Quantifiers: A Horticultural Approach (UD), pp. 125–136.
PODSPODS-1983-Kintala #attribute grammar
Attributed Grammars for Query Language Translations (CMRK), pp. 137–148.
SIGMODSIGMOD-1983-DAtriMS #database #relational
Answering Queries in Relational Databases (AD, MM, NS), pp. 173–177.
SIGMODSIGMOD-1983-JarkeK #performance #quantifier
Range Nesting: A Fast Method to Evaluate Quantified Queries (MJ, JK), pp. 196–206.
SIGMODSIGMOD-1983-KambayashiY #composition #dependence
Query Processing Utilizing Dependencies and Horizontal Decomposition (YK, MY), pp. 55–67.
SIGMODSIGMOD-1983-MissikoffS #relational
Relational Queries in a Domain Based DBMS (MM, MS), pp. 219–227.
SIGMODSIGMOD-1983-YuC #database #design #distributed #on the
On the Design of a Query Processing Strategy in a Distributed Database Environment (CTY, CCC), pp. 30–39.
VLDBVLDB-1983-Dayal #multi
Processing Queries Over Generalization Hierarchies in a Multidatabase System (UD), pp. 342–353.
VLDBVLDB-1983-GolshaniMS #algebra #database #specification
A Modal System of Algebras for Database Specification and Query/Update Language Support (FG, TSEM, MRS), pp. 331–339.
PODSPODS-1982-ChandraH #fixpoint #horn clause
Horn Clauses and the Fixpoint Query Hierarchy (AKC, DH), pp. 158–163.
PODSPODS-1982-GoodmanS
The Tree Property is Fundamental for Query Processing (NG, OS), pp. 40–48.
PODSPODS-1982-JohnsonK #dependence #functional #testing
Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (DSJ, ACK), pp. 164–169.
SIGMODSIGMOD-1982-DayalG #database #optimisation
Query Optimization for CODASYL Database Systems (UD, NG), pp. 138–150.
SIGMODSIGMOD-1982-DintelmanM #implementation
An Implementation of a Query Language Supporting Path Expressions (SMD, ATM), pp. 87–93.
SIGMODSIGMOD-1982-JarkeS #database #pascal #relational
Query Processing Strategies in the PASCAL/R Relational Database Management System (MJ, JWS), pp. 256–264.
SIGMODSIGMOD-1982-KambayashiYY #database #distributed #using
Query Processing for Distributed Databases Using Generalized Semi-Joins (YK, MY, SY), pp. 151–160.
SIGMODSIGMOD-1982-Klug #statistics
Access Paths in the “ABE” Statistical Query Facility (ACK), pp. 161–173.
SIGMODSIGMOD-1982-Longstaff #named
ERQ: Controlled Inference and Instruction Techniques for DBMS Query Languages (JL), pp. 111–117.
SIGMODSIGMOD-1982-MaierRSSW #independence #logic #relational #towards
Toward Logical Data Independence: A Relational Query Language Without Relations (DM, DR, SCS, JS, DSW), pp. 51–60.
SIGMODSIGMOD-1982-ManolaP #database #named
CQLF — A Query Language for CODASYL-Type Databases (FM, AP), pp. 94–103.
SIGMODSIGMOD-1982-RosenthalR #architecture #optimisation
An Architecture for Query Optimization (AR, DSR), pp. 246–255.
SIGMODSIGMOD-1982-SchlageterRPU #network
The Network Query Language NOAH (GS, MR, UP, RU), pp. 104–110.
VLDBVLDB-1982-Chang #approach #distributed #heuristic
A Heuristic Approach to Distributed Query Processing (JMC), pp. 54–61.
VLDBVLDB-1982-LochovskyT #database #interactive
An Interactive Query Language for External Data Bases (FHL, DT), pp. 11–21.
SIGIRSIGIR-1982-BuellK #named #testing
LIARS: A Software Environment for Testing Query Processing Strategies (DAB, DHK), pp. 20–27.
POPLPOPL-1982-Cooper #database #on the #power of #relational
On the Expressive Power of Query Languages for Relational Databases (ECC), pp. 361–365.
POPLPOPL-1982-GansnerHKMS #correctness #semantics
Semantics and Correctness of a Query Language Translation (EG, JRH, CMRK, DJM, PS), pp. 289–298.
STOCSTOC-1982-Immerman #polynomial #relational
Relational Queries Computable in Polynomial Time (NI), pp. 147–152.
STOCSTOC-1982-Vardi #complexity #relational
The Complexity of Relational Query Languages (MYV), pp. 137–146.
STOCSTOC-1982-Yao #trade-off
Space-Time Tradeoff for Answering Range Queries (ACCY), pp. 128–136.
SIGMODSIGMOD-1981-GoudaD #database #distributed
Optimal Semijoin Schedules For Query Processing in Local Distributed Database Systems (MGG, UD), pp. 164–175.
SIGMODSIGMOD-1981-Richard #algebra #evaluation #relational
Evaluation of the Size of a Query Expressed in Relational Algebra (PR), pp. 155–163.
VLDBVLDB-1981-King #database #named #optimisation #relational #semantics
QUIST: A System for Semantic Query Optimization in Relational Databases (JJK), pp. 510–517.
VLDBVLDB-1981-MakinouchiTKA #evaluation #optimisation
The Optimization Strategy for Query Evaluation in RDB/V1 (AM, MT, HK, SA), pp. 518–529.
VLDBVLDB-1981-Warren #database #interactive #logic #performance #relational
Efficient Processing of Interactive Relational Data Base Queries expressed in Logic (DHDW), pp. 272–281.
SIGMODSIGMOD-1980-ChiuH
A Methodology for Interpreting Tree Queries Into Optimal Semi-Join Expressions (DMC, YCH), pp. 169–178.
VLDBVLDB-1980-Demolombe #calculus #estimation #tuple
Estimation of the Number of Tuples Satisfying a Query Expressed in Predicate Calculus Language (RD), pp. 55–63.
VLDBVLDB-1980-HammerZ #knowledge-based
Knowledge-Based Query Processing (MH, SBZ), pp. 137–147.
VLDBVLDB-1980-RosenkrantzH
Processing Conjunctive Predicates and Queries (DJR, HBHI), pp. 64–72.
VLDBVLDB-1980-ShneidermanT #automation #database
Path Expressions for Complex Queries and Automatic Database Program Conversion (BS, GT), pp. 33–44.
SIGIRSIGIR-1980-MazlackF #database
Establishing a Basis for Mapping Natural-Language Statements Onto a Database Query Language (LJM, RAF), pp. 192–202.
SIGMODSIGMOD-1979-BunemanF #functional #named
FQL — A Functional Query Language (PB, REF), pp. 52–58.
SIGMODSIGMOD-1979-DeWitt #execution
Query Execution in DIRECT (DJD), pp. 13–22.
VLDBVLDB-1979-Hardgrave #ambiguity #case study
Ambiguity in Processing Boolean Queries on TDMS Tree Structures: A Study of Four Different Philosophies (WTH), pp. 373–397.
VLDBVLDB-1979-Setzer #database #development #relational
Program Development by Transformations Applied to Relational Database Queries (VWS), pp. 436–443.
VLDBVLDB-1979-Svensson #on the #order #performance
On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files (PS), pp. 155–163.
VLDBVLDB-1979-YoussefiW #database #relational
Query Processing in a Relational Database Management System (KY, EW), pp. 409–417.
STOCSTOC-1979-ChandraH #database #relational
Computable Queries for Relational Data Bases (AKC, DH), pp. 309–318.
STOCSTOC-1979-Fredman #data type #problem
A Near Optimal Data Structure for a Type of Range Query Problem (MLF), pp. 62–66.
SIGMODSIGMOD-1978-EpsteinSW #database #distributed #relational
Distributed Query Processing in a Relational Data Base System (RSE, MS, EW), pp. 169–180.
SIGMODSIGMOD-1978-Griffeth #database
Nonprocedural Query Processing for Databases with Access Paths (NDG), pp. 160–168.
SIGIRSIGIR-1978-BaxterJ #database #relational
A Block Structured Query Language for Accessing a Relational Data Base (AQB, RRJ), pp. 109–130.
SIGMODSIGMOD-1977-SchenkP #algorithm #multi
An Algorithm for Servicing Multi-Relational Queries (KLS, JRP), pp. 10–20.
VLDBVLDB-1977-AntonacciDST #implementation #problem #relational
Structure and Implementation of a Relational Query Language for the Problem Solver (FA, PD, VNS, AT), pp. 351–358.
VLDBVLDB-1977-Harris #database #natural language
User-Oriented Data Base Query with the ROBOT Natural Language Query System (LRH), pp. 303–312.
STOCSTOC-1977-ChandraM #database #implementation #relational
Optimal Implementation of Conjunctive Queries in Relational Data Bases (AKC, PMM), pp. 77–90.
SIGMODSIGMOD-1976-WongY #composition #named
Decomposition — A Strategy for Query Processing (EW, KY), p. 155.
ICSEICSE-1976-KerschbergOP #relational
A Synthetic English Query Language for a Relational Accociative Processor (LK, EAO, JESP), pp. 505–519.
ICSEICSE-1976-McLeod
The Translation and Compatibility of SEQUEL and Query by Example (DM), pp. 520–526.
SIGMODSIGMOD-1975-AstrahanC #implementation
Implementation of a Structured English Query Language (MMA, DDC), p. 54.
SIGMODSIGMOD-1975-Stonebraker #constraints #implementation
Implementation of Integrity Constraints and Views by Query Modification (MS), pp. 65–78.
VLDBVLDB-1975-Burkhard #design
Partial-Match Queries and File Designs (WAB), pp. 523–525.
VLDBVLDB-1975-FarleyS #database #execution #relational
Query Execution and Index Selection for Relational Data Bases (GF, SAS), p. 519.
SIGMODSIGFIDET-1974-ChamberlinB #named
SEQUEL: A Structured English Query Language (DDC, RFB), pp. 249–264.
SIGIRSIGIR-1973-BoyceCHK #relational #specification
Specifying Queries as Relational Expressions (RFB, DDC, MH, WFKI), pp. 31–47.
SIGIRSIGIR-1973-Waksman #information retrieval
Information Retrieval and the Query Language (AW), pp. 61–70.
SIGIRSIGIR-1971-Kuhn #quantifier
Quantification in Query Systems (JLK), pp. 81–93.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.