BibSLEIGH — queri stem

Used together with:

process (395)
data (359)
databas (355)
base (340)
optim (319)

Stem queri$ (all stems)

3386 papers:

PODS-2015-AmelootGKNS #query: Parallel-Correctness and Transferability for Conjunctive Queries (TJA, GG, BK, FN, TS), pp. 47–58.
PODS-2015-FanGCDL #big data #query: Querying Big Data by Accessing Small Data (WF, FG, YC, TD, PL), pp. 173–184.
PODS-2015-GrozM #query: Skyline Queries with Noisy Comparisons (BG, TM), pp. 185–198.
PODS-2015-Kapralov #complexity #nearest neighbour #query #trade-off: Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search (MK), pp. 329–342.
PODS-2015-KoutrisW #complexity #consistency #constraints #query #self: The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints (PK, JW), pp. 17–29.
PODS-2015-Ullman #linear #multi #query: Private Multiplicative Weights Beyond Linear Queries (JU), pp. 303–312.
SIGMOD-2015-Atre #query: Left Bit Right: For SPARQL Join Queries with OPTIONAL Patterns (Left-outer-joins) (MA), pp. 1793–1808.
SIGMOD-2015-BergmanMNT #query: Query-Oriented Data Cleaning with Oracles (MB, TM, SN, WCT), pp. 1199–1214.
SIGMOD-2015-Camacho-Rodriguez #named #parallel #xml: PAXQuery: Parallel Analytical XML Processing (JCR, DC, IM, JAMN), pp. 1117–1122.
SIGMOD-2015-ChenGLJCZ #metric #nondeterminism #query: Indexing Metric Uncertain Data for Range Queries (LC, YG, XL, CSJ, GC, BZ), pp. 951–965.
SIGMOD-2015-ChuBS #database #evaluation #parallel #performance #query #theory and practice: From Theory to Practice: Efficient Join Query Evaluation in a Parallel Database System (SC, MB, DS), pp. 63–78.
SIGMOD-2015-GuoCC #algorithm #keyword #performance #query: Efficient Algorithms for Answering the m-Closest Keywords Query (TG, XC, GC), pp. 405–418.
SIGMOD-2015-GuoZLTB #query: Location-Aware Pub/Sub System: When Continuous Moving Queries Meet Dynamic Event Streams (LG, DZ, GL, KLT, ZB), pp. 843–857.
SIGMOD-2015-HangKD #data access #named #query: ENKI: Access Control for Encrypted Query Processing (IH, FK, ED), pp. 183–196.
SIGMOD-2015-JiZJNHF #data type #execution #quality #query: Quality-Driven Continuous Query Execution over Out-of-Order Data Streams (YJ, HZ, ZJ, AN, GH, CF), pp. 889–894.
SIGMOD-2015-MeneghettiMCC #evaluation #query: Output-sensitive Evaluation of Prioritized Skyline Queries (NM, DM, PC, JC), pp. 1955–1967.
SIGMOD-2015-PapailiouTKK #adaptation #query: Graph-Aware, Workload-Adaptive SPARQL Query Caching (NP, DT, PK, NK), pp. 1777–1792.
SIGMOD-2015-PengW #probability #query: k-Hit Query: Top-k Query with Probabilistic Utility Function (PP, RCWW), pp. 577–592.
SIGMOD-2015-PerelmanR #compilation #named #query #worst-case: DunceCap: Compiling Worst-Case Optimal Query Plans (AP, CR), pp. 2075–2076.
SIGMOD-2015-PsallidasDCC #named #query: S4: Top-k Spreadsheet-Style Search for Query Discovery (FP, BD, KC, SC), pp. 2001–2016.
SIGMOD-2015-RazniewskiKNS #database #identification #query: Identifying the Extent of Completeness of Query Answers over Partially Complete Databases (SR, FK, WN, DS), pp. 561–576.
SIGMOD-2015-ScheibliDB #3d #distributed #interactive #named #query #visualisation: QE3D: Interactive Visualization and Exploration of Complex, Distributed Query Plans (DS, CD, AB), pp. 877–881.
SIGMOD-2015-TrummerK #algorithm #incremental #multi #optimisation #query: An Incremental Anytime Algorithm for Multi-Objective Query Optimization (IT, CK), pp. 1941–1953.
SIGMOD-2015-TuR #named #query #using: DunceCap: Query Plans Using Generalized Hypertree Decompositions (ST, CR), pp. 2077–2078.
SIGMOD-2015-UlrichG #compilation #query: The Flatter, the Better: Query Compilation Based on the Flattening Transformation (AU, TG), pp. 1421–1426.
SIGMOD-2015-YangWWW #approximate #performance #query #string: Local Filtering: Improving the Performance of Approximate Queries on String Collections (XY, YW, BW, WW), pp. 377–392.
VLDB-2015-AlyAMAHEO #adaptation #clustering: A Demonstration of AQWA: Adaptive Query-Workload-Aware Partitioning of Big Spatial Data (AMA, ASA, ARM, WGA, MSH, HE, MO), pp. 1968–1979.
VLDB-2015-AlyMHAOEQ #adaptation #clustering #named: AQWA: Adaptive Query-Workload-Aware Partitioning of Big Spatial Data (AMA, ARM, MSH, WGA, MO, HE, TQ), pp. 2062–2073.
VLDB-2015-AmsterdamerKM #interface #natural language #query: A Natural Language Interface for Querying General and Individual Knowledge (YA, AK, TM), pp. 1430–1441.
VLDB-2015-BenediktLT #constraints #data access #query: Querying with Access Patterns and Integrity Constraints (MB, JL, ET), pp. 690–701.
VLDB-2015-BergmanMNT #named #query: QOCO: A Query Oriented Data Cleaning System with Oracles (MB, TM, SN, WCT), pp. 1900–1911.
VLDB-2015-BursztynGM #performance #query #rdf: Reformulation-based query answering in RDF: alternatives and performance (DB, FG, IM), pp. 1888–1899.
VLDB-2015-CebiricGM #graph #query #rdf #summary: Query-Oriented Summarization of RDF Graphs (SC, FG, IM), pp. 2012–2023.
VLDB-2015-ConsensFKP #bisimulation #query #summary: S+EPPs: Construct and Explore Bisimulation Summaries, plus Optimize Navigational Queries; all on Existing SPARQL Systems (MPC, VF, SK, GP), pp. 2028–2039.
VLDB-2015-DasYZVVKGKM #database #in memory #optimisation #query: Query Optimization in Oracle 12c Database In-Memory (DD, JY, MZ, SRV, NV, RK, PG, JK, NM), pp. 1770–1781.
VLDB-2015-DeutchGM #datalog #query #source code #using: Selective Provenance for Datalog Programs Using Top-K Queries (DD, AG, YM), pp. 1394–1405.
VLDB-2015-DyresonBG #dependence #query: Virtual eXist-db: Liberating Hierarchical Queries from the Shackles of Access Path Dependence (CED, SSB, RG), pp. 1932–1943.
VLDB-2015-FaulknerBL #query: k-Regret Queries with Nonlinear Utilities (TKF, WB, AL), pp. 2098–2109.
VLDB-2015-GaoL0ZZ #query: Answering Why-not Questions on Reverse Top-k Queries (YG, QL, GC, BZ, LZ), pp. 738–749.
VLDB-2015-HammoudRNBS #adaptation #communication #distributed #named #query #rdf: DREAM: Distributed RDF Engine with Adaptive Query Planner and Minimal Communication (MH, DAR, RN, SMRB, SS), pp. 654–665.
VLDB-2015-HarbiAKM #dataset #query #rdf: Evaluating SPARQL Queries on Massive RDF Datasets (RH, IA, PK, NM), pp. 1848–1859.
VLDB-2015-HeWKCLYL #named #query: SDB: A Secure Query Processing System with Data Interoperability (ZH, WKW, BK, DWLC, RL, SMY, EL), pp. 1876–1887.
VLDB-2015-JayaramGL #graph #interactive #interface #named #query #visual notation: VIIQ: Auto-Suggestion Enabled Visual Interface for Interactive Graph Query Formulation (NJ, SG, CL), pp. 1940–1951.
VLDB-2015-JiangN #feedback #interactive #named #query #specification: SnapToQuery: Providing Interactive Feedback during Exploratory Query Specification (LJ, AN), pp. 1250–1261.
VLDB-2015-KatsarouNT #performance #query #scalability: Performance and Scalability of Indexed Subgraph Query Processing Methods (FK, NN, PT), pp. 1566–1577.
VLDB-2015-KhanC #graph #modelling #nondeterminism #on the #query: On Uncertain Graphs Modeling and Queries (AK, LC), pp. 2042–2053.
VLDB-2015-KimSHHC #morphism #query #rdf: Taming Subgraph Isomorphism for RDF Query Processing (JK, HS, WSH, SH, HC), pp. 1238–1249.
VLDB-2015-LeisKK0 #performance #query #sql: Efficient Processing of Window Functions in Analytical SQL Queries (VL, KK, AK, TN), pp. 1058–1069.
VLDB-2015-LiCM #approach #data-driven #query: Query From Examples: An Iterative, Data-Driven Approach to Query Construction (HL, CYC, DM), pp. 2158–2169.
VLDB-2015-MouratidisZP #query #rank: Maximum Rank Query (KM, JZ, HP), pp. 1554–1565.
VLDB-2015-NagarkarCB #query: Compressed Spatial Hierarchical Bitmap (cSHB) Indexes for Efficiently Processing Spatial Range Query Workloads (PN, KSC, AB), pp. 1382–1393.
VLDB-2015-ParkMS #pipes and filters #probability #query #using: Processing of Probabilistic Skyline Queries Using MapReduce (YP, JKM, KS), pp. 1406–1417.
VLDB-2015-PottiP #approximate #named #paradigm #query: DAQ: A New Paradigm for Approximate Query Processing (NP, JMP), pp. 898–909.
VLDB-2015-WuHYY #evaluation #performance #query #visualisation: Efficient Evaluation of Object-Centric Exploration Queries for Visualization (YW, BH, JY, CY), pp. 1752–1763.
VLDB-2015-WylotCG #query #web: A Demonstration of TripleProv: Tracking and Querying Provenance over Web Data (MW, PCM, PTG), pp. 1992–2003.
VLDB-2015-YangCLW #analysis #nearest neighbour #query: Reverse k Nearest Neighbors Query Processing: Experiments and Analysis (SY, MAC, XL, WW), pp. 605–616.
ITiCSE-2015-AhadiPBL #query #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.
ITiCSE-2015-Tudor #learning #optimisation #query #xml: Virtual Learning Laboratory about Query Optimization against XML Data (LNT), p. 348.
ESOP-2015-CastagnaI0B #calculus #pattern matching #xquery: A Core Calculus for XQuery 3.0 — Combining Navigational and Pattern Matching Approaches (GC, HI, KN, VB), pp. 232–256.
ESOP-2015-GordonRSBRGT #probability #query #source code #spreadsheet: Probabilistic Programs as Spreadsheet Queries (ADG, CVR, MS, JB, NR, TG, DT), pp. 1–25.
ICSME-2015-Balachandran #query #repository #scalability: Query by example in large-scale code repositories (VB), pp. 467–476.
ICSME-2015-NagyC #fault #mining #query #sql #stack overflow: Mining Stack Overflow for discovering error patterns in SQL queries (CN, AC), pp. 516–520.
SANER-2015-JiangSPLZ #comprehension #developer #interactive #natural language #query: Understanding developers’ natural language queries with interactive clarification (SJ, LS, XP, ZL, WZ), pp. 13–22.
SANER-2015-LuSWLD #code search #effectiveness #query: Query expansion via WordNet for effective code search (ML, XS, SW, DL, YD), pp. 545–549.
SANER-2015-NagyMC #approach #concept #query #sql: Where was this SQL query executed? a static concept location approach (CN, LM, AC), pp. 580–584.
SCAM-2015-LemosPSL #code search #query #question #scalability: Can the use of types and query expansion help improve large-scale code search? (OALL, ACdP, HS, CVL), pp. 41–50.
STOC-2015-ChenDST #adaptation #query #testing: Boolean Function Monotonicity Testing Requires (Almost) n 1/2 Non-adaptive Queries (XC, AD, RAS, LYT), pp. 519–528.
STOC-2015-DinurHK #composition #fault #query: Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (ID, PH, GK), pp. 267–276.
CIAA-J-2013-DebarbieuxGNSZ15 #automaton #query #word #xml #xpath: Early nested word automata for XPath query answering on XML streams (DD, OG, JN, TS, MZ), pp. 100–125.
ICALP-v1-2015-GawrychowskiMW #matrix #query: Submatrix Maximum Queries in Monge Matrices Are Equivalent to Predecessor Search (PG, SM, OW), pp. 580–592.
ICALP-v1-2015-KaniewskiLW #complexity #query: Query Complexity in Expectation (JK, TL, RdW), pp. 761–772.
ICALP-v1-2015-KannanM0 #complexity #graph #query: Near-Linear Query Complexity for Graph Inference (SK, CM, HZ), pp. 773–784.
ICFP-2015-GenevesG #problem #static typing #type system #xquery: XQuery and static typing: tackling the problem of backward axes (PG, NG), pp. 88–100.
ICGT-2015-BurUHV #pattern matching #search-based: Local Search-Based Pattern Matching Features in EMF-IncQuery (MB, ZU, ÁH, DV), pp. 275–282.
CHI-2015-ZgraggenDFD #query #regular expression #sequence #visual notation: (s|qu)eries: Visual Regular Expressions for Querying and Exploring Event Sequences (EZ, SMD, DF, RD), pp. 2683–2692.
HIMI-IKC-2015-ZengCLSHC #framework #mobile #query: Scene Feature Recognition-Enabled Framework for Mobile Service Information Query System (YCZ, YHC, TYL, MJS, PYH, GLC), pp. 64–74.
ICEIS-v1-2015-MeisenKMRJ #named #online #query: TIDAQL — A Query Language Enabling on-Line Analytical Processing of Time Interval Data (PM, DK, TM, MR, SJ), pp. 54–66.
ICEIS-v1-2015-MendoncaMSS #approach #named #query: CORE — A Context-based Approach for Rewriting User Queries (AM, PM, DS, ACS), pp. 391–398.
ICEIS-v1-2015-SirohiS #multitenancy #optimisation #performance #query #sql: Context-sensitive Indexes in RDBMS for Performance Optimization of SQL Queries in Multi-tenant/Multi-application Environments (AKS, VS), pp. 259–270.
ICEIS-v2-2015-MaranMAWO #information management #query: Proactive Domain Data Querying based on Context Information in Ambient Assisted Living Environments (VM, AM, IA, LKW, JPMdO), pp. 610–617.
ICEIS-v3-2015-LozanoCPA #named #ontology #query: RockQuery — An Ontology-based Data Querying Tool (JL, JLC, MP, MA), pp. 25–33.
ECIR-2015-BouchouchaLN #query #towards: Towards Query Level Resource Weighting for Diversified Query Expansion (AB, XL, JYN), pp. 1–12.
ECIR-2015-EdwardsKA #design #interface #performance #query: The Impact of Query Interface Design on Stress, Workload and Performance (AE, DK, LA), pp. 691–702.
ECIR-2015-PRBM #query #web: Entity Linking for Web Search Queries (DP, SR, PB, SM), pp. 394–399.
ECIR-2015-VerberneSJK #interactive #personalisation #query #simulation: User Simulations for Interactive Search: Evaluating Personalized Query Suggestion (SV, MS, KJ, WK), pp. 678–690.
KDD-2015-MottinBG #graph #query: Graph Query Reformulation with Diversity (DM, FB, FG), pp. 825–834.
KDD-2015-RuchanskyCT #matrix #query: Matrix Completion with Queries (NR, MC, ET), pp. 1025–1034.
KDD-2015-ZoumpatianosLPG #query: Query Workloads for Data Series Indexes (KZ, YL, TP, JG), pp. 1603–1612.
MLDM-2015-SejalSTAVIP #graph #query #similarity: Query Click and Text Similarity Graph for Query Suggestions (DS, KGS, VT, DA, KRV, SSI, LMP), pp. 328–341.
SEKE-2015-ChavezM #information retrieval #ontology #query #using: An Information Retrieval Model using Query Expansion based on Ontologies in the Computer Science Domain (BGCC, AM), pp. 652–655.
SIGIR-2015-Baeza-Yates #incremental #query: Incremental Sampling of Query Logs (RABY), pp. 1093–1096.
SIGIR-2015-EickhoffDT #query: An Eye-Tracking Study of Query Reformulation (CE, SD, VT), pp. 13–22.
SIGIR-2015-GrbovicDRSB #query: Context- and Content-aware Embeddings for Query Rewriting in Sponsored Search (MG, ND, VR, FS, NB), pp. 383–392.
SIGIR-2015-GuptaB #information retrieval #query: Information Retrieval with Verbose Queries (MG, MB), pp. 1121–1124.
SIGIR-2015-HarelY #clustering #identification #query: Modularity-Based Query Clustering for Identifying Users Sharing a Common Condition (MGOH, EYT), pp. 819–822.
SIGIR-2015-HarveyHE #learning #query: Learning by Example: Training Users with High-quality Query Suggestions (MH, CH, DE), pp. 133–142.
SIGIR-2015-Hasanuzzaman0DF #comprehension #query: Understanding Temporal Query Intent (MH, SS, GD, SF), pp. 823–826.
SIGIR-2015-LiDDCZB #behaviour #markov #process #query: Analyzing User’s Sequential Behavior in Query Auto-Completion via Markov Processes (LL, HD, AD, YC, HZ, RABY), pp. 123–132.
SIGIR-2015-LiLZS #matrix #modelling #multi #retrieval #using: Modeling Multi-query Retrieval Tasks Using Density Matrix Transformation (QL, JL, PZ, DS), pp. 871–874.
SIGIR-2015-MehrotraY #learning #query #rank #using: Representative & Informative Query Selection for Learning to Rank using Submodular Functions (RM, EY), pp. 545–554.
SIGIR-2015-Mitra #distributed #query #using: Exploring Session Context using Distributed Representations of Queries and Reformulations (BM), pp. 3–12.
SIGIR-2015-OardSWJH #query: A Test Collection for Spoken Gujarati Queries (DWO, RS, JW, AJ, CH), pp. 919–922.
SIGIR-2015-OdijkMSR #modelling #query: Dynamic Query Modeling for Related Content Finding (DO, EM, IS, MdR), pp. 33–42.
SIGIR-2015-SantoMMO #query: Comparing Approaches for Query Autocompletion (GDS, RM, CM, IO), pp. 775–778.
SIGIR-2015-ShokouhiG #query #ranking #recommendation: From Queries to Cards: Re-ranking Proactive Card Recommendations Based on Reactive Search History (MS, QG), pp. 695–704.
SIGIR-2015-VuurensVBM #ad hoc #online #query: Online News Tracking for Ad-Hoc Queries (JBPV, APdV, RB, PM), pp. 1047–1048.
SIGIR-2015-ZhangGKDDCGH #adaptation #feedback #named #query: adaQAC: Adaptive Query Auto-Completion via Implicit Negative Feedback (AZ, AG, WK, HD, AD, YC, CAG, JH), pp. 143–152.
OOPSLA-2015-FengWDL #control flow #interprocedural: EXPLORER : query- and demand-driven exploration of interprocedural control flow properties (YF, XW, ID, CL), pp. 520–534.
OOPSLA-2015-GveroK #java #query: Synthesizing Java expressions from free-form queries (TG, VK), pp. 416–432.
GPCE-2015-NogueraJ #modelling #query: Model querying with query models (CN, VJ), pp. 181–184.
SAC-2015-AissiGSS #evaluation #framework #personalisation #query #recommendation: Personalized recommendation of SOLAP queries: theoretical framework and experimental evaluation (SA, MSG, TS, LBS), pp. 1008–1014.
SAC-2015-BritoE #branch #named #performance #query: BranchGuide: an indexing technique for efficient, lossless processing of branching path queries (TBV, GEdS), pp. 1086–1092.
SAC-2015-HogenboomNJFV #distributed #optimisation #query #rdf: RDF chain query optimization in a distributed environment (AH, EN, MJ, FF, DV), pp. 353–359.
SAC-2015-HsiehNKC #approximate #performance #query #recommendation: Efficient approximate thompson sampling for search query recommendation (CCH, JN, TK, JC), pp. 740–746.
SAC-2015-RychnovskyH #generative #query #xml #xpath: Generating XML data for XPath queries (DR, IH), pp. 724–731.
SAC-2015-Schlotterer #query: From context to query (JS), pp. 1108–1109.
ESEC-FSE-2015-MorenoBHPORM #re-engineering #retrieval: Query-based configuration of text retrieval solutions for software engineering tasks (LM, GB, SH, MDP, RO, BR, AM), pp. 567–578.
ESEC-FSE-2015-Prasetya #generative #java #named #query #testing: T3i: a tool for generating and querying test suites for Java (ISWBP), pp. 950–953.
ICSE-v2-2015-GveroK #interactive #query #synthesis #using: Interactive Synthesis Using Free-Form Queries (TG, VK), pp. 689–692.
ICSE-v2-2015-Stevens #declarative #query: A Declarative Foundation for Comprehensive History Querying (RS), pp. 907–910.
HPCA-2015-HsuZLMWMTD #named #query: Adrenaline: Pinpointing and reining in tail queries with quick voltage boosting (CHH, YZ, MAL, DM, TFW, JM, LT, RGD), pp. 271–282.
CAV-2015-RandourRS #markov #multi #process #query: Percentile Queries in Multi-dimensional Markov Decision Processes (MR, JFR, OS), pp. 123–139.
CSL-2015-BovaM #finite #first-order #query: First-Order Queries on Finite Abelian Groups (SB, BM), pp. 41–59.
ICLP-J-2015-MannaRT #consistency #query #scalability: Taming primary key violations to query large inconsistent data via ASP (MM, FR, GT), pp. 696–710.
LICS-2015-AmarilliB #finite #query #strict: Finite Open-World Query Answering with Number Restrictions (AA, MB), pp. 305–316.
LICS-2015-BienvenuKP #complexity #owl #query: Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results (MB, SK, VVP), pp. 317–328.
LICS-2015-FigueiraL #graph #logic #performance #query: Path Logics for Querying Graphs: Combining Expressiveness and Efficiency (DF, LL), pp. 329–340.
LICS-2015-GogaczM #decidability #query: The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (TG, JM), pp. 281–292.
SAT-2015-KullmannM #query: Computing Maximal Autarkies with Few and Simple Oracle Queries (OK, JMS), pp. 138–155.
PODS-2014-ArenasGP #query #semantics #web: Expressive languages for querying the semantic web (MA, GG, AP), pp. 14–26.
PODS-2014-Barcelo0V #evaluation #query #question: Does query evaluation tractability help query containment? (PB, MR, MYV), pp. 188–199.
PODS-2014-BeameKS #parallel #query: Skew in parallel query processing (PB, PK, DS), pp. 212–223.
PODS-2014-DurandSS #database #first-order #query: Enumerating answers to first-order queries over databases of low degree (AD, NS, LS), pp. 121–131.
PODS-2014-FanGL #big data #independence #on the #query: On scale independence for querying big data (WF, FG, LL), pp. 51–62.
PODS-2014-FinkO #database #probability #query: A dichotomy for non-repeating queries with negation in probabilistic databases (RF, DO), pp. 144–155.
PODS-2014-GrecoS #hybrid #query: Counting solutions to conjunctive queries: structural and hybrid tractability (GG, FS), pp. 132–143.
PODS-2014-PatilTSNV #category theory #query: Categorical range maxima queries (MP, SVT, RS, YN, JSV), pp. 266–277.
SIGMOD-2014-AgarwalMKTJMMS #approximate #performance #query #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.
SIGMOD-2014-AmsterdamerDMNS #mining #named #query: OASSIS: query driven crowd mining (YA, SBD, TM, SN, AS), pp. 589–600.
SIGMOD-2014-AntovaESGPW #optimisation #query: Optimizing queries over partitioned tables in MPP systems (LA, AEH, MAS, ZG, MP, FW), pp. 373–384.
SIGMOD-2014-ArasuEKR #query: Querying encrypted data (AA, KE, RK, RR), pp. 1259–1261.
SIGMOD-2014-BinnigSZ #named #query: DoomDB: kill the query (CB, AS, EZ), pp. 913–916.
SIGMOD-2014-CheneyLW #evaluation #multi #performance #query #relational: Query shredding: efficient relational evaluation of queries over nested multisets (JC, SL, PW), pp. 1027–1038.
SIGMOD-2014-ChenLWXML #algorithm #network #performance #query: Efficient algorithms for optimal location queries in road networks (ZC, YL, RCWW, JX, GM, CL), pp. 123–134.
SIGMOD-2014-CheungMS #database #lazy evaluation #named #query: Sloth: being lazy is a virtue (when issuing database queries) (AC, SM, ASL), pp. 931–942.
SIGMOD-2014-DimitriadouPD #automation #data analysis #framework #interactive #named #query: Explore-by-example: an automatic query steering framework for interactive data exploration (KD, OP, YD), pp. 517–528.
SIGMOD-2014-DuttH #estimation #query: Plan bouquets: query processing without selectivity estimation (AD, JRH), pp. 1039–1050.
SIGMOD-2014-DyresonBG #query #using: Querying virtual hierarchies using virtual prefix-based numbers (CED, SSB, RG), pp. 791–802.
SIGMOD-2014-FanWW #bound #graph #query: Querying big graphs within bounded resources (WF, XW, YW), pp. 301–312.
SIGMOD-2014-FernandesBRAM #named #query #tuple: PackageBuilder: querying for packages of tuples (KF, MB, RR, AA, AM), pp. 1613–1614.
SIGMOD-2014-GhodsniaBN #optimisation #parallel #query: Parallel I/O aware query optimization (PG, ITB, AN), pp. 349–360.
SIGMOD-2014-HuangCQTY #community #graph #query #scalability: Querying k-truss community in large and dynamic graphs (XH, HC, LQ, WT, JXY), pp. 1311–1322.
SIGMOD-2014-IleanaCDK #constraints #query: Complete yet practical search for minimal query reformulations under constraints (II, BC, AD, YK), pp. 1015–1026.
SIGMOD-2014-KaranasosBKOEXJ #optimisation #query #scalability: Dynamically optimizing queries over large scale data platforms (KK, AB, MK, FÖ, VE, CX, JJ), pp. 943–954.
SIGMOD-2014-KarnagelHLHLHM #performance #query: Demonstrating efficient query processing in heterogeneous environments (TK, MH, ML, DH, WL, MH, VM), pp. 693–696.
SIGMOD-2014-KhanYDK #query #towards: Towards indexing functions: answering scalar product queries (AK, PY, BD, DK), pp. 241–252.
SIGMOD-2014-LeFevreSHTPC14a #big data #multi #named #query: MISO: souping up big data query processing with a multistore system (JL, JS, HH, JT, NP, MJC), pp. 1591–1602.
SIGMOD-2014-LeisBK0 #evaluation #framework #manycore #parallel #query: Morsel-driven parallelism: a NUMA-aware query evaluation framework for the many-core age (VL, PAB, AK, TN), pp. 743–754.
SIGMOD-2014-LiJ #database #interactive #interface #named #natural language #query #relational: NaLIR: an interactive natural language interface for querying relational databases (FL, HVJ), pp. 709–712.
SIGMOD-2014-MondalD #graph #named #query #scalability: EAGr: supporting continuous ego-centric aggregate queries over large dynamic graphs (JM, AD), pp. 1335–1346.
SIGMOD-2014-MottinLVP #query: Searching with XQ: the exemplar query search engine (DM, ML, YV, TP), pp. 901–904.
SIGMOD-2014-MottinMRDPV #interactive #named #problem #query: IQR: an interactive query relaxation system for the empty-answer problem (DM, AM, SBR, GD, TP, YV), pp. 1095–1098.
SIGMOD-2014-NikolicEK #incremental #maintenance #named #query: LINVIEW: incremental view maintenance for complex analytical queries (MN, ME, CK), pp. 253–264.
SIGMOD-2014-PsaroudakisAOA #concurrent #query: Reactive and proactive sharing across concurrent analytical queries (IP, MA, MO, AA), pp. 889–892.
SIGMOD-2014-RanuHS #database #graph #query: Answering top-k representative queries on graph databases (SR, MXH, AKS), pp. 1163–1174.
SIGMOD-2014-RoyS #approach #database #formal method #query: A formal approach to finding explanations for database queries (SR, DS), pp. 1579–1590.
SIGMOD-2014-ShenCCDN #query #tuple: Discovering queries based on example tuples (YS, KC, SC, BD, LN), pp. 493–504.
SIGMOD-2014-SimitsisWBW #named #query: VQA: vertica query analyzer (AS, KW, JB, JW), pp. 701–704.
SIGMOD-2014-SolimanAREGSCGRPWNKB #architecture #big data #composition #named #query: 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.
SIGMOD-2014-TrummerK #approximate #optimisation #query: Approximation schemes for many-objective query optimization (IT, CK), pp. 1299–1310.
SIGMOD-2014-WangKFGKM #framework #performance #query: A sample-and-clean framework for fast and accurate query processing on dirty data (JW, SK, MJF, KG, TK, TM), pp. 469–480.
SIGMOD-2014-WongKCLY #database #query: Secure query processing with data interoperability in a cloud database environment (WKW, BK, DWLC, RL, SMY), pp. 1395–1406.
SIGMOD-2014-WuJZ #graph #nearest neighbour #performance #query #random #scalability: Fast and unified local search for random walk based k-nearest-neighbor query in large graphs (YW, RJ, XZ), pp. 1139–1150.
SIGMOD-2014-XiongHN #approach #distributed #network #performance #query: A software-defined networking based approach for performance management of analytical queries on distributed data stores (PX, HH, JFN), pp. 955–966.
SIGMOD-2014-YangXWWSWY #graph #named #query: SLQ: a user-friendly graph querying system (SY, YX, YW, TW, HS, JW, XY), pp. 893–896.
SIGMOD-2014-ZengGGMZ #approximate #named #query #scalability: ABS: a system for scalable approximate queries with accuracy guarantees (KZ, SG, JG, BM, CZ), pp. 1067–1070.
SIGMOD-2014-ZengGMZ #approximate #estimation #fault #performance #query: The analytical bootstrap: a new method for fast error estimation in approximate query processing (KZ, SG, BM, CZ), pp. 277–288.
SIGMOD-2014-ZhangDI #complexity #on the #optimisation #query: On complexity and optimization of expensive queries in complex event processing (HZ, YD, NI), pp. 217–228.
SIGMOD-2014-ZhuLWX #approach #graph #order #query #reachability #scalability: Reachability queries on large dynamic graphs: a total order approach (ADZ, WL, SW, XX), pp. 1323–1334.
VLDB-2014-AfratiDPU #query: Storing and Querying Tree-Structured Records in Dremel (FNA, DD, MP, JDU), pp. 1131–1142.
VLDB-2014-AlaviZPC #in the cloud #named #performance #query: RASP-QS: Efficient and Confidential Query Services in the Cloud (ZA, LZ, JP, KC), pp. 1685–1688.
VLDB-2014-BenediktLT #named #query: PDQ: Proof-driven Query Answering over Web-based Data (MB, JL, ET), pp. 1553–1556.
VLDB-2014-BonifatiCS #interactive #query: Interactive Join Query Inference with JIM (AB, RC, SS), pp. 1541–1544.
VLDB-2014-CaoFWY #bound #query: Bounded Conjunctive Queries (YC, WF, TW, WY), pp. 1231–1242.
VLDB-2014-DuttNH #approach #named #query #robust: QUEST: An Exploratory Approach to Robust Query Processing (AD, SN, JRH), pp. 1585–1588.
VLDB-2014-GrecoPW #consistency #database #query: Certain Query Answering in Partially Consistent Databases (SG, FP, JW), pp. 353–364.
VLDB-2014-GuarnieriB #query: Optimal Security-Aware Query Processing (MG, DAB), pp. 1307–1318.
VLDB-2014-JayachandranTKN #execution #interactive #query: Combining User Interaction, Speculative Query Execution and Sampling in the DICE System (PJ, KT, NK, AN), pp. 1697–1700.
VLDB-2014-JiangFWX #distance #network #query: Hop Doubling Label Indexing for Point-to-Point Distance Querying on Scale-Free Networks (MJ, AWCF, RCWW, YX), pp. 1203–1214.
VLDB-2014-KarpathiotakisBAA #adaptation #query: Adaptive Query Processing on RAW Data (MK, MB, IA, AA), pp. 1119–1130.
VLDB-2014-KlonatosKRC #performance #query: Building Efficient Query Engines in a High-Level Language (YK, CK, TR, HC), pp. 853–864.
VLDB-2014-KlonatosKRC14a #performance #query: Errata for “Building Efficient Query Engines in a High-Level Language” (PVLDB 7(10): 853-864) (YK, CK, TR, HC), p. 1784.
VLDB-2014-LeiZRE #big data #framework #query: Redoop Infrastructure for Recurring Big Data Queries (CL, ZZ, EAR, MYE), pp. 1589–1592.
VLDB-2014-LiHMW #algorithm #difference #privacy #query: A Data- and Workload-Aware Query Answering Algorithm for Range Queries Under Differential Privacy (CL, MH, GM, YW), pp. 341–352.
VLDB-2014-LiLWB #in the cloud #performance #privacy #query: Fast Range Query Processing with Strong Privacy Protection for Cloud Computing (RL, AXL, ALW, BB), pp. 1953–1964.
VLDB-2014-LinK #on the #query: On Arbitrage-free Pricing for General Data Queries (BRL, DK), pp. 757–768.
VLDB-2014-MottinLVP #query #what: Exemplar Queries: Give me an Example of What You Need (DM, ML, YV, TP), pp. 365–376.
VLDB-2014-NagelBV #code generation #performance #query: Code Generation for Efficient Query Processing in Managed Runtimes (FN, GMB, SDV), pp. 1095–1106.
VLDB-2014-NtarmosPT #database #query #rank: Rank Join Queries in NoSQL Databases (NN, IP, PT), pp. 493–504.
VLDB-2014-ShanbhagS #optimisation #query: Optimizing Join Enumeration in Transformation-based Query Optimizers (AS, SS), pp. 1243–1254.
VLDB-2014-VartakMPP #automation #generative #named #query #visualisation: SEEDB: Automatically Generating Query Visualizations (MV, SM, AGP, NP), pp. 1581–1584.
VLDB-2014-WangZYMLD0 #concurrent #query: Concurrent Analytical Query Processing with GPUs (KW, KZ, YY, SM, RL, XD, XZ), pp. 1011–1022.
VLDB-2014-WeiYLJ #approach #independence #permutation #query #reachability: Reachability Querying: An Independent Permutation Labeling Approach (HW, JXY, CL, RJ), pp. 1191–1202.
VLDB-2014-WuWHN #execution #nondeterminism #predict #query: Uncertainty Aware Query Execution Time Prediction (WW, XW, HH, JFN), pp. 1857–1868.
VLDB-2014-XiaLYMQ #benchmark #metric #named #query #social #social media: BSMA: A Benchmark for Analytical Queries over Social Media Data (FX, YL, CY, HM, WQ), pp. 1573–1576.
VLDB-2014-XiongH #distributed #named #network #performance #query: Pronto: A Software-Defined Networking based System for Performance Management of Analytical Queries on Distributed Data Stores (PX, HH), pp. 1661–1664.
VLDB-2014-YangWSY #graph #query: Schemaless and Structureless Graph Querying (SY, YW, HS, XY), pp. 565–576.
VLDB-2014-ZhangJK #query: Reverse k-Ranks Query (ZZ, CJ, QK), pp. 785–796.
VLDB-2015-ChandramouliGBDPTW14 #incremental #named #query: Trill: A High-Performance Incremental Query Processor for Diverse Analytics (BC, JG, MB, RD, JCP, JFT, JW), pp. 401–412.
VLDB-2015-GicevaARH14 #deployment #multi #query: Deployment of Query Plans on Multicores (JG, GA, TR, TH), pp. 233–244.
VLDB-2015-HeZH14 #architecture #cpu #gpu #query: In-Cache Query Co-Processing on Coupled CPU-GPU Architectures (JH, SZ, BH), pp. 329–340.
VLDB-2015-Li0QYZ014 #query #set #using: Processing Moving kNN Queries Using Influential Neighbor Sets (CL, YG, JQ, GY, RZ, WY), pp. 113–124.
VLDB-2015-SunWQZL14 #approximate #named #nearest neighbour #query: SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index (YS, WW, JQ, YZ, XL), pp. 1–12.
VLDB-2015-TrummerK14 #multi #optimisation #parametricity #query: Multi-Objective Parametric Query Optimization (IT, CK), pp. 221–232.
ITiCSE-2014-MI #bound #query: A method to prove query lower bounds (JM, SI), pp. 81–86.
TACAS-2014-HerreraWP #network #query #reduction: Quasi-Equal Clock Reduction: More Networks, More Queries (CH, BW, AP), pp. 295–309.
CSMR-WCRE-2014-GeSDM #how #query #recommendation: How the Sando search tool recommends queries (XG, DCS, KD, ERMH), pp. 425–428.
CSMR-WCRE-2014-HillRFM #case study #code search #query #refinement: NL-based query refinement and contextualized code search results: A user study (EH, MRV, JAF, GM), pp. 34–43.
CSMR-WCRE-2014-UjhelyiHVCSVF #comparison #detection #query: Anti-pattern detection with model queries: A comparison of approaches (ZU, ÁH, DV, NIC, GS, LV, RF), pp. 293–302.
ICSME-2014-EddyK #code search #query #source code #using: Using Structured Queries for Source Code Search (BPE, NAK), pp. 431–435.
ICSME-2014-Haiduc #query #re-engineering #retrieval: Supporting Query Formulation for Text Retrieval Applications in Software Engineering (SH), pp. 657–662.
ICSME-2014-StevensR #query #using: Querying the History of Software Projects Using QWALKEKO (RS, CDR), pp. 585–588.
MSR-2014-LemosPZL #automation #code search #interface #query: Thesaurus-based automatic query expansion for interface-driven code search (OALL, ACdP, FCZ, CVL), pp. 212–221.
PEPM-2014-CheneyLRW #effectiveness #query: Effective quotation: relating approaches to language-integrated query (JC, SL, GR, PW), pp. 15–26.
PLDI-2014-SousaDVDG #query: Consolidation of queries with user-defined functions (MS, ID, DV, TD, CG), p. 56.
STOC-2014-Babichenko #approximate #complexity #nash #query: Query complexity of approximate nash equilibria (YB), pp. 535–544.
STOC-2014-Chechik #approximate #constant #distance #query: Approximate distance oracles with constant query time (SC), pp. 654–663.
DLT-J-2013-TanV14 #graph #query #regular expression: Regular Expressions for Querying Data graphs (TT, DV), pp. 971–986.
ICALP-v1-2014-Ben-SassonV #query: Short PCPs with Projection Queries (EBS, EV), pp. 163–173.
ICALP-v1-2014-FeigeJ #preprocessor #query: Demand Queries with Preprocessing (UF, SJ), pp. 477–488.
ICALP-v1-2014-GawrychowskiMW #matrix #query: Improved Submatrix Maximum Queries in Monge Matrices (PG, SM, OW), pp. 525–537.
ICALP-v1-2014-WimmerWZ #complexity #matrix #query: Optimal Query Complexity for Estimating the Trace of a Matrix (KW, YW, PZ), pp. 1051–1062.
CHI-2014-CraggsSA #crowdsourcing #named #query #semantics #video #web: ThumbReels: query sensitive web video previews based on temporal, crowdsourced, semantic tagging (BC, MKS, JA), pp. 1217–1220.
DUXU-DI-2014-Davis #design #image #interactive #query #retrieval: Interfacing CBIR: Designing Interactive Widgets to Query Attribute Data in Face Image Retrieval (TD), pp. 425–434.
HIMI-DE-2014-CunhaFPS #modelling #query #spreadsheet #visual notation: Graphical Querying of Model-Driven Spreadsheets (JC, JPF, RP, JS), pp. 419–430.
HIMI-DE-2014-GombosK #dataset #query #recommendation: SPARQL Query Writing with Recommendations Based on Datasets (GG, AK), pp. 310–319.
ICEIS-v1-2014-BrodskyHL #named #query: DG-Query: An XQuery-based Decision Guidance Query Language (AB, SGH, JL), pp. 152–163.
ICEIS-v1-2014-FreireCSS #process #query #semantics: Preserving the Original Query Semantics in Routing Processes (CF, NC, DS, ACS), pp. 70–80.
CIKM-2014-AnandMBB #optimisation #query: Phrase Query Optimization on Inverted Indexes (AA, IM, SJB, KB), pp. 1807–1810.
CIKM-2014-BoghCSA #data type #named: Hashcube: A Data Structure for Space- and Query-Efficient Skycube Compression (KSB, SC, DS, IA), pp. 1767–1770.
CIKM-2014-BottcherLZ #equivalence #query: Pulling Conjunctive Query Equivalence out of the Bag (SB, SL, LZ), pp. 41–50.
CIKM-2014-CaiLR #personalisation #query: Time-sensitive Personalized Query Auto-Completion (FC, SL, MdR), pp. 1599–1608.
CIKM-2014-CamposDJN #named #query: GTE-Rank: Searching for Implicit Temporal Query Results (RC, GD, AMJ, CN), pp. 2081–2083.
CIKM-2014-GuptaB #identification #query: Identifying Time Intervals of Interest to Queries (DG, KB), pp. 1835–1838.
CIKM-2014-HofmannMRS #interactive #query: An Eye-tracking Study of User Interactions with Query Auto Completion (KH, BM, FR, MS), pp. 549–558.
CIKM-2014-Huo0LM #performance #query: Improving Tail Query Performance by Fusion Model (SH, MZ, YL, SM), pp. 559–568.
CIKM-2014-KimC14a #named #query: TensorDB: In-Database Tensor Manipulation with Tensor-Relational Query Plans (MK, KSC), pp. 2039–2041.
CIKM-2014-MahdabiC #mining #network #recommendation #retrieval: Query-Driven Mining of Citation Networks for Patent Citation Retrieval and Recommendation (PM, FC), pp. 1659–1668.
CIKM-2014-MengCS #analysis #approximate #keyword #query #semantics: Semantic Approximate Keyword Query Based on Keyword and Query Coupling Relationship Analysis (XM, LC, JS), pp. 529–538.
CIKM-2014-OzdemirayA #performance #predict #query: Query Performance Prediction for Aspect Weighting in Search Result Diversification (AMO, ISA), pp. 1871–1874.
CIKM-2014-PaikO #fixpoint #query: A Fixed-Point Method for Weighting Terms in Verbose Informational Queries (JHP, DWO), pp. 131–140.
CIKM-2014-ShaoKTG #case study #complexity #distance #navigation #network #query: Travel distance versus navigation complexity: a study on different spatial queries on road networks (JS, LK, ET, LG), pp. 1791–1794.
CIKM-2014-SongG #difference #named #privacy #query: Aroma: A New Data Protection Method with Differential Privacy and Accurate Query Answering (CS, TG), pp. 1569–1578.
CIKM-2014-SongWCW #comprehension #query: Transfer Understanding from Head Queries to Tail Queries (YS, HW, WC, SW), pp. 1299–1308.
CIKM-2014-SpirinHDKB #analysis #facebook #graph #network #online #people #query #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.
CIKM-2014-TanC #query #social #social media: Succinct Queries for Linking and Tracking News in Social Media (LT, CLAC), pp. 1883–1886.
CIKM-2014-TaoW #performance #predict #query: Query Performance Prediction By Considering Score Magnitude and Variance Together (YT, SW), pp. 1891–1894.
CIKM-2014-VermaY #query: Entity Oriented Task Extraction from Query Logs (MV, EY), pp. 1975–1978.
CIKM-2014-VouzoukidouAC #named #query #ranking #realtime: MeowsReader: Real-Time Ranking and Filtering of News with Generalized Continuous Top-k Queries (NV, BA, VC), pp. 2066–2068.
CIKM-2014-WuF #documentation #query #scalability: Document Prioritization for Scalable Query Processing (HW, HF), pp. 1609–1618.
CIKM-2014-WuF14a #modelling #performance #query: Analytical Performance Modeling for Top-K Query Processing (HW, HF), pp. 1619–1628.
CIKM-2014-YuanW0 #graph #nondeterminism #query #scalability: Pattern Match Query in a Large Uncertain Graph (YY, GW, LC), pp. 519–528.
CIKM-2014-ZengBLLL #identification #keyword #named #query #relational: ExpressQ: Identifying Keyword Context and Search Target in Relational Keyword Queries (ZZ, ZB, TNL, MLL, TWL), pp. 31–40.
CIKM-2014-Zhang0T #collaboration #framework #named #probability #query: MaC: A Probabilistic Framework for Query Answering with Machine-Crowd Collaboration (CJZ, LC, YT), pp. 11–20.
CIKM-2014-ZhaoCCY #query: Query Augmentation based Intent Matching in Retail Vertical Ads (HZ, YC, JFC, TWY), pp. 619–628.
ECIR-2014-BouchouchaLN #multi #query: Integrating Multiple Resources for Diversified Query Expansion (AB, XL, JYN), pp. 437–442.
ECIR-2014-BueyGETIM #named #query #semantics: SQX-Lib: Developing a Semantic Query Expansion System in a Media Group (MGB, ALG, SE, RT, SI, EM), pp. 780–783.
ECIR-2014-CamposDJN #clustering #interface #named #query: GTE-Cluster: A Temporal Search Interface for Implicit Temporal Queries (RC, GD, AMJ, CN), pp. 775–779.
ECIR-2014-CraveiroMM #query: Query Expansion with Temporal Segmented Texts (OC, JM, HM), pp. 612–617.
ECIR-2014-KabaryS #gesture #query #retrieval #sketching #specification #using #video: Using Hand Gestures for Specifying Motion Queries in Sketch-Based Video Retrieval (IAK, HS), pp. 733–736.
ECIR-2014-KazaiS #difference #evaluation #information retrieval #performance #query: Dissimilarity Based Query Selection for Efficient Preference Based IR Evaluation (GK, HS), pp. 172–183.
ECIR-2014-LiuYF #interactive #named #query: EntEXPO: An Interactive Search System for Entity-Bearing Queries (XL, PY, HF), pp. 784–788.
ECIR-2014-NguyenK #query #topic: Leveraging Dynamic Query Subtopics for Time-Aware Search Result Diversification (TNN, NK), pp. 222–234.
ECIR-2014-ThumaRO #detection #query #retrieval: Detecting Missing Content Queries in an SMS-Based HIV/AIDS FAQ Retrieval System (ET, SR, IO), pp. 247–259.
ECIR-2014-VerberneSK #query: Query Term Suggestion in Academic Search (SV, MS, WK), pp. 560–566.
ECIR-2014-VoskaridesOTWR #streaming: Query-Dependent Contextualization of Streaming Data (NV, DO, MT, WW, MdR), pp. 706–712.
ECIR-2014-YangPSS #case study #e-commerce #query #scalability #using: A Study of Query Term Deletion Using Large-Scale E-commerce Search Logs (BY, NP, GS, NS), pp. 235–246.
ICML-c1-2014-GiesekeHOI #nearest neighbour #query: Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs (FG, JH, CEO, CI), pp. 172–180.
ICML-c2-2014-GaboardiAHRW #query: Dual Query: Practical Private Query Release for High Dimensional Data (MG, EJGA, JH, AR, ZSW), pp. 1170–1178.
ICPR-2014-ChatbriKK #approach #documentation #image #independence #query: An Application-Independent and Segmentation-Free Approach for Spotting Queries in Document Images (HC, PWK, KK), pp. 2891–2896.
ICPR-2014-PuigcerverTV #keyword #query: Word-Graph-Based Handwriting Keyword Spotting of Out-of-Vocabulary Queries (JP, AHT, EV), pp. 2035–2040.
KDD-2014-Cohen #distance #performance #query: Distance queries from sampled data: accurate and efficient (EC), pp. 681–690.
KDD-2014-FengGBEHM #big data #database #experience #in memory #query: 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.
KDD-2014-LiDDCZ #identification #process: Identifying and labeling search tasks via query-based hawkes processes (LL, HD, AD, YC, HZ), pp. 731–740.
KDD-2014-SarawagiC #modelling #query #web: Open-domain quantity queries on web tables: annotation, response, and consensus models (SS, SC), pp. 711–720.
KDIR-2014-Bradford #ad hoc #query: Incorporating Ad Hoc Phrases in LSI Queries (RBB), pp. 61–70.
KDIR-2014-PlansangketG #evaluation #performance #query #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.
KDIR-2014-SourourL #information retrieval #query: Association Rules Between Terms Appreciated by EII for Query Expansion in IR (BRS, CL), pp. 381–387.
KEOD-2014-AkamaN #problem: Solving Query-answering Problems with If-and-Only-If Formulas (KA, EN), pp. 333–344.
KEOD-2014-DogmusPE #natural language #ontology #query: Answering Natural Language Queries about Rehabilitation Robotics Ontology on the Cloud (ZD, VP, EE), pp. 75–83.
KR-2014-BienvenuCOS #logic #query: Nested Regular Path Queries in Description Logics (MB, DC, MO, MS).
KR-2014-BotoevaKRWZ #knowledge base #logic #query: Query Inseparability for Description Logic Knowledge Bases (EB, RK, VR, FW, MZ).
KR-2014-EckePT #concept #query #similarity: Answering Instance Queries Relaxed by Concept Similarity (AE, RP, AYT).
SIGIR-2014-AlonsoS #crowdsourcing #query: Building a query log via crowdsourcing (OA, MS), pp. 939–942.
SIGIR-2014-ArifDL #collaboration #information management #query: Examining collaborative query reformulation: a case of travel information searching (ASMA, JTD, IL), pp. 875–878.
SIGIR-2014-CanCM #feedback #modelling #ranking: Incorporating query-specific feedback into learning-to-rank models (EFC, WBC, RM), pp. 1035–1038.
SIGIR-2014-CarterCP #community #enterprise #modelling #query: Latent community discovery through enterprise user search query modeling (KMC, RSC, BP), pp. 871–874.
SIGIR-2014-DaltonDA #knowledge base #query #using: Entity query feature expansion using knowledge base links (JD, LD, JA), pp. 365–374.
SIGIR-2014-EfronWS #learning #query: Learning sufficient queries for entity filtering (ME, CW, GS), pp. 1091–1094.
SIGIR-2014-GiangrecoKS #database #information retrieval #multi #named #query #scalability: ADAM: a system for jointly providing ir and database queries in large-scale multimedia retrieval (IG, IAK, HS), pp. 1257–1258.
SIGIR-2014-GoeuriotKL #analysis #information retrieval #query: An analysis of query difficulty for information retrieval in the medical domain (LG, LK, JL), pp. 1007–1010.
SIGIR-2014-GuptaBBCR #information retrieval #query: Query expansion for mixed-script information retrieval (PG, KB, REB, MC, PR), pp. 677–686.
SIGIR-2014-JiangA #query: Necessary and frequent terms in queries (JJ, JA), pp. 1167–1170.
SIGIR-2014-JiangKCC #behaviour #learning #query: Learning user reformulation behavior for query auto-completion (JYJ, YYK, PYC, PJC), pp. 445–454.
SIGIR-2014-KatoYOT #query: Investigating users’ query formulations for cognitive search intents (MPK, TY, HO, KT), pp. 577–586.
SIGIR-2014-KatzSKSR #performance #predict #query: Wikipedia-based query performance prediction (GK, AS, OK, BS, LR), pp. 1235–1238.
SIGIR-2014-KimC #documentation #query: Diversifying query suggestions based on query documents (YK, WBC), pp. 891–894.
SIGIR-2014-LiDWDCZ #2d #query: A two-dimensional click model for query auto-completion (YL, AD, HW, HD, YC, CZ), pp. 455–464.
SIGIR-2014-LiWRM #classification #interactive #named #query #retrieval: ReQ-ReC: high recall retrieval with query pooling and interactive classification (CL, YW, PR, QM), pp. 163–172.
SIGIR-2014-MaLWSBWW #named #policy #query #web: PAAP: prefetch-aware admission policies for query results cache in web search engines (HM, WL, BW, LS, XB, LW, BW), pp. 983–986.
SIGIR-2014-MitraSRH #interactive #on the #query: On user interactions with query auto-completion (BM, MS, FR, KH), pp. 1055–1058.
SIGIR-2014-MorenoDC #clustering #query #web: Query log driven web search results clustering (JGM, GD, GC), pp. 777–786.
SIGIR-2014-PerezJ #microblog #performance #predict #query #retrieval: Predicting query performance in microblog retrieval (JARP, JMJ), pp. 1183–1186.
SIGIR-2014-RaiberK #predict: Query-performance prediction: setting the expectations straight (FR, OK), pp. 13–22.
SIGIR-2014-RavivKC #performance #predict #query #retrieval: Query performance prediction for entity retrieval (HR, OK, DC), pp. 1099–1102.
SIGIR-2014-RoyVGC #query #segmentation #sequence #using: Improving unsupervised query segmentation using parts-of-speech sequence information (RSR, YV, NG, MC), pp. 935–938.
SIGIR-2014-ShokouhiJORD #mobile #query: Mobile query reformulations (MS, RJ, UO, KR, FD), pp. 1011–1014.
SIGIR-2014-SokolovHR #learning #query: Learning to translate queries for CLIR (AS, FH, SR), pp. 1179–1182.
SIGIR-2014-StantonIM #query: Circumlocution in diagnostic medical queries (IS, SI, NM), pp. 133–142.
SIGIR-2014-ZhangCT #keyword #query: Processing spatial keyword query as a top-k aggregation query (DZ, CYC, KLT), pp. 355–364.
AMT-2014-GholizadehDM #approach #model transformation #query: A Query Structured Approach for Model Transformation (HG, ZD, TSEM), pp. 54–63.
ECMFA-2014-BarmpisK #modelling #query #scalability #towards: Towards Scalable Querying of Large-Scale Models (KB, DSK), pp. 35–50.
MoDELS-2014-SzarnyasIRHBV #distributed #framework #in the cloud #incremental #named #query: IncQuery-D: A Distributed Incremental Model Query Framework in the Cloud (GS, BI, IR, DH, GB, DV), pp. 653–669.
MoDELS-2014-SzarnyasIRHBV #distributed #framework #in the cloud #incremental #named #query: IncQuery-D: A Distributed Incremental Model Query Framework in the Cloud (GS, BI, IR, DH, GB, DV), pp. 653–669.
PPDP-2014-CheneyAA #database #query: Database Queries that Explain their Work (JC, AA, UAA), pp. 271–282.
RE-2014-PruskiLAOARC #named #natural language #query #towards: TiQi: Towards natural language trace queries (PP, SL, RA, GO, SA, AR, JCH), pp. 123–132.
SAC-2014-AudehBB #information retrieval #query: Exploring query reformulation for named entity expansion in information retrieval (BA, PB, MB), pp. 929–930.
SAC-2014-HalderZC #analysis #database #information management #query: Information leakage analysis of database query languages (RH, MZ, AC), pp. 813–820.
SAC-2014-LinWCC #query: Finding targets with the nearest favor neighbor and farthest disfavor neighbor by a skyline query (YWL, ETW, CFC, ALPC), pp. 821–826.
SAC-2014-MesmoudiH #declarative #framework #query #scalability: A test framework for large scale declarative queries: preliminary results (AM, MSH), pp. 858–859.
SAC-2014-NgoPLS #image #named #query #recommendation: Recommend-Me: recommending query regions for image search (TDN, SP, DDL, SS), pp. 913–918.
FSE-2014-SunZLZWZK #query #re-engineering: Querying sequential software engineering data (CS, HZ, JGL, HZ, QW, DZ, SCK), pp. 700–710.
CGO-2014-WuDSABGY #execution #query #relational: Red Fox: An Execution Environment for Relational Query Processing on GPUs (HW, GFD, TS, MA, SB, MG, SY), p. 44.
HPDC-2014-AlamKW #distributed #query #scalability: A scalable distributed skip list for range queries (SA, HK, AW), pp. 315–318.
LICS-CSL-2014-Chen #first-order #query #set: The tractability frontier of graph-like first-order query sets (HC), p. 9.
LICS-CSL-2014-ChenM #classification #complexity #graph #query: One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.
LICS-CSL-2014-KikotKPZ #on the #ontology #query: On the succinctness of query rewriting over shallow ontologies (SK, RK, VVP, MZ), p. 10.
LICS-CSL-2014-LosemannM #query: MSO queries on trees: enumerating answers under updates (KL, WM), p. 10.
ASE-2013-DietrichCS #effectiveness #learning #query #requirements #retrieval: Learning effective query transformations for enhanced requirements trace retrieval (TD, JCH, YS), pp. 586–591.
ASE-2013-IzsoSBHR #graph #metric #performance #precise #predict #query #towards: Towards precise metrics for predicting graph query performance (BI, ZS, GB, ÁH, IR), pp. 421–431.
ASE-2013-ZhangS #automation #query #sql: Automatically synthesizing SQL queries from input-output examples (SZ, YS), pp. 224–234.
ICDAR-2013-AldavertRTL #string #visual notation #word: Integrating Visual and Textual Cues for Query-by-String Word Spotting (DA, MR, RT, JL), pp. 511–515.
PODS-2013-AbouziedAPHS #learning #quantifier #query #verification: Learning and verifying quantified boolean queries by example (AA, DA, CHP, JMH, AS), pp. 49–60.
PODS-2013-Baeza #database #graph #query: Querying graph databases (PBB), pp. 175–188.
PODS-2013-BaganBG #graph #query: A trichotomy for regular simple path queries on graphs (GB, AB, BG), pp. 261–272.
PODS-2013-BeameKS #communication #parallel #query: Communication steps for parallel query processing (PB, PK, DS), pp. 273–284.
PODS-2013-ChenM #classification #complexity #query: The fine classification of conjunctive queries and parameterized logarithmic space complexity (HC, MM), pp. 309–320.
PODS-2013-KazanaS #bound #first-order #query: Enumeration of first-order queries on classes of structures with bounded expansion (WK, LS), pp. 297–308.
PODS-2013-LibkinRV #adaptation #graph #query #rdf: Trial for RDF: adapting graph query languages for RDF data (LL, JLR, DV), pp. 201–212.
PODS-2013-RudolphK #data access #query: Flag & check: data access with monadically defined queries (SR, MK), pp. 151–162.
PODS-2013-Wijsen #query: Charting the tractability frontier of certain conjunctive query answering (JW), pp. 189–200.
SIGMOD-2013-AkibaIY #distance #network #performance #query #scalability: Fast exact shortest-path distance queries on large networks by pruned landmark labeling (TA, YI, YY), pp. 349–360.
SIGMOD-2013-BykauRV #evolution #query: A query answering system for data with evolution relationships (SB, FR, YV), pp. 989–992.
SIGMOD-2013-ChenCC #performance #query: An efficient query indexing mechanism for filtering geo-textual data (LC, GC, XC), pp. 749–760.
SIGMOD-2013-ChengHWF #graph #named #query #reachability #scalability: TF-Label: a topological-folding labeling scheme for reachability querying in a large graph (JC, SH, HW, AWCF), pp. 193–204.
SIGMOD-2013-CurrimSSZJY #query: DBMS metrology: measuring query time (SC, RTS, YKS, RZ, MWJ, CY), pp. 421–432.
SIGMOD-2013-DeWittHNSAAFG #query: Split query processing in polybase (DJD, AH, RVN, SS, JAS, AA, MF, JG), pp. 1255–1266.
SIGMOD-2013-DoKPPPD #challenge #query: Query processing on smart SSDs: opportunities and challenges (JD, YSK, JMP, CP, KP, DJD), pp. 1221–1230.
SIGMOD-2013-Hartig #execution #linked data #named #open data #query #traversal #web: SQUIN: a traversal based query execution system for the web of linked data (OH), pp. 1081–1084.
SIGMOD-2013-HungBTCZ #named #network #query #scalability #visual notation: QUBLE: blending visual subgraph query formulation with query processing on large networks (HHH, SSB, BQT, BC, SZ), pp. 1097–1100.
SIGMOD-2013-KaufmannMVFKFM #data type #query #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.
SIGMOD-2013-KissingerSHL #query: Query processing on prefix trees live (TK, BS, DH, WL), pp. 1105–1108.
SIGMOD-2013-KonstantinouKTK #cost analysis #in the cloud #named #query #self: COCCUS: self-configured cost-based query services in the cloud (IK, VK, DT, NK), pp. 1041–1044.
SIGMOD-2013-KoutrisUBHS #query #towards: Toward practical query pricing with QueryMarket (PK, PU, MB, BH, DS), pp. 613–624.
SIGMOD-2013-LapeineHHG #data analysis #interactive #mobile #query: Mobile interaction and query optimizationin a protein-ligand data analysis system (ML, KGH, EH, NMG), pp. 1291–1292.
SIGMOD-2013-LimB #execution #optimisation #query: Execution and optimization of continuous queries with cyclops (HL, SB), pp. 1069–1072.
SIGMOD-2013-LongWWF #approach #distance #keyword #query: Collective spatial keyword queries: a distance owner-driven approach (CL, RCWW, KW, AWCF), pp. 689–700.
SIGMOD-2013-MishneDLSL #architecture #big data #performance #query #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.
SIGMOD-2013-PapadopoulosCDG #algebra #authentication #data type #lightweight #linear #query: Lightweight authentication of linear algebraic queries on data streams (SP, GC, AD, MNG), pp. 881–892.
SIGMOD-2013-RullBSKMT #query #sql: Query containment in entity SQL (GR, PAB, IGdS, YK, SM, ET), pp. 1169–1172.
SIGMOD-2013-VlachouDNK #algorithm #bound #query: Branch-and-bound algorithm for reverse top-k queries (AV, CD, KN, YK), pp. 481–492.
SIGMOD-2013-YuHLCZ #database #estimation #named #query: CS2: a new database synopsis for query estimation (FY, WCH, CL, DC, MZ), pp. 469–480.
SIGMOD-2013-ZhangEPS #query #reverse engineering: Reverse engineering complex join queries (MZ, HE, CMP, DS), pp. 809–820.
SIGMOD-2013-ZhuMXLTZ #distance #network #query #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.
VLDB-2013-0002M #named #query: Scorpion: Explaining Away Outliers in Aggregate Queries (EW, SM), pp. 553–564.
VLDB-2013-0007TR #effectiveness #graph #keyword #performance #probability #query: Probabilistic Query Rewriting for Efficient and Effective Keyword Search on Graph Data (LZ, TT, AR), pp. 1642–1653.
VLDB-2013-AltwaijryKM #approach: Query-Driven Approach to Entity Resolution (HA, DVK, SM), pp. 1846–1857.
VLDB-2013-ArmenatzoglouPP #framework #query: A General Framework for Geo-Social Query Processing (NA, SP, DP), pp. 913–924.
VLDB-2013-BajajS #authentication #named #query #sql: CorrectDB: SQL Engine with Practical Query Authentication (SB, RS), pp. 529–540.
VLDB-2013-BotheKV #named #query: eSkyline: Processing Skyline Queries over Encrypted Data (SB, PK, AV), pp. 1338–1341.
VLDB-2013-Bress #gpu #hybrid #performance #query #why: Why it is time for a HyPE: A Hybrid Query Processing Engine for Efficient GPU Coprocessing in DBMS (SB), pp. 1398–1403.
VLDB-2013-BrunoJZ #optimisation #query: Continuous Cloud-Scale Query Optimization and Processing (NB, SJ, JZ), pp. 961–972.
VLDB-2013-CaoB #implementation #performance #quantifier #query #relational: Efficient Implementation of Generalized Quantification in Relational Query Languages (BC, AB), pp. 241–252.
VLDB-2013-ChenCJW #evaluation #keyword #query: Spatial Keyword Query Processing: An Experimental Evaluation (LC, GC, CSJ, DW), pp. 217–228.
VLDB-2013-ChiHHN #query #scheduling: Distribution-Based Query Scheduling (YC, HH, WPH, JFN), pp. 673–684.
VLDB-2013-DengF #complexity #on the #query: On the Complexity of Query Result Diversification (TD, WF), pp. 577–588.
VLDB-2013-FanGN #big data #preprocessor #query: Making Queries Tractable on Big Data with Preprocessing (WF, FG, FN), pp. 685–696.
VLDB-2013-FarnanLCY #named #query: PAQO: A Preference-Aware Query Optimizer for PostgreSQL (NLF, AJL, PKC, TY), pp. 1334–1337.
VLDB-2013-FuWCW #distance #named #query: IS-LABEL: an Independent-Set based Labeling Scheme for Point-to-Point Distance Querying (AWCF, HW, JC, RCWW), pp. 457–468.
VLDB-2013-GarofalakisKS #distributed #geometry #monitoring #query #sketching: Sketch-based Geometric Monitoring of Distributed Stream Queries (MNG, DK, VS), pp. 937–948.
VLDB-2013-GuptaRM #data flow #distributed #query: Ratio Threshold Queries over Distributed Data Sources (RG, KR, MKM), pp. 565–576.
VLDB-2013-HendawiBM #framework #named #network #predict #query #scalability: iRoad: A Framework For Scalable Predictive Query Processing On Road Networks (AMH, JB, MFM), pp. 1262–1265.
VLDB-2013-JiangMN #database #interface #multi #named #query: GestureQuery: A Multitouch Database Query Interface (LJ, MM, AN), pp. 1342–1345.
VLDB-2013-KaplanLMN #query: Answering Planning Queries with the Crowd (HK, IL, TM, SN), pp. 697–708.
VLDB-2013-KaufmannVFKF #interactive #query: Comprehensive and Interactive Temporal Query Processing with SAP HANA (MK, PV, PMF, DK, FF), pp. 1210–1213.
VLDB-2013-KolaitisPT #consistency #database #integer #performance #programming #query: Efficient Querying of Inconsistent Databases with Binary Integer Programming (PGK, EP, WCT), pp. 397–408.
VLDB-2013-LeeL #clustering #graph #query #rdf #scalability #semantics: Scaling Queries over Big RDF Graphs with Semantic Hash Partitioning (KL, LL), pp. 1894–1905.
VLDB-2013-LiC #performance #query: Efficient Indexing for Diverse Query Results (LL, CYC), pp. 745–756.
VLDB-2013-LiuSW #performance #query: A Performance Study of Three Disk-based Structures for Indexing and Querying Frequent Itemsets (GL, AS, LW), pp. 505–516.
VLDB-2013-Madaan #documentation #multi #query #repository: Domain Specific Multi-stage Query Language for Medical Document Repositories (AM), pp. 1410–1415.
VLDB-2013-NajafiSJ #flexibility #query: Flexible Query Processor on FPGAs (MN, MS, HAJ), pp. 1310–1313.
VLDB-2013-OgdenTP #automaton #parallel #query #scalability #transducer #using #xml: Scalable XML Query Processing using Parallel Pushdown Transducers (PO, DBT, PP), pp. 1738–1749.
VLDB-2013-ParkMS #parallel #pipes and filters #query #using: Parallel Computation of Skyline and Reverse Skyline Queries Using MapReduce (YP, JKM, KS), pp. 2002–2013.
VLDB-2013-ParkW #crowdsourcing #optimisation #query: Query Optimization over Crowdsourced Data (HP, JW), pp. 781–792.
VLDB-2013-PsaroudakisAA #concurrent #query: Sharing Data and Work Across Concurrent Analytical Queries (IP, MA, AA), pp. 637–648.
VLDB-2013-SametAFLS #database #interface #named #query: PhotoStand: A Map Query Interface for a Database of News Photos (HS, MDA, BCF, MDL, JS), pp. 1350–1353.
VLDB-2013-SarwatEHM #declarative #distributed #graph #query #reachability: Horton+: A Distributed System for Processing Declarative Reachability Queries over Partitioned Graphs (MS, SE, YH, MFM), pp. 1918–1929.
VLDB-2013-SatheO0A #framework #named #query: EnviroMeter: A Platform for Querying Community-Sensed Data (SS, AO, DC, KA), pp. 1294–1297.
VLDB-2013-SavkovicPTN #approximate #query: Complete Approximations of Incomplete Queries (OS, PM, AT, WN), pp. 1378–1381.
VLDB-2013-ShkapskyZZ #datalog #graph #query: Graph Queries in a Next-Generation Datalog System (AS, KZ, CZ), pp. 1258–1261.
VLDB-2013-SmitsPG #fuzzy #named #query: ReqFlex: Fuzzy Queries for Everyone (GS, OP, TG), pp. 1206–1209.
VLDB-2013-TranBD #big data #design #problem #query: Designing Query Optimizers for Big Data Problems of The Future (NT, SB, JD), pp. 1168–1169.
VLDB-2013-TuKMZ #query: Processing Analytical Queries over Encrypted Data (ST, MFK, SM, NZ), pp. 289–300.
VLDB-2013-Viglas #compilation #query #sql: Just-in-time compilation for SQL query processing (SV), pp. 1190–1191.
VLDB-2013-WuCHN #concurrent #database #execution #predict #query #towards: Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads (WW, YC, HH, JFN), pp. 925–936.
VLDB-2013-WuYSIY #graph #keyword #query: Summarizing Answer Graphs Induced by Keyword Queries (YW, SY, MS, AI, XY), pp. 1774–1785.
VLDB-2013-XiaoQ0ITS #performance #query: Efficient Error-tolerant Query Autocompletion (CX, JQ, WW, YI, KT, KS), pp. 373–384.
VLDB-2013-YanZITY #feedback #integration #keyword #query #search-based: Actively Soliciting Feedback for Query Answers in Keyword Search-Based Data Integration (ZY, NZ, ZGI, PPT, CY), pp. 205–216.
VLDB-2013-YuanL0 #gpu #query: The Yin and Yang of Processing Data Warehousing Queries on GPU Devices (YY, RL, XZ), pp. 817–828.
VLDB-2013-ZhangHHL #architecture #cpu #gpu #named #parallel #performance #query #towards: OmniDB: Towards Portable and Efficient Query Processing on Parallel CPU/GPU Architectures (SZ, JH, BH, ML), pp. 1374–1377.
VLDB-2014-CaoR13 #clustering #performance #query: High Performance Stream Query Processing With Correlation-Aware Partitioning (LC, EAR), pp. 265–276.
VLDB-2014-ChenHX13 #authentication #query: Authenticating Top-k Queries in Location-based Services with Confidentiality (QC, HH, JX), pp. 49–60.
VLDB-2014-GyssensPGWW13 #approach #case study #query #symmetry #towards: An Approach towards the Study of Symmetric Queries (MG, JP, DVG, JW, YW), pp. 25–36.
VLDB-2014-NandiJM13 #gesture #query #specification: Gestural Query Specification (AN, LJ, MM), pp. 289–300.
VLDB-2014-NiedermayerZERM0K13 #nearest neighbour #nondeterminism #probability #query: Probabilistic Nearest Neighbor Queries on Uncertain Moving Object Trajectories (JN, AZ, TE, MR, NM, LC, HPK), pp. 205–216.
VLDB-2014-OnizukaKHNH13 #optimisation #pipes and filters #query: Optimization for iterative queries on MapReduce (MO, HK, SH, KN, ZH), pp. 241–252.
VLDB-2014-WangC13 #framework #multi #optimisation #pipes and filters: Multi-Query Optimization in MapReduce Framework (GW, CYC), pp. 145–156.
CSMR-2013-NerellaMW #approach #optimisation #query #using: An Approach for Optimization of Object Queries on Collections Using Annotations (VKSN, SKM, TW), pp. 273–282.
CSMR-2013-StevensRNJ #detection #multi #query #refactoring: A History Querying Tool and Its Application to Detect Multi-version Refactorings (RS, CDR, CN, VJ), pp. 335–338.
ICSM-2013-Roldan-VegaMHF #code search #named #query #refinement: CONQUER: A Tool for NL-Based Query Refinement and Contextualizing Code Search Results (MRV, GM, EH, JAF), pp. 512–515.
MSR-2013-SismanK #automation #code search #debugging #locality #query: Assisting code search with automatic query reformulation for bug localization (BS, ACK), pp. 309–318.
PLDI-2013-CheungSM #optimisation #query #synthesis: Optimizing database-backed applications with query synthesis (AC, ASL, SM), pp. 3–14.
STOC-2013-Ullman #difference #privacy #query: Answering n{2+o(1)} counting queries with differential privacy is hard (JU), pp. 361–370.
CIAA-2013-DebarbieuxGNSZ #automaton #query #word #xml #xpath: Early Nested Word Automata for XPath Query Answering on XML Streams (DD, OG, JN, TS, MZ), pp. 292–305.
DLT-2013-LibkinTV #database #graph #query #regular expression #word: Regular Expressions with Binding over Data Words for Querying Graph Databases (LL, TT, DV), pp. 325–337.
ICALP-v2-2013-ChenM #quantifier #query: Block-Sorted Quantified Conjunctive Queries (HC, DM), pp. 125–136.
ICALP-v2-2013-GottlobPT #query #transitive: Querying the Guarded Fragment with Transitivity (GG, AP, LT), pp. 287–298.
CEFP-2013-CunhaFMPS #design #implementation #modelling #query #spreadsheet: Design and Implementation of Queries for Model-Driven Spreadsheets (JC, JPF, JM, RP, JS), pp. 459–478.
ICFP-2013-CheneyLW #query: A practical theory of language-integrated query (JC, SL, PW), pp. 403–416.
ICFP-2013-HidakaAHKN #graph #order #query #recursion: Structural recursion for querying ordered graphs (SH, KA, ZH, HK, KN), pp. 305–318.
CHI-2013-AgapieGQ #people #query: Leading people to longer queries (EA, GG, PQ), pp. 3019–3022.
CHI-2013-MonroeLOSPM #approach #challenge #query #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.
DUXU-WM-2013-Kim13a #analysis #query: Analysis of Query Entries of a Job Search Engine (YK), pp. 203–211.
HCI-IMT-2013-WuOMS #design #information management #query #visual notation: Design of a Visual Query Language for Geographic Information System on a Touch Screen (SW, SO, GM, MS), pp. 530–539.
HIMI-D-2013-NitscheN13a #named #query: QUEST: Querying Complex Information by Direct Manipulation (MN, AN), pp. 240–249.
ICEIS-J-2013-RudraGA13a #approximate #query: Estimating Sufficient Sample Sizes for Approximate Decision Support Queries (AR, RPG, NRA), pp. 85–99.
ICEIS-v1-2013-IsmailHQDE #clustering #evaluation #query #simulation #using: Clustering using Hypergraph for P2P Query Routing — Simulation and Evaluation (AI, MH, MQ, ND, MES), pp. 247–254.
ICEIS-v1-2013-MagalhaesMVMMPC #distributed #linked data #named #open data #query: QEF-LD — A Query Engine for Distributed Query Processing on Linked Data (RPM, JMM, VMPV, JAFdM, MM, FP, MAC), pp. 185–192.
ICEIS-v1-2013-RudraGA #approximate #query: Selecting Adequate Samples for Approximate Decision Support Queries (AR, RPG, NRA), pp. 46–55.
CIKM-2013-AyadiTDJH #correlation #image #modelling #query #retrieval #using: Correlating medical-dependent query features with image retrieval models using association rules (HA, MT, MD, MBJ, JXH), pp. 299–308.
CIKM-2013-ChenCC #network #query: Spatial-temporal query homogeneity for KNN object search on road networks (YJC, KTC, MSC), pp. 1019–1028.
CIKM-2013-FiondaP #graph #query: Querying graphs with preferences (VF, GP), pp. 929–938.
CIKM-2013-GhoreishiS #predict #query: Predicting event-relatedness of popular queries (SNG, AS), pp. 1193–1196.
CIKM-2013-Lian0 #database #nondeterminism #probability #query: Causality and responsibility: probabilistic queries revisited in uncertain databases (XL, LC), pp. 349–358.
CIKM-2013-MullangiR #named #performance #query #reachability #scalability: SCISSOR: scalable and efficient reachability query processing in time-evolving hierarchies (PRM, LR), pp. 799–804.
CIKM-2013-PalBP #named #query: RCached-tree: an index structure for efficiently answering popular queries (MP, AB, DP), pp. 1173–1176.
CIKM-2013-ParikhSH #on the #query #segmentation: On segmentation of eCommerce queries (NP, PS, MAH), pp. 1137–1146.
CIKM-2013-QianSYZL #mining #query: Dynamic query intent mining from a search log stream (YnQ, TS, JY, QZ, CL), pp. 1205–1208.
CIKM-2013-StrotgenG #proximity #query #ranking: Proximity2-aware ranking for textual, temporal, and geographic queries (JS, MG), pp. 739–744.
CIKM-2013-SymondsZKBS #perspective #query: Term associations in query expansion: a structural linguistic perspective (MS, GZ, BK, PB, LS), pp. 1189–1192.
CIKM-2013-TeymorianFM #distributed #energy #query: Rank-energy selective query forwarding for distributed search systems (AYT, OF, MAM), pp. 389–398.
CIKM-2013-ThostVS #query #recommendation: Query matching for report recommendation (VT, KV, DS), pp. 1391–1400.
CIKM-2013-TianCZ #approach #database #hybrid #mobile #privacy #query: A hybrid approach for privacy-preserving processing of knn queries in mobile database systems (ST, YC, QZ), pp. 1161–1164.
CIKM-2013-Zhang0D #corpus #mining #query: Mining a search engine’s corpus without a query pool (MZ, NZ, GD), pp. 29–38.
ECIR-2013-0001S #game studies #query #refinement: Comparing Crowd-Based, Game-Based, and Machine-Based Approaches in Initial Query and Query Refinement Tasks (CGH, PS), pp. 495–506.
ECIR-2013-CarpinetoR #concept #graph #query #semantics: Semantic Search Log k-Anonymization with Generalized k-Cores of Query Concept Graph (CC, GR), pp. 110–121.
ECIR-2013-FreireMTOC #hybrid #query #scheduling: Hybrid Query Scheduling for a Replicated Search Engine (AF, CM, NT, IO, FC), pp. 435–446.
ECIR-2013-KumarC #feedback #query #twitter: Time Based Feedback and Query Expansion for Twitter Search (NK, BAC), pp. 734–737.
ECIR-2013-LimsopathamMO13a #documentation #query #representation: A Task-Specific Query and Document Representation for Medical Records Search (NL, CM, IO), pp. 747–751.
ECIR-2013-PCK #problem #query #repository: Query Suggestions for Textual Problem Solution Repositories (DP, SC, DK), pp. 569–581.
ECIR-2013-Ramirez #named #query #retrieval: WANTED: Focused Queries for Focused Retrieval (GR), pp. 788–791.
ECIR-2013-ZhuGCLN #graph #query #recommendation: Recommending High Utility Query via Session-Flow Graph (XZ, JG, XC, YL, WN), pp. 642–655.
KDD-2013-ChenLYSY #clustering #optimisation #query: Query clustering based on bid landscape for sponsored search auction optimization (YC, WL, JY, AS, TWY), pp. 1150–1158.
KDD-2013-WangY #learning #query: Querying discriminative and representative samples for batch mode active learning (ZW, JY), pp. 158–166.
KDD-2013-ZhuXWL #distance #graph #performance #query #scalability: Efficient single-source shortest path and distance queries on large graphs (ADZ, XX, SW, WL), pp. 998–1006.
KDIR-KMIS-2013-MeiselBI #mining #query: Mining the Long Tail of Search Queries — Finding Profitable Patterns (MM, MB, AI), pp. 225–229.
KEOD-2013-AkamaN #problem #proving: Embedding Proof Problems into Query-answering Problems and Problem Solving by Equivalent Transformation (KA, EN), pp. 253–260.
RecSys-2013-HaririMB #recommendation: Query-driven context aware recommendation (NH, BM, RDB), pp. 9–16.
RecSys-2013-VahabiALBL #orthogonal #query #recommendation: Orthogonal query recommendation (HV, MA, DL, RABY, ALO), pp. 33–40.
SIGIR-2013-AzzopardiKB #behaviour #how #query: How query cost affects search behavior (LA, DK, KB), pp. 23–32.
SIGIR-2013-DemidovaZN #performance #query #scalability: Efficient query construction for large scale data (ED, XZ, WN), pp. 573–582.
SIGIR-2013-DimopoulosNS #performance #query: A candidate filtering mechanism for fast top-k query processing on modern cpus (CD, SN, TS), pp. 723–732.
SIGIR-2013-Efron #information retrieval #query #representation: Query representation for cross-temporal information retrieval (ME), pp. 383–392.
SIGIR-2013-FeildA #query #recommendation: Task-aware query recommendation (HAF, JA), pp. 83–92.
SIGIR-2013-FreitasFOC #approach #graph #linked data #natural language #open data #query #semantics: Answering natural language queries over linked data graphs: a distributional semantics approach (AF, FFdF, SO, EC), pp. 1107–1108.
SIGIR-2013-GaoCLC #comprehension #query #towards: Mapping queries to questions: towards understanding users’ information needs (YG, LC, RL, GC), pp. 977–980.
SIGIR-2013-GaoXX #query #random #using: Query expansion using path-constrained random walks (JG, GX, JX), pp. 563–572.
SIGIR-2013-GuanZY #query: Utilizing query change for session search (DG, SZ, HY), pp. 453–462.
SIGIR-2013-Hasibi #query: Indexing and querying overlapping structures (FH), p. 1144.
SIGIR-2013-HassanWW #query #self #towards #using: Toward self-correcting search engines: using underperforming queries to improve search (AHA, RWW, YMW), pp. 263–272.
SIGIR-2013-HeBV #multi #query: Characterizing stages of a multi-session complex search task through direct and indirect query modifications (JH, MB, APdV), pp. 897–900.
SIGIR-2013-HuangGCHC #query: Commodity query by snapping (HH, YG, KC, QH, LC), pp. 985–988.
SIGIR-2013-JiangJH #fault #how #query: How do users respond to voice input errors?: lexical and phonetic query reformulation in voice search (JJ, WJ, DH), pp. 143–152.
SIGIR-2013-KharitonovMSO #evaluation #metric #modelling #query: User model-based metrics for offline query suggestion evaluation (EK, CM, PS, IO), pp. 633–642.
SIGIR-2013-KongA #query: Extracting query facets from search results (WK, JA), pp. 93–102.
SIGIR-2013-Leveling #coordination #generative #query: Interpretation of coordinations, compound generation, and result fusion for query variants (JL), pp. 805–808.
SIGIR-2013-Limsopatham #comprehension #framework #query: A query and patient understanding framework for medical records search (NL), p. 1145.
SIGIR-2013-MahdabiGHC #ambiguity #concept #proximity #query #retrieval #using: Leveraging conceptual lexicon: query disambiguation using proximity information for patent retrieval (PM, SG, JXH, FC), pp. 113–122.
SIGIR-2013-MaxwellC #query #topic #using: Compact query term selection using topically related text (KTM, WBC), pp. 583–592.
SIGIR-2013-MiyanishiS #query: Time-aware structured query suggestion (TM, TS), pp. 809–812.
SIGIR-2013-QvarfordtGDA #query: Looking ahead: query preview in exploratory search (PQ, GG, TD, EA), pp. 243–252.
SIGIR-2013-RossiMCS #performance #query #using: Fast document-at-a-time query processing using two-tier indexes (CR, ESdM, ALC, ASdS), pp. 183–192.
SIGIR-2013-Shokouhi #learning #personalisation #query: Learning to personalize query auto-completion (MS), pp. 103–112.
SIGIR-2013-SondakSK #predict #query: Estimating query representativeness for query-performance prediction (MS, AS, OK), pp. 853–856.
SIGIR-2013-WestWH #predict #process #query: Here and there: goals, activities, and predictions about location from geotagged queries (RW, RWW, EH), pp. 817–820.
SIGIR-2013-YangWH #query: Pursuing insights about healthcare utilization via geocoded search queries (SHY, RWW, EH), pp. 993–996.
SIGIR-2013-ZhangGY #feedback #query: Query change as relevance feedback in session search (SZ, DG, HY), pp. 821–824.
ECMFA-2013-Storrle #ad hoc #declarative #named #query: MOCQL: A Declarative Language for Ad-Hoc Model Querying (HS), pp. 3–19.
ICMT-2013-Horn #query: Model Querying with FunnyQT — (Extended Abstract) (TH), pp. 56–57.
MoDELS-2013-SemerathHV #constraints #domain-specific language #graph #query #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.
MoDELS-2013-SemerathHV #constraints #domain-specific language #graph #query #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.
ECOOP-2013-LernerELK #source code #static typing: Combining Form and Function: Static Types for JQuery Programs (BSL, LE, JL, SK), pp. 79–103.
SAC-2013-BellatrecheBCM #algorithm #clustering #incremental #query: Horizontal partitioning of very-large data warehouses under dynamically-changing query workloads via incremental algorithms (LB, RB, AC, SM), pp. 208–210.
SAC-2013-BlancoR #query #recommendation: Inferring user utility for query revision recommendation (HB, FR), pp. 245–252.
SAC-2013-CamposFHV #personalisation #query #ranking #using #xml: XML search personalization strategies using query expansion, reranking and a search engine modification (LMdC, JMFL, JFH, EVL), pp. 872–877.
SAC-2013-CeccarelliGLNP #query #recommendation #semantics: When entities meet query recommender systems: semantic search shortcuts (DC, SG, CL, FMN, RP), pp. 933–938.
SAC-2013-HalderC #database #query #slicing: Abstract program slicing of database query languages (RH, AC), pp. 838–845.
SAC-2013-MaiaB #modelling #network #performance #predict #query: 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.
SAC-2013-OyamadaKK #concurrent #query: Continuous query processing with concurrency control: reading updatable resources consistently (MO, HK, HK), pp. 788–794.
SAC-2013-TheodouliG #adaptation #data-driven #query #web #web service: Adaptive memory-aware chunk sizing techniques for data-intensive queries over web services (AT, AG), pp. 826–831.
SAC-2013-UmemotoYNT #behaviour #predict #query: Predicting query reformulation type from user behavior (KU, TY, SN, KT), pp. 894–901.
ICSE-2013-HaiducBMOLM #automation #query #re-engineering #retrieval: Automatic query reformulations for text retrieval in software engineering (SH, GB, AM, RO, ADL, TM), pp. 842–851.
ICSE-2013-HaiducRBOLM #code search #predict #quality #query #source code: Query quality prediction and reformulation for source code search: the refoqus tool (SH, GDR, GB, RO, ADL, AM), pp. 1307–1310.
ICSE-2013-SmitSSL #development #in the cloud #query: Supporting application development with structured queries in the cloud (MS, BS, MS, ML), pp. 1213–1216.
CGO-2013-SuiLX #adaptation #compilation #optimisation: Query-directed adaptive heap cloning for optimizing compilers (YS, YL, JX), p. 11.
HPDC-2013-LakshminarasimhanBPZJVPS #encoding #query #scalability: Scalable in situ scientific data encoding for analytical query processing (SL, DABI, SVP, XZ, JJ, VV, MEP, NFS), pp. 1–12.
CAV-2013-UhlerD #automation #named #query #smt #symbolic computation: Smten: Automatic Translation of High-Level Symbolic Computations into SMT Queries (RU, ND), pp. 678–683.
LICS-2013-FereeHG #complexity #on the #query: On the Query Complexity of Real Functionals (HF, MH, WG), pp. 103–112.
LICS-2013-Fontaine #consistency #query #question #why: Why is it Hard to Obtain a Dichotomy for Consistent Query Answering? (GF), pp. 550–559.
ASE-2012-HaiducBOLM #assessment #automation #performance #query #retrieval: Automatic query performance assessment during the retrieval of software artifacts (SH, GB, RO, ADL, AM), pp. 90–99.
DocEng-2012-JunediGL #analysis #independence #revisited #xml: XML query-update independence analysis revisited (MJ, PG, NL), pp. 95–98.
DocEng-2012-MahlowGHS #framework #retrieval #using #xquery: A framework for retrieval and annotation in digital humanities using XQuery full text and update in BaseX (CM, CG, AH, MHS), pp. 195–204.
HT-2012-HartigF #execution #linked data #open data #query #traversal: Foundations of traversal based query execution over linked data (OH, JCF), pp. 43–52.
HT-2012-HartigH #linked data #modelling #open data #predict #query: Query prediction with context models for populating personal linked data caches (OH, TH), pp. 325–326.
PODS-2012-BarceloLR #approximate #performance #query: Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.
PODS-2012-FaginK #equivalence: Local transformations and conjunctive-query equivalence (RF, PGK), pp. 179–190.
PODS-2012-KostylevRS #classification #query: Classification of annotation semirings over query containment (EVK, JLR, AZS), pp. 237–248.
PODS-2012-KoutrisUBHS: Query-based data pricing (PK, PU, MB, BH, DS), pp. 167–178.
PODS-2012-LetelierPPS #optimisation #query #semantics #static analysis #web: Static analysis and optimization of semantic web queries (AL, JP, RP, SS), pp. 89–100.
SIGMOD-2012-0002S #optimisation #query: Holistic optimization by prefetching query results (KR, SS), pp. 133–144.
SIGMOD-2012-AlagiannisBBIA #execution #named #performance #query: NoDB: efficient query execution on raw data files (IA, RB, MB, SI, AA), pp. 241–252.
SIGMOD-2012-ChengKCC #approach #distance #graph #performance #query #scalability: Efficient processing of distance queries in large graphs: a vertex cover approach (JC, YK, SC, CC), pp. 457–468.
SIGMOD-2012-FanLWW #graph #query: Query preserving graph compression (WF, JL, XW, YW), pp. 157–168.
SIGMOD-2012-GhazalSCA #adaptation #optimisation #query #recursion: Adaptive optimizations of recursive queries in teradata (AG, DYS, AC, MAK), pp. 851–860.
SIGMOD-2012-JinRXL #approach #distance #graph #query #scalability: A highway-centric labeling approach for answering distance queries on large sparse graphs (RJ, NR, YX, VEL), pp. 445–456.
SIGMOD-2012-KatsifodimosMV #xquery: Materialized view selection for XQuery workloads (AK, IM, VV), pp. 565–576.
SIGMOD-2012-KokkalisVZSKI #named #query: Logos: a system for translating queries into narratives (AK, PV, AZ, AS, GK, YEI), pp. 673–676.
SIGMOD-2012-MeliouS #database #named #query: Tiresias: the database oracle for how-to queries (AM, DS), pp. 337–348.
SIGMOD-2012-MeliouSS #named #query: Tiresias: a demonstration of how-to queries (AM, YS, DS), pp. 709–712.
SIGMOD-2012-OrdonezGC #optimisation #query #sql: Dynamic optimization of generalized SQL queries with horizontal aggregations (CO, JGG, ZC), pp. 637–640.
SIGMOD-2012-ShankarNACEHRSDG #optimisation #query #sql: Query optimization in microsoft SQL server PDW (SS, RVN, JAS, AC, ME, AH, ER, MSS, DJD, CAGL), pp. 767–776.
SIGMOD-2012-SidlauskasSJ #in memory #parallel #query: Parallel main-memory indexing for moving-object query and update workloads (DS, SS, CSJ), pp. 37–48.
SIGMOD-2012-SinghNJ #agile #named #query #relational: Skimmer: rapid scrolling of relational query results (MS, AN, HVJ), pp. 181–192.
SIGMOD-2012-YuAY #query #scalability: Processing a large number of continuous preference top-k queries (AY, PKA, JY), pp. 397–408.
VLDB-2012-AbouziedHS #query #specification: Playful Query Specification with DataPlay (AA, JMH, AS), pp. 1938–1941.
VLDB-2012-AgarwalPMIMS #interactive #query #scalability: Blink and It’s Done: Interactive Queries on Very Large Data (SA, AP, BM, API, SM, IS), pp. 1902–1905.
VLDB-2012-AlagiannisBBIA #adaptation #query: NoDB in Action: Adaptive Query Processing on Raw Data (IA, RB, MB, SI, AA), pp. 1942–1945.
VLDB-2012-AlyAO #query: Spatial Queries with Two kNN Predicates (AMA, WGA, MO), pp. 1100–1111.
VLDB-2012-BakibayevOZ #database #named #query #relational: FDB: A Query Engine for Factorised Relational Databases (NB, DO, JZ), pp. 1232–1243.
VLDB-2012-BakibayevOZ12a #database #query: Demonstration of the FDB Query Engine for Factorised Databases (NB, DO, JZ), pp. 1950–1953.
VLDB-2012-BaranyCO #query: Queries with Guarded Negation (VB, BtC, MO), pp. 1328–1339.
VLDB-2012-BenediktBL #query #strict: Querying Schemas With Access Restrictions (MB, PB, CL), pp. 634–645.
VLDB-2012-Bidoit-TolluCU #detection #independence #type system #xml: Type-Based Detection of XML Query-Update Independence (NBT, DC, FU), pp. 872–883.
VLDB-2012-CautisK #complexity #probability #query #using #xml: Answering Queries using Views over Probabilistic XML: Complexity and Tractability (BC, EK), pp. 1148–1159.
VLDB-2012-ChubakR #performance #query: Efficient Indexing and Querying over Syntactically Annotated Trees (PC, DR), pp. 1316–1327.
VLDB-2012-FanWW #distributed #performance #query #reachability: Performance Guarantees for Distributed Reachability Queries (WF, XW, YW), pp. 1304–1315.
VLDB-2012-GawadeK #analysis #execution #framework #interactive #named #query #visual notation: Stethoscope: A platform for interactive visual analysis of query execution plans (MG, MLK), pp. 1926–1929.
VLDB-2012-GiannikisAK #named #query: SharedDB: Killing One Thousand Queries With One Stone (GG, GA, DK), pp. 526–537.
VLDB-2012-KotsifakosPHGAK #named #sequence: Hum-a-song: A Subsequence Matching with Gaps-Range-Tolerances Query-By-Humming System (AK, PP, JH, DG, VA, GK), pp. 1930–1933.
VLDB-2012-KoutrisUBHS #online: QueryMarket Demonstration: Pricing for Online Data Markets (PK, PU, MB, BH, DS), pp. 1962–1965.
VLDB-2012-LiKNC #estimation #query #robust #sql #statistics #using: Robust Estimation of Resource Consumption for SQL Queries using Statistical Techniques (JL, ACK, VRN, SC), pp. 1555–1566.
VLDB-2012-LiM #adaptation #difference #privacy #query: An Adaptive Mechanism for Accurate Query Answering under Differential Privacy (CL, GM), pp. 514–525.
VLDB-2012-PapapetrouGD #data type #distributed #query #sketching: Sketch-based Querying of Distributed Sliding-Window Data Streams (OP, MNG, AD), pp. 992–1003.
VLDB-2012-PimplikarS #keyword #query #using #web: Answering Table Queries on the Web using Column Keywords (RP, SS), pp. 908–919.
VLDB-2012-SelkeLB #bound #database: Pushing the Boundaries of Crowd-enabled Databases with Query-driven Schema Expansion (JS, CL, WTB), pp. 538–549.
VLDB-2012-Shirani-MehrKS #dataset #evaluation #performance #query #reachability #scalability: Efficient Reachability Query Evaluation in Large Spatiotemporal Contact Datasets (HSM, FBK, CS), pp. 848–859.
VLDB-2012-TaliusDDK #fault #query #transaction: Transaction Log Based Application Error Recovery and Point In-Time Query (TT, RD, AD, HK), pp. 1781–1789.
VLDB-2012-TauheedHSMA #named #query: SCOUT: Prefetching for Latent Feature Following Queries (FT, TH, FS, HM, AA), pp. 1531–1542.
VLDB-2012-WenzelEMK #query: Complex Preference Queries Supporting Spatial Applications for User Groups (FW, ME, SM, WK), pp. 1946–1949.
VLDB-2012-WuMS #query: A Demonstration of DBWipes: Clean as You Query (EW, SM, MS), pp. 1894–1897.
VLDB-2012-WuXDCZZ #distance #evaluation #network #query: Shortest Path and Distance Queries on Road Networks: An Experimental Evaluation (LW, XX, DD, GC, ADZ, SZ), pp. 406–417.
VLDB-2012-XuG #query: Manage and Query Generic Moving Objects in SECONDO (JX, RHG), pp. 2002–2005.
VLDB-2012-XuTW #database #energy #named #optimisation #query: PET: Reducing Database Energy Cost via Query Optimization (ZX, YCT, XW), pp. 1954–1957.
VLDB-2012-YuanZWXYH #difference #optimisation #privacy #query #rank: Low-Rank Mechanism: Optimizing Batch Queries under Differential Privacy (GY, ZZ, MW, XX, YY, ZH), pp. 1352–1363.
VLDB-2012-ZengJZ #logic #query: Adding Logical Operators to Tree Pattern Queries on Graph-Structured Data (QZ, XJ, HZ), pp. 728–739.
VLDB-2013-CalvaneseGLV12 #database #graph #query #relational: Query Processing under GLAV Mappings for Relational and Graph Databases (DC, GDG, ML, MYV), pp. 61–72.
VLDB-2013-MouratidisP12 #query: Computing Immutable Regions for Subspace Top-k Queries (KM, HP), pp. 73–84.
FASE-2012-DiskinMC #category theory #query: Intermodeling, Queries, and Kleisli Categories (ZD, TSEM, KC), pp. 163–177.
FoSSaCS-2012-CaliGOP #diagrams #query #uml: Querying UML Class Diagrams (AC, GG, GO, AP), pp. 1–25.
ICPC-2012-NogueraRKJ #query #uml: Code querying by UML (CN, CDR, AK, VJ), pp. 229–238.
STOC-2012-BhaskaraDKT #linear #query: Unconditional differentially private mechanisms for linear queries (AB, DD, RK, KT), pp. 1269–1284.
STOC-2012-DobzinskiV #complexity #query: From query complexity to computational complexity (SD, JV), pp. 1107–1116.
FLOPS-2012-RoseVS #data flow #hybrid #programming language #query: A Data Flow Language for Hybrid Query and Programming Languages (KHR, LV, NS), pp. 228–242.
ICALP-v1-2012-FarzanMR #orthogonal #query: Succinct Indices for Range Queries with Applications to Orthogonal Range Maxima (AF, JIM, RR), pp. 327–338.
ICALP-v1-2012-JefferyKM #complexity #graph #matrix #multi #quantum #query #using: Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision (SJ, RK, FM), pp. 522–532.
ICALP-v2-2012-KikotKPZ #bound #exponential #query: Exponential Lower Bounds and Separation for Query Rewriting (SK, RK, VVP, MZ), pp. 263–274.
CHI-2012-BernsteinTDLH #query: Direct answers for search queries in the long tail (MSB, JT, STD, DJL, EH), pp. 237–246.
ICEIS-v1-2012-Ali #data flow #integration #optimisation #query #web: Optimizing Data Integration Queries over Web Data Sources (OPTIQ) (MIA), pp. 163–168.
ICEIS-v1-2012-HudecS #fuzzy #query #set: Construction of Fuzzy Sets and Applying Aggregation Operators for Fuzzy Queries (MH, FS), pp. 253–258.
ICEIS-v1-2012-KosorusBK #query #semantics #similarity #taxonomy #using: Semantic Similarity between Queries in QA System using a Domain-specific Taxonomy (HK, AB, JK), pp. 241–246.
ICEIS-v1-2012-RudraGA #approximate #performance #query: An Efficient Sampling Scheme for Approximate Processing of Decision Support Queries (AR, RPG, NA), pp. 16–26.
CIKM-2012-AchakeevSW #adaptation: Sort-based query-adaptive loading of R-trees (DA, BS, PW), pp. 2080–2084.
CIKM-2012-AltingovdeBCOSU #query #web: Characterizing web search queries that match very few or no results (ISA, RB, BBC, RO, ES, ÖU), pp. 2000–2004.
CIKM-2012-ArvanitisDV #performance #query #research: Efficient influence-based processing of market research queries (AA, AD, YV), pp. 1193–1202.
CIKM-2012-BalogN12a #identification #query: Hierarchical target type identification for entity-oriented queries (KB, RN), pp. 2391–2394.
CIKM-2012-BaoKWZS #performance #query #relational: Efficient provenance storage for relational queries (ZB, HK, LW, XZ, SWS), pp. 1352–1361.
CIKM-2012-BarbosaPG #algorithm #query: Generically extending anonymization algorithms to deal with successive queries (MB, AP, BG), pp. 1362–1371.
CIKM-2012-BhatiaHHS #approach #query #scalability: A scalable approach for performing proximal search for verbose patent search queries (SB, BH, QH, WSS), pp. 2603–2606.
CIKM-2012-CandanRSW #named #scalability #set #visualisation: STFMap: query- and feature-driven visualization of large time series data sets (KSC, RR, MLS, XW), pp. 2743–2745.
CIKM-2012-ChengTH #database #effectiveness #keyword #predict #query: Predicting the effectiveness of keyword queries on databases (SC, AT, VH), pp. 1213–1222.
CIKM-2012-ChoiLKLM #named #parallel #query #xml: HadoopXML: a suite for parallel processing of massive XML data with multiple twig pattern queries (HC, KHL, SHK, YJL, BM), pp. 2737–2739.
CIKM-2012-DangKT #query #web: Domain dependent query reformulation for web search (VD, GK, ADT), pp. 1045–1054.
CIKM-2012-DuanKZ #empirical #query #representation: Click patterns: an empirical representation of complex query intents (HD, EK, CZ), pp. 1035–1044.
CIKM-2012-EmrichKNRSZ #graph #monte carlo #nondeterminism #probability #query: Exploration of monte-carlo based probabilistic query processing in uncertain graphs (TE, HPK, JN, MR, AS, AZ), pp. 2728–2730.
CIKM-2012-GollapudiIK #query: Structured query reformulations in commerce search (SG, SI, AK), pp. 1890–1894.
CIKM-2012-GrantGLWC #named #statistics: MADden: query-driven statistical text analytics (CEG, JdG, KL, DZW, GC), pp. 2740–2742.
CIKM-2012-HagenPBS #query #segmentation #towards: Towards optimum query segmentation: in doubt without (MH, MP, AB, BS), pp. 1015–1024.
CIKM-2012-HanFJ #query: Schema-free structured querying of DBpedia data (LH, TF, AJ), pp. 2090–2093.
CIKM-2012-HasanMTK #query: Diversifying query results on semi-structured data (MH, AM, VJT, EJK), pp. 2099–2103.
CIKM-2012-HuangLTF #keyword #performance #query: Efficient safe-region construction for moving top-K spatial keyword queries (WH, GL, KLT, JF), pp. 932–941.
CIKM-2012-JiangHHYN #evaluation #query #simulation: Contextual evaluation of query reformulations in a search session by user simulation (JJ, DH, SH, ZY, CN), pp. 2635–2638.
CIKM-2012-JinCKLZ #protocol #query: A filter-based protocol for continuous queries over imprecise location data (YJ, RC, BK, KyL, YZ), pp. 365–374.
CIKM-2012-KanhabuaN #learning #query #rank: Learning to rank search results for time-sensitive queries (NK, KN), pp. 2463–2466.
CIKM-2012-KanhabuaN12a #predict #query #retrieval: Estimating query difficulty for news prediction retrieval (NK, KN), pp. 2623–2626.
CIKM-2012-KimYK #equation #query #retrieval #using #word: Mathematical equation retrieval using plain words as a query (SK, SY, YK), pp. 2407–2410.
CIKM-2012-KurlandRS #clustering #predict #ranking: Query-performance prediction and cluster ranking: two sides of the same coin (OK, FR, AS), pp. 2459–2462.
CIKM-2012-KurlandSHRCR #framework #predict #probability: Back to the roots: a probabilistic framework for query-performance prediction (OK, AS, SH, FR, DC, OR), pp. 823–832.
CIKM-2012-KustarevUMS #performance #predict #query: Session-based query performance prediction (AK, YU, AM, PS), pp. 2563–2566.
CIKM-2012-Lehrack #database #probability #query: Applying weighted queries on probabilistic databases (SL), pp. 2209–2213.
CIKM-2012-LiKBCL #approach #named #probability #query #recommendation: DQR: a probabilistic approach to diversified query recommendation (RL, BK, BB, RC, EL), pp. 16–25.
CIKM-2012-LinXCB #algorithm #performance #query: Efficient algorithms for generalized subgraph query processing (WL, XX, JC, SSB), pp. 325–334.
CIKM-2012-LiuFCW #enterprise #query: Entity centric query expansion for enterprise search (XL, HF, FC, MW), pp. 1955–1959.
CIKM-2012-LiWXCS #network #query #social: Spatial-aware interest group queries in location-based social networks (YL, DW, JX, BC, WS), pp. 2643–2646.
CIKM-2012-LowZ #matrix #performance #query #similarity: Fast top-k similarity queries via matrix compression (YL, AXZ), pp. 2070–2074.
CIKM-2012-LvZ #generative #query: Query likelihood with negative query generation (YL, CZ), pp. 1799–1803.
CIKM-2012-MacdonaldSO #learning #on the #query #rank: On the usefulness of query features for learning to rank (CM, RLTS, IO), pp. 2559–2562.
CIKM-2012-MarkovitsSKC #performance #predict #query #retrieval: Predicting query performance for fusion-based retrieval (GM, AS, OK, DC), pp. 813–822.
CIKM-2012-NuttR #database #query #sql: Completeness of queries over SQL databases (WN, SR), pp. 902–911.
CIKM-2012-OliveiraGBBAZG #automation #query #recommendation: Automatic query expansion based on tag recommendation (VCdO, GdCMG, FB, WCB, JMA, NZ, MAG), pp. 1985–1989.
CIKM-2012-OrangS #approach #correlation #nondeterminism #probability #query: A probabilistic approach to correlation queries in uncertain time series data (MO, NS), pp. 2229–2233.
CIKM-2012-PanZ #correlation #data type #graph #named #query: CGStream: continuous correlated graph query for data streams (SP, XZ), pp. 1183–1192.
CIKM-2012-PanZ12a #graph #query: Continuous top-k query for graph streams (SP, XZ), pp. 2659–2662.
CIKM-2012-PoundHIW #keyword #knowledge base #query #web: Interpreting keyword queries over web knowledge bases (JP, AKH, IFI, GEW), pp. 305–314.
CIKM-2012-SakrEH #graph #hybrid #named #query #scalability: G-SPARQL: a hybrid engine for querying large attributed graphs (SS, SE, YH), pp. 335–344.
CIKM-2012-ShiMWG #in the cloud #online #query: You can stop early with COLA: online processing of aggregate queries in the cloud (YS, XM, FW, YG), pp. 1223–1232.
CIKM-2012-SouihliS #predict #probability #query #xml: Demonstrating ProApproX 2.0: a predictive query engine for probabilistic XML (AS, PS), pp. 2734–2736.
CIKM-2012-StuparM #query: Being picky: processing top-k queries with set-defined selections (AS, SM), pp. 912–921.
CIKM-2012-SunSL #learning #multi #performance #query: Fast multi-task learning for query spelling correction (XS, AS, PL), pp. 285–294.
CIKM-2012-TeymorianQF #distributed #energy #named #query: RESQ: rank-energy selective query forwarding for distributed search systems (AYT, XQ, OF), pp. 2579–2582.
CIKM-2012-TorresHWS #query #recommendation: Query recommendation for children (SDT, DH, IW, PS), pp. 2010–2014.
CIKM-2012-VouzoukidouAC #query: Processing continuous text queries featuring non-homogeneous scoring functions (NV, BA, VC), pp. 1065–1074.
CIKM-2012-YamamotoSIYWT #clustering #mining #query: The wisdom of advertisers: mining subgoals via query clustering (TY, TS, MI, CY, JRW, KT), pp. 505–514.
CIKM-2012-YanZN12a #nearest neighbour #query: Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces (DY, ZZ, WN), pp. 942–951.
CIKM-2012-YinPZH #multi #summary: Query-focused multi-document summarization based on query-sensitive feature space (WY, YP, FZ, LH), pp. 1652–1656.
CIKM-2012-YueJHH #analysis #collaboration #query #web: Where do the query terms come from?: an analysis of query reformulation in collaborative web search (ZY, JJ, SH, DH), pp. 2595–2598.
CIKM-2012-YungLY #authentication #query: Authentication of moving range queries (DY, EL, MLY), pp. 1372–1381.
CIKM-2012-YuR #identification #query: Role-explicit query identification and intent role annotation (HY, FR), pp. 1163–1172.
CIKM-2012-ZhangHLL #learning #rank #realtime #twitter: Query-biased learning to rank for real-time twitter search (XZ, BH, TL, BL), pp. 1915–1919.
CIKM-2012-ZhengWLS #database #ontology #query #semantics: Enabling ontology based semantic queries in biomedical database systems (SZ, FW, JJL, JHS), pp. 2651–2654.
CIKM-2012-ZhouLZ12a #collaboration #query #ranking: Collaborative ranking: improving the relevance for tail queries (KZ, XL, HZ), pp. 1900–1904.
CIKM-2012-ZhuGCL #behaviour #mining #query #recommendation: More than relevance: high utility query recommendation by mining users’ search behaviors (XZ, JG, XC, YL), pp. 1814–1818.
ECIR-2012-AlbakourKNASFR #analysis #query #web: Analysis of Query Reformulations in a Search Engine of a Local Web Site (MDA, UK, NN, IA, DS, MF, ANDR), pp. 517–521.
ECIR-2012-AliciAOCU #adaptation #query #web: Adaptive Time-to-Live Strategies for Query Result Caching in Web Search Engines (SA, ISA, RO, BBC, ÖU), pp. 401–412.
ECIR-2012-BortnikovDKL #modelling #query #transaction: Modeling Transactional Queries via Templates (EB, PD, AK, RL), pp. 13–24.
ECIR-2012-BoudinND #predict #query #using: Using a Medical Thesaurus to Predict Query Difficulty (FB, JYN, MD), pp. 480–484.
ECIR-2012-ChelaruAS #query: Analyzing the Polarity of Opinionated Queries (SC, ISA, SS), pp. 463–467.
ECIR-2012-DiriyeKH #interactive #query #web: Interactive Search Support for Difficult Web Queries (AD, GK, JH), pp. 37–49.
ECIR-2012-DiriyeTB #interactive #process #query: A Little Interaction Can Go a Long Way: Enriching the Query Formulation Process (AD, AT, AB), pp. 531–534.
ECIR-2012-GiangrecoSKS #image #retrieval #sketching #user interface: A User Interface for Query-by-Sketch Based Image Retrieval with Color Sketches (IG, MS, IAK, HS), pp. 571–572.
ECIR-2012-HarveyE #email #query: Exploring Query Patterns in Email Search (MH, DE), pp. 25–36.
ECIR-2012-HollinkHV #query: Explaining Query Modifications — An Alternative Interpretation of Term Addition and Removal (VH, JH, APdV), pp. 1–12.
ECIR-2012-JonassenB #concurrent #distributed #pipes and filters #retrieval: Intra-query Concurrent Pipelined Processing for Distributed Full-Text Retrieval (SJ, SEB), pp. 413–425.
ECIR-2012-KreuzerSKS #image #interactive #interface #retrieval #sketching: An Interactive Paper and Digital Pen Interface for Query-by-Sketch Image Retrieval (RK, MS, IAK, HS), pp. 317–328.
ECIR-2012-MantrachR12a #multi #query #using: A Mailbox Search Engine Using Query Multi-modal Expansion and Community-Based Smoothing (AM, JMR), pp. 576–577.
ECIR-2012-NawabSC #documentation #query #using: Retrieving Candidate Plagiarised Documents Using Query Expansion (RMAN, MS, PDC), pp. 207–218.
ECIR-2012-PeetzMRW #adaptation #modelling #query: Adaptive Temporal Query Modeling (MHP, EM, MdR, WW), pp. 455–458.
ECIR-2012-ZhouCHLJ #predict #query #web: Assessing and Predicting Vertical Intent for Web Queries (KZ, RC, MH, ML, JMJ), pp. 499–502.
ICPR-2012-CaoCZL #clustering #query: Locating high-density clusters with noisy queries (CC, SC, CZ, JL), pp. 3537–3540.
ICPR-2012-GuoWYLG #query: Query by humming via hierarchical filters (ZG, QW, LY, GL, JG), pp. 3021–3024.
ICPR-2012-PanZF #correlation #data type #query: Top-k correlated subgraph query for data streams (SP, XZ, MF), pp. 2906–2909.
ICPR-2012-WangGLLG #multi #query: Tempo variation based multilayer filters for query by humming (QW, ZG, BL, GL, JG), pp. 3034–3037.
ICPR-2012-YangGAZW #classification #clustering #query: Iterative clustering and support vectors-based high-confidence query selection for motor imagery EEG signals classification (HY, CG, KKA, HZ, CW), pp. 2169–2172.
KDD-2012-BawabMC #personalisation #query #recommendation #topic: Finding trending local topics in search queries for personalization of a recommendation system (ZAB, GHM, JFC), pp. 397–405.
KDD-2012-YangSLC #network #on the #query #social: On socio-spatial group query for location-based social networks (DNY, CYS, WCL, MSC), pp. 949–957.
KDD-2012-YuSZH #network #semantics: Query-driven discovery of semantically similar substructures in heterogeneous networks (XY, YS, PZ, JH), pp. 1500–1503.
KDIR-2012-ZanonACG #algorithm #query: A New Query Suggestion Algorithm for Taxonomy-based Search Engines (RZ, SA, MC, IG), pp. 151–156.
KEOD-2012-AygulCC #multi #natural language #ontology #query: Natural Language Query Processing in Multimedia Ontologies (FAA, NKC, IC), pp. 66–75.
KEOD-2012-MatskanisAMMR #approach #linked data #open data #query #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.
KR-2012-BienvenuLW #logic #query: Query Containment in Description Logics Reconsidered (MB, CL, FW).
KR-2012-CalvaneseOSS #complexity #query: The Complexity of Explaining Negative Query Answers in DL-Lite (DC, MO, MS, GS).
KR-2012-GottlobS #datalog #ontology #query #recursion #source code: Rewriting Ontological Queries into Small Nonrecursive Datalog Programs (GG, TS).
KR-2012-GrauHKKMMW #logic #query: Acyclicity Conditions and their Application to Query Answering in Description Logics (BCG, IH, MK, CK, DM, BM, ZW).
KR-2012-KikotKZ #owl #query: Conjunctive Query Answering with OWL 2 QL (SK, RK, MZ).
KR-2012-LutzW #complexity #logic #query: Non-Uniform Data Complexity of Query Answering in Description Logics (CL, FW).
KR-2012-Rodriguez-MuroC #ontology #performance #query: High Performance Query Answering over DL-Lite Ontologies (MRM, DC).
KR-2012-ThomazoBMR #algorithm #query #set: A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).
KR-2012-WuHTW #knowledge base #query: Assertion Absorption in Object Queries over Knowledge Bases (JW, AKH, DT, GEW).
SIGIR-2012-AdeyanjuSAKRF #adaptation #concept #query #recommendation: Adaptation of the concept hierarchy model with search logs for query recommendation on intranets (IAA, DS, MDA, UK, ANDR, MF), pp. 5–14.
SIGIR-2012-AlasiryLP #detection #query: Detecting candidate named entities in search queries (AA, ML, AP), pp. 1049–1050.
SIGIR-2012-BaoKL #automation #enterprise: Automatic suggestion of query-rewrite rules for enterprise search (ZB, BK, YL), pp. 591–600.
SIGIR-2012-BenderskyC #dependence #higher-order #information retrieval #modelling #query #using: Modeling higher-order term dependencies in information retrieval using query hypergraphs (MB, WBC), pp. 941–950.
SIGIR-2012-BilgicB #learning #query: Active query selection for learning rankers (MB, PNB), pp. 1033–1034.
SIGIR-2012-BlancoB #multi #query: Extending BM25 with multiple query operators (RB, PB), pp. 921–930.
SIGIR-2012-BonchiPSVV #performance #query #recommendation: Efficient query recommendations in the long tail via center-piece subgraphs (FB, RP, FS, HV, RV), pp. 345–354.
SIGIR-2012-CarmelK #information retrieval #performance #predict #query: Query performance prediction for IR (DC, OK), pp. 1196–1197.
SIGIR-2012-ChuklinS #how #query: How query extensions reflect search result abandonments (AC, PS), pp. 1087–1088.
SIGIR-2012-FreireMTOC #query #scheduling: Scheduling queries across replicas (AF, CM, NT, IO, FC), pp. 1139–1140.
SIGIR-2012-HosseiniCMSY #evaluation #information retrieval #query: An uncertainty-aware query selection model for evaluation of IR systems (MH, IJC, NMF, MS, EY), pp. 901–910.
SIGIR-2012-HuQLJPZ #mining #query #topic: Mining query subtopics from search log data (YH, YnQ, HL, DJ, JP, QZ), pp. 305–314.
SIGIR-2012-JonassenCS #query: Prefetching query results and its impact on search engines (SJ, BBC, FS), pp. 631–640.
SIGIR-2012-KoumpouriS #effectiveness #feedback #query #retrieval: Queries without clicks: evaluating retrieval effectiveness based on user feedback (AK, VS), pp. 1133–1134.
SIGIR-2012-LiDZ #markov #query: A generalized hidden Markov model with discriminative training for query spelling correction (YL, HD, CZ), pp. 611–620.
SIGIR-2012-LiuSCNW #adaptation #query: Adaptive query suggestion for difficult queries (YL, RS, YC, JYN, JRW), pp. 15–24.
SIGIR-2012-LiWLF #performance #query: Supporting efficient top-k queries in type-ahead search (GL, JW, CL, JF), pp. 355–364.
SIGIR-2012-LiX #machine learning #web: Beyond bag-of-words: machine learning for query-document matching in web search (HL, JX), p. 1177.
SIGIR-2012-MacdonaldTO #learning #online #predict #query #scheduling: Learning to predict response times for online query scheduling (CM, NT, IO), pp. 621–630.
SIGIR-2012-MaCSSLW #assessment #query: New assessment criteria for query suggestion (ZM, YC, RS, TS, JL, JRW), pp. 1109–1110.
SIGIR-2012-MahdabiAKC #automation #concept #predict #query #refinement #using: Automatic refinement of patent queries using concept importance predictors (PM, LA, MK, FC), pp. 505–514.
SIGIR-2012-MaW #query #web: User-aware caching and prefetching query results in web search engines (HM, BW), pp. 1163–1164.
SIGIR-2012-OzertemCDV #framework #machine learning #query #ranking: Learning to suggest: a machine learning framework for ranking query suggestions (UO, OC, PD, EV), pp. 25–34.
SIGIR-2012-RoyGCL #evaluation #framework #query #segmentation #web: An IR-based evaluation framework for web search query segmentation (RSR, NG, MC, SL), pp. 881–890.
SIGIR-2012-ShokouhiR #query: Time-sensitive query auto-completion (MS, KR), pp. 601–610.
SIGIR-2012-SongYXLLW #multi #query #summary: Multi-aspect query summarization by composite query (WS, QY, ZX, TL, SL, JRW), pp. 325–334.
SIGIR-2012-WuKH #evaluation #quality #query: User evaluation of query quality (WCW, DK, KH), pp. 215–224.
SIGIR-2012-XueC #generative #query: Generating reformulation trees for complex queries (XX, WBC), pp. 525–534.
SIGIR-2012-ZhangSCC #keyword #named #performance #query: See-to-retrieve: efficient processing of spatio-visual keyword queries (CZ, LS, KC, GC), pp. 681–690.
SIGIR-2012-ZhaoC #automation #query: Automatic term mismatch diagnosis for selective query expansion (LZ, JC), pp. 515–524.
AMT-2012-UjhelyiSRV #query #visualisation: Developing and visualizing live model queries (ZU, TS, IR, DV), pp. 35–40.
ECMFA-2012-GoldschmidtM #domain-specific language #query: An Internal Domain-Specific Language for Constructing OPC UA Queries and Event Filters (TG, WM), pp. 62–73.
ECMFA-2012-RathHV #emf #query: Derived Features for EMF by Integrating Advanced Model Queries (IR, ÁH, DV), pp. 102–117.
MoDELS-2012-HegedusHRV #emf #modelling: Query-Driven Soft Interconnection of EMF Models (ÁH, ÁH, IR, DV), pp. 134–150.
MoDELS-2012-HegedusHRV #emf #modelling: Query-Driven Soft Interconnection of EMF Models (ÁH, ÁH, IR, DV), pp. 134–150.
PLATEAU-2012-UrmaM #evolution #programming language #query #source code: Programming language evolution via source code query languages (RGU, AM), pp. 35–38.
TOOLS-EUROPE-2012-BergmannHHRUV #emf #performance #query #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.
REFSQ-2012-Cleland-HuangHHLM #assurance #query #requirements #safety: Trace Queries for Safety Requirements in High Assurance Systems (JCH, MPEH, JHH, RRL, PM), pp. 179–193.
SAC-2012-ObaidAMS #database #execution #mobile #query: Query execution on a mobile database system (AO, AMA, HM, NS), pp. 569–571.
SAC-2012-PetitLR #data type #query: Revisiting formal ordering in data stream querying (LP, CL, CR), pp. 813–818.
SAC-2012-PozzaniC #named #query #sql: ST4SQL: a spatio-temporal query language dealing with granularities (GP, CC), pp. 23–25.
SAC-2012-SioutasPKT #named #network #probability #query: SART: dynamic P2P query processing in sensor networks with probabilistic guarantees (SS, AP, IK, DT), pp. 847–852.
SAC-2012-TriaLT #approximate #evaluation #metric #query: Metrics for approximate query engine evaluation (FDT, EL, FT), pp. 885–887.
SAC-2012-VerheijKFVH #framework #query #ranking: Querying and ranking news items in the hermes framework (AV, AK, FF, DV, FH), pp. 672–679.
ICSE-2012-HaiducBOML #query #re-engineering #retrieval: Evaluating the specificity of text retrieval queries to support software engineering tasks (SH, GB, RO, AM, ADL), pp. 1273–1276.
OSDI-2012-NarayanH #database #distributed #named #query: DJoin: Differentially Private Join Queries over Distributed Databases (AN, AH), pp. 149–162.
CSL-2012-Brault-Baron #query: A Negative Conjunctive Query is Easy if and only if it is β-Acyclic (JBB), pp. 137–151.
ICLP-2012-BryS #query #semistructured data #simulation #unification: Simulation Unification: Beyond Querying Semistructured Data (Invited Talk) (FB, SS), pp. 1–13.
ICST-2012-McMinnSS #data type #generative #query #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.
ICTSS-2012-YangHF #embedded #logic #parametricity #query: Querying Parametric Temporal Logic Properties on Embedded Systems (HY, BH, GEF), pp. 136–151.
IJCAR-2012-ChekolEGL #query: SPARQL Query Containment under RDFS Entailment Regime (MWC, JE, PG, NL), pp. 134–148.
ASE-2011-Haiduc #automation #concept #detection #quality #query: Automatically detecting the quality of the query and its implications in IR-based concept location (SH), pp. 637–640.
ASE-2011-KimmigMM #natural language #query #source code: Querying source code with natural language (MK, MM, MM), pp. 376–379.
HT-2011-DaiQD #query #web: Bridging link and query intent to enhance web search (ND, XQ, BDD), pp. 17–26.
ICDAR-2011-ZanibbiY #documentation #image #query #using: Math Spotting: Retrieving Math in Technical Documents Using Handwritten Query Images (RZ, LY), pp. 446–451.
PODS-2011-AmsterdamerDT #query: Provenance for aggregate queries (YA, DD, VT), pp. 153–164.
PODS-2011-ArenasP #query #semantics #web: Querying semantic web data with SPARQL (MA, JP), pp. 305–316.
PODS-2011-BarceloLR #graph #query: Querying graph patterns (PB, LL, JLR), pp. 199–210.
PODS-2011-KoutrisS #evaluation #parallel #query: Parallel evaluation of conjunctive queries (PK, DS), pp. 223–234.
PODS-2011-WeiY #query #summary: Beyond simple aggregates: indexing for summary queries (ZW, KY), pp. 117–128.
SIGMOD-2011-Bajda-PawlikowskiASP #execution #performance #query: Efficient processing of data warehousing queries in a split execution environment (KBP, DJA, AS, EP), pp. 1165–1176.
SIGMOD-2011-BalesDV #algebra #optimisation #query: Score-consistent algebraic optimization of full-text search queries with GRAFT (NB, AD, VV), pp. 769–780.
SIGMOD-2011-CaoCJO #keyword #query: Collective spatial keyword querying (XC, GC, CSJ, BCO), pp. 373–384.
SIGMOD-2011-DamaggioDZ #behaviour #contract #database #query: Querying contract databases based on temporal behavior (ED, AD, DZ), pp. 397–408.
SIGMOD-2011-ElmeleegyEL #generative #query: Leveraging query logs for schema mapping generation in U-MAP (HE, AKE, JL), pp. 121–132.
SIGMOD-2011-EsmailiSFT #query: Changing flights in mid-air: a model for safely modifying continuous queries (KSE, TS, PMF, NT), pp. 613–624.
SIGMOD-2011-FinkHOR #named #nondeterminism #query #web: SPROUT2: a squared query engine for uncertain web data (RF, AH, DO, SR), pp. 1299–1302.
SIGMOD-2011-FranklinKKRX #crowdsourcing #named #query: CrowdDB: answering queries with crowdsourcing (MJF, DK, TK, SR, RX), pp. 61–72.
SIGMOD-2011-GuptaKBRGK #coordination #query: Coordination through querying in the youtopia system (NG, LK, GB, SR, JG, CK), pp. 1331–1334.
SIGMOD-2011-GuptaKRBGK #coordination #data-driven #declarative #query: Entangled queries: enabling declarative data-driven coordination (NG, LK, SR, GB, JG, CK), pp. 673–684.
SIGMOD-2011-HerodotouBB #optimisation #query: Query optimization techniques for partitioned tables (HH, NB, SB), pp. 49–60.
SIGMOD-2011-HoweCKB #ad hoc #automation #database #query: Automatic example queries for ad hoc databases (BH, GC, NK, LB), pp. 1319–1322.
SIGMOD-2011-JinBXCZ #named #query #visual notation: GBLENDER: visual subgraph query formulation meets query processing (CJ, SSB, XX, BC, SZ), pp. 1327–1330.
SIGMOD-2011-JinP #evaluation #performance #query: Efficient and generic evaluation of ranked queries (WJ, JMP), pp. 601–612.
SIGMOD-2011-KanagalLD #analysis #database #evaluation #probability #query #robust: Sensitivity analysis and explanations for robust query evaluation in probabilistic databases (BK, JL, AD), pp. 841–852.
SIGMOD-2011-KantereDGA #predict #query: Predicting cost amortization for query services (VK, DD, GG, AA), pp. 325–336.
SIGMOD-2011-KashyapP #agile #dataset #development #interface #query #xml: Rapid development of web-based query interfacesfor XML datasets with QURSED (AK, MP), pp. 1339–1342.
SIGMOD-2011-KaushikR #performance #query #sql: Efficient auditing for complex SQL queries (RK, RR), pp. 697–708.
SIGMOD-2011-KonstantinidisA #approach #graph #query #scalability: Scalable query rewriting: a graph-based approach (GK, JLA), pp. 97–108.
SIGMOD-2011-LianC #graph #performance #probability #query #rdf: Efficient query answering in probabilistic RDF graphs (XL, LC), pp. 157–168.
SIGMOD-2011-LiuRGGWAM #analysis #multi #named #query #sequence #using: E-Cube: multi-dimensional event sequence analysis using hierarchical pattern query sharing (ML, EAR, KG, CG, SW, IA, AM), pp. 889–900.
SIGMOD-2011-LuADT #named #probability #query: Schema-as-you-go: on probabilistic tagging and querying of wide tables (ML, DA, BTD, AKHT), pp. 181–192.
SIGMOD-2011-MarcusWKMM #query: Demonstration of Qurk: a query processor for humanoperators (AM, EW, DRK, SM, RCM), pp. 1315–1318.
SIGMOD-2011-PoundPT #approach #mining #web: Facet discovery for structured web search: a query-log mining approach (JP, SP, PT), pp. 169–180.
SIGMOD-2011-QinWLXL #performance #query #similarity #symmetry: Efficient exact edit similarity query processing with the asymmetric signature scheme (JQ, WW, YL, CX, XL), pp. 1033–1044.
SIGMOD-2011-SenellartS #approximate #lightweight #named #probability #query: ProApproX: a lightweight approximation query processor over probabilistic trees (PS, AS), pp. 1295–1298.
SIGMOD-2011-TekleL #datalog #performance #query #set: More efficient datalog queries: subsumptive tabling beats magic sets (KTT, YAL), pp. 661–672.
SIGMOD-2011-UpadhyayaKB #fault tolerance #latency #online #parallel #query: A latency and fault-tolerance optimizer for online parallel query plans (PU, YK, MB), pp. 241–252.
SIGMOD-2011-VlachouDP #query: Skyline query processing over joins (AV, CD, NP), pp. 73–84.
SIGMOD-2011-YangWCK #constraints #nondeterminism #query: Querying uncertain data with aggregate constraints (MY, HW, HC, WSK), pp. 817–828.
SIGMOD-2011-ZhouFSTHILS #declarative #distributed #framework #maintenance #named #query: NetTrails: a declarative platform for maintaining and querying provenance in distributed systems (WZ, QF, SS, TT, AH, ZGI, BTL, MS), pp. 1323–1326.
VLDB-2011-BenouaretBHB #composition #fuzzy #named #query #web #web service: FuDoCS: A Web Service Composition System Based on Fuzzy Dominance for Preference Query Answering (KB, DB, AH, MB), pp. 1430–1433.
VLDB-2011-BerneckerEKRZZ #nearest neighbour #nondeterminism #performance #probability #query: Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data (TB, TE, HPK, MR, SZ, AZ), pp. 669–680.
VLDB-2011-CaoSDS #distributed #monitoring #query: Distributed inference and query processing for RFID tracking and monitoring (ZC, CAS, YD, PJS), pp. 326–337.
VLDB-2011-FengFKKMRWX #named #query: CrowdDB: Query Processing with the VLDB Crowd (AF, MJF, DK, TK, SM, SR, AW, RX), pp. 1387–1390.
VLDB-2011-FontouraJLVZZ #evaluation #query: Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes (MF, VJ, JL, SV, XZ, JYZ), pp. 1213–1224.
VLDB-2011-FunkeKN #query #transaction: HyPer-sonic Combined Transaction AND Query Processing (FF, AK, TN), pp. 1367–1370.
VLDB-2011-Gatterbauer #database #query #visualisation: Databases will Visualize Queries too (WG), pp. 1498–1501.
VLDB-2011-HuangAR #graph #query #rdf #scalability: Scalable SPARQL Querying of Large RDF Graphs (JH, DJA, KR), pp. 1123–1134.
VLDB-2011-KerstenIML #database #query #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.
VLDB-2011-KhannaRT #database #difference #probability #query: Queries with Difference on Probabilistic Databases (SK, SR, VT), pp. 1051–1062.
VLDB-2011-KotsifakosPHG #framework #sequence: A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application (AK, PP, JH, DG), pp. 761–771.
VLDB-2011-LiuNC #clustering #query: Query Expansion Based on Clustered Results (ZL, SN, YC), pp. 350–361.
VLDB-2011-MoerkotteN #query: Accelerating Queries with Group-By and Join by Groupjoin (GM, TN), pp. 843–851.
VLDB-2011-NandiJ #interactive #paradigm: Guided Interaction: Rethinking the Query-Result Paradigm (AN, HVJ), pp. 1466–1469.
VLDB-2011-Neumann #compilation #hardware #performance #query: Efficiently Compiling Efficient Query Plans for Modern Hardware (TN0), pp. 539–550.
VLDB-2011-OrsiP #constraints #ontology #optimisation #query: Optimizing Query Answering under Ontological Constraints (GO, AP), pp. 1004–1015.
VLDB-2011-PengDL #nondeterminism #optimisation #probability #query: Optimizing Probabilistic Query Processing on Continuous Uncertain Data (LP, YD, AL), pp. 1169–1180.
VLDB-2011-RazniewskiN #database #query #semistructured data: Completeness of Queries over Incomplete Databases (SR, WN), pp. 749–760.
VLDB-2011-RenLKZC #evolution #graph #on the #query #sequence: On Querying Historical Evolving Graph Sequences (CR, EL, BK, XZ, RC), pp. 726–737.
VLDB-2011-VieiraRBHSTT #named #query: DivDB: A System for Diversifying Query Results (MRV, HLR, MCNB, MH, DS, CTJ, VJT), pp. 1395–1398.
VLDB-2011-YangCLC #constraints #on the #query: On Social-Temporal Group Query with Acquaintance Constraint (DNY, YLC, WCL, MSC), pp. 397–408.
VLDB-2011-ZeitlerR #query: Massive Scale-out of Expensive Continuous Queries (EZ, TR), pp. 1181–1188.
VLDB-2011-ZouMCOZ #named #query: gStore: Answering SPARQL Queries via Subgraph Matching (LZ, JM, LC, MTÖ, DZ), pp. 482–493.
VLDB-2012-ArmbrustCKFFP11 #in the cloud #named #query: PIQL: Success-Tolerant Query Processing in the Cloud (MA, KC, TK, AF, MJF, DAP), pp. 181–192.
VLDB-2012-LinJZXL11 #performance #privacy #query: A MovingObject Index for Efficient Query Processing with Peer-Wise Location Privacy (DL, CSJ, RZ, LX, JL), pp. 37–48.
VLDB-2012-RanuS11 #query: Answering Top-k Queries Over a Mixture of Attractive and Repulsive Dimensions (SR, AKS), pp. 169–180.
VLDB-2012-ZhaoAW11 #estimation #graph #named #query #sketching: gSketch: On Query Estimation in Graph Streams (PZ, CCA, MW), pp. 193–204.
ICPC-2011-HaiducM #concept #on the #query: On the Effect of the Query in IR-based Concept Location (SH, AM), pp. 234–237.
ICPC-2011-PanchenkoKPZ #database #precise #query #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.
ICSM-2011-NogueraRKJ #query: Program querying with a SOUL: The BARISTA tool suite (CN, CDR, AK, VJ), pp. 582–585.
SCAM-2011-AlvesHR #case study #comparative #query: A Comparative Study of Code Query Technologies (TLA, JH, PR), pp. 145–154.
PEPM-J-2007-CunhaV11 #query #source code #xpath: Transformation of structure-shy programs with application to XPath queries and strategic functions (AC, JV), pp. 516–539.
PLDI-2011-MurrayIY #automation #declarative #named #optimisation #query: Steno: automatic optimization of declarative queries (DGM, MI, YY), pp. 121–131.
SAS-2011-AvniK #abstraction #framework #query: An Abstraction-Refinement Framework for Trigger Querying (GA, OK), pp. 263–279.
STOC-2011-AryaFM #approximate #query: Approximate polytope membership queries (SA, GDdF, DMM), pp. 579–586.
STOC-2011-GuptaHRU #query #statistics: Privately releasing conjunctions and the statistical query barrier (AG, MH, AR, JU), pp. 803–812.
STOC-2011-Sherstov #communication #complexity #quantum #query #theorem: Strong direct product theorems for quantum communication and query complexity (AAS), pp. 41–50.
DLT-2011-Kasprzik #automaton #finite #query: Inference of Residual Finite-State Tree Automata from Membership Queries and Finite Positive Data (AK), pp. 476–477.
ICALP-v1-2011-BrodalT #query: Dynamic Planar Range Maxima Queries (GSB, KT), pp. 256–267.
ICALP-v2-2011-AndersonMSS #first-order #invariant #locality #logic #query: Locality of Queries Definable in Invariant First-Order Logic with Arbitrary Built-in Predicates (MA, DvM, NS, LS), pp. 368–379.
CHI-2011-FourneyMT #analysis #interactive #query #usability: Characterizing the usability of interactive applications through query log analysis (AF, RM, MAT), pp. 1817–1826.
CHI-2011-JetterGZRM #collaboration #hybrid #query: Materializing the query with facet-streams: a hybrid surface for collaborative search on tabletops (HCJ, JG, MZ, HR, NMF), pp. 3013–3022.
CSCW-2011-MooreCK #interactive #internet #query: Three sequential positions of query repair in interactions with internet search engines (RJM, EFC, RGPK), pp. 415–424.
HCI-DDA-2011-BirinciGG #feedback #image #query #retrieval: Dynamic Queries with Relevance Feedback for Content Based Image Retrieval (MB, EG, MG), pp. 547–554.
HCI-UA-2011-BilalE #query #web: Evaluating Leading Web Search Engines on Children’s Queries (DB, RE), pp. 549–558.
ICEIS-J-2011-AliPTD11a #query: Incorporating Data Concerns into Query Languages for Data Services (MIA, RP, HLT, SD), pp. 132–145.
ICEIS-J-2011-NganBL11a #framework #learning #monitoring #multi #query: An Event-Based Service Framework for Learning, Querying and Monitoring Multivariate Time Series (CKN, AB, JL), pp. 208–223.
ICEIS-v1-2011-AliPTD #integration #query: Data Concern Aware Querying for the Integration of Data Services (MIA, RP, HLT, SD), pp. 111–119.
ICEIS-v1-2011-LuoYHJCH #algorithm #named #query: IRTA: An Improved Threshold Algorithm for Reverse Top-k Queries (CL, FY, WCH, ZJ, DC, SH), pp. 135–140.
ICEIS-v1-2011-MakkiAGJ #evaluation #performance #query #semantics: Performance Evaluation of Query Trimming Strategies in Semantic Caching Environment (SKM, SA, YG, MSJ), pp. 169–176.
ICEIS-v2-2011-NganBL #framework #learning #monitoring #multi #query: A Service Framework for Learning, Querying and Monitoring Multivariate Time Series (CKN, AB, JL), pp. 92–101.
ICEIS-v3-2011-SchwinnKR #editing #information management #ontology #owl #query #visual notation: Ontology-based Knowledge Management — Graphical Query Editor for OWL Ontologies (MS, NK, SR), pp. 235–240.
CIKM-2011-AielloDOM #behaviour #clustering #query #topic: Behavior-driven clustering of queries into topics (LMA, DD, UO, FM), pp. 1373–1382.
CIKM-2011-AktolgaA #query #ranking: Reranking search results for sparse queries (EA, JA), pp. 173–182.
CIKM-2011-Almendros-JimenezST #optimisation #slicing #xquery: XQuery optimization based on program slicing (JMAJ, JS, ST), pp. 1525–1534.
CIKM-2011-AmodeoAG #on the #query: On relevance, time and query expansion (GA, GA, GG), pp. 1973–1976.
CIKM-2011-AzzamRY #query #sql: Ranking-based processing of SQL queries (HA, TR, SY), pp. 231–236.
CIKM-2011-BianC #classification #query #taxonomy: A taxonomy of local search: semi-supervised query classification driven by information needs (JB, YC), pp. 2425–2428.
CIKM-2011-BingLW #query #social #topic #using: Using query log and social tagging to refine queries based on latent topics (LB, WL, TLW), pp. 583–592.
CIKM-2011-BykauMRV #evolution #query #using: Supporting queries spanning across phases of evolving artifacts using Steiner forests (SB, JM, FR, YV), pp. 1649–1658.
CIKM-2011-ChenCC #framework #hybrid #network #query: Coupling or decoupling for KNN search on road networks?: a hybrid framework on user query patterns (YJC, KTC, MSC), pp. 795–804.
CIKM-2011-ChenSNC #adaptation #classification #query #self: Improving context-aware query classification via adaptive self-training (MC, JTS, XN, YC), pp. 115–124.
CIKM-2011-ChristoforakiHDMS #performance #query: Text vs. space: efficient geo-search query processing (MC, JH, CD, AM, TS), pp. 423–432.
CIKM-2011-ChuiKLC #algorithm #query #sequence: I/O-efficient algorithms for answering pattern-based aggregate queries in a sequence OLAP system (CKC, BK, EL, RC), pp. 1619–1628.
CIKM-2011-DangXC #aspect-oriented #clustering #query #using: Inferring query aspects from reformulations using clustering (VD, XX, WBC), pp. 2117–2120.
CIKM-2011-DengLPCX #ad hoc #database #graph #predict #query #reachability: Predicting the optimal ad-hoc index for reachability queries on graph databases (JD, FL, YP, BC, JX), pp. 2357–2360.
CIKM-2011-DouHLSW #query: Finding dimensions for queries (ZD, SH, YL, RS, JRW), pp. 1311–1320.
CIKM-2011-DuanLZ #automation #query: Automatic query reformulation with syntactic operators to alleviate search difficulty (HD, RL, CZ), pp. 2037–2040.
CIKM-2011-FuLZZ #learning #query: Do they belong to the same class: active learning by querying pairwise label homogeneity (YF, BL, XZ, CZ), pp. 2161–2164.
CIKM-2011-GangulyLMJ #feedback #pseudo #query #reduction #using: Patent query reduction using pseudo relevance feedback (DG, JL, WM, GJFJ), pp. 1953–1956.
CIKM-2011-Garcia-AlvaradoO #database #documentation #query #web: Integrating and querying web databases and documents (CGA, CO), pp. 2369–2372.
CIKM-2011-GollapudiINP #performance #query #web: Efficient query rewrite for structured web queries (SG, SI, AN, SP), pp. 2417–2420.
CIKM-2011-GuirguisSCL #multi #query: Optimized processing of multiple aggregate continuous queries (SG, MAS, PKC, AL), pp. 1515–1524.
CIKM-2011-GuoCXZ #query #similarity: Intent-aware query similarity (JG, XC, GX, XZ), pp. 259–268.
CIKM-2011-GurajadaK #maintenance #online: Index tuning for query-log based on-line index maintenance (SG, PSK), pp. 1997–2000.
CIKM-2011-HagenSR #detection #query: Query session detection as a cascade (MH, BS, TR), pp. 147–152.
CIKM-2011-HummelSML #keyword #multi #query #xml: Multiple keyword-based queries over XML streams (FdCH, ASdS, MMM, AHFL), pp. 1577–1582.
CIKM-2011-KacimiG #query: Diversifying search results of controversial queries (MK, JG), pp. 93–98.
CIKM-2011-KarimzadehganZ #documentation #modelling #query #retrieval: Improving retrieval accuracy of difficult queries through generalizing negative document language models (MK, CZ), pp. 27–36.
CIKM-2011-KiselevaAB #case study #mining #query: Mining query structure from click data: a case study of product queries (JK, EA, DB), pp. 2217–2220.
CIKM-2011-KotovZ #feedback #interactive #query: Interactive sense feedback for difficult queries (AK, CZ), pp. 163–172.
CIKM-2011-LinC #data fusion #learning #query: Query sampling for learning data fusion (TCL, PJC), pp. 141–146.
CIKM-2011-LinXH #authentication #query: Authentication of location-based skyline queries (XL, JX, HH), pp. 1583–1588.
CIKM-2011-LiuNSC #classification #comprehension #query #transaction: Unsupervised transactional query classification based on webpage form understanding (YL, XN, JTS, ZC), pp. 57–66.
CIKM-2011-LiuYS #dataset #query: Subject-oriented top-k hot region queries in spatial dataset (JL, GY, HS), pp. 2409–2412.
CIKM-2011-LiZTLG #data type #in the cloud #query: Continuous data stream query in the cloud (JL, PZ, JT, PL, LG), pp. 2389–2392.
CIKM-2011-MaLL #using: Selecting related terms in query-logs using two-stage SimRank (YM, HL, YL), pp. 1969–1972.
CIKM-2011-MaZSDC #query: Matching query processing in high-dimensional space (CM, YZ, LS, DD, GC), pp. 1589–1594.
CIKM-2011-ONeilPA #behaviour #game studies #named #query: Fu-Finder: a game for studying querying behaviours (CO, JP, LA), pp. 2561–2564.
CIKM-2011-OrdonezG #data mining #database #mining #query #relational #sql: A data mining system based on SQL queries and UDFs for relational databases (CO, CGA), pp. 2521–2524.
CIKM-2011-ParkL #data type #detection #evaluation #query: A continuous query evaluation scheme for a detection-only query over data streams (HKP, WSL), pp. 2405–2408.
CIKM-2011-ParkSBY #distance #nearest neighbour #query: k-Nearest neighbor query processing method based on distance relation pattern (YP, DS, KB, JY), pp. 2413–2416.
CIKM-2011-Pasca #query #using #web #what: Asking what no one has asked before: using phrase similarities to generate synthetic web search queries (MP), pp. 1347–1352.
CIKM-2011-PelekisGVKT #privacy #query: Privacy-aware querying over sensitive trajectory data (NP, AGD, MV, DK, YT), pp. 895–904.
CIKM-2011-PeraQN #multi #sentiment: A query-based multi-document sentiment summarizer (MSP, RQ, YKN), pp. 1071–1076.
CIKM-2011-PuWLW #incremental #named #performance #query #rdf: AWETO: efficient incremental update and querying in rdf storage system (XP, JW, PL, MW), pp. 2445–2448.
CIKM-2011-ShanZHYYL #performance #query: Efficient phrase querying with flat position index (DS, WXZ, JH, RY, HY, XL), pp. 2001–2004.
CIKM-2011-ShastriDRW #multi #named #scalability: MTopS: scalable processing of continuous top-k multi-query workloads (AS, DY, EAR, MOW), pp. 1107–1116.
CIKM-2011-TomasATV #named #query #scalability: RoSeS: a continuous query processor for large-scale RSS filtering and aggregation (JCT, BA, NT, DV), pp. 2549–2552.
CIKM-2011-TranCW #constraints #evaluation #query: Evaluation of set-based queries with aggregation constraints (QTT, CYC, GW), pp. 1495–1504.
CIKM-2011-TsangC #query #regular expression #robust: A robust index for regular expression queries (DT, SC), pp. 2365–2368.
CIKM-2011-UllegaddiV #category theory #learning #query #rank #web: Learning to rank categories for web queries (PU, VV), pp. 2065–2068.
CIKM-2011-WangA #data flow #effectiveness #query #web: Effective stratification for low selectivity queries on deep web data sources (FW, GA), pp. 1455–1464.
CIKM-2011-WangYS #documentation #feedback: Relevance feedback exploiting query-specific document manifolds (CW, EY, MS), pp. 1957–1960.
CIKM-2011-XueY #modelling #query #topic: Topic modeling for named entity queries (XX, XY), pp. 2009–2012.
CIKM-2011-YanGC #higher-order #learning #query #recommendation: Context-aware query recommendation by learning high-order relation in query logs (XY, JG, XC), pp. 2073–2076.
CIKM-2011-YangZJ #graph #multi #named #query: DELTA: indexing and querying multi-labeled graphs (JY, SZ, WJ), pp. 1765–1774.
CIKM-2011-YiA #query #web: Discovering missing click-through query language information for web search (XY, JA), pp. 153–162.
ECIR-2011-AlbakourKNKSFR #evaluation #named #query #using: AutoEval: An Evaluation Methodology for Evaluating Query Suggestions Using Query Logs (MDA, UK, NN, YK, DS, MF, ANDR), pp. 605–610.
ECIR-2011-ArampatzisED: Enhancing Deniability against Query-Logs (AA, PSE, GD), pp. 117–128.
ECIR-2011-BadrinathVM #query #summary #using: Improving Query Focused Summarization Using Look-Ahead Strategy (RB, SV, CEVM), pp. 641–652.
ECIR-2011-EickhoffPGTG #query #web: Web Search Query Assistance Functionality for Young Audiences (CE, TP, KG, SDT, RG), pp. 776–779.
ECIR-2011-FrommholzPLR #framework #information retrieval #query: Processing Queries in Session in a Quantum-Inspired IR Framework (IF, BP, ML, KvR), pp. 751–754.
ECIR-2011-GyllstromM #query #topic: Clash of the Typings — Finding Controversies and Children’s Topics Within Queries (KG, MFM), pp. 80–91.
ECIR-2011-HefnyDA #exclamation #query: Is a Query Worth Translating: Ask the Users! (AH, KD, AA), pp. 238–250.
ECIR-2011-HerbertSG #information retrieval #query: Combining Query Translation Techniques to Improve Cross-Language Information Retrieval (BH, GS, IG), pp. 712–715.
ECIR-2011-JonassenB #performance: Efficient Compressed Inverted Index Skipping for Disjunctive Text-Queries (SJ, SEB), pp. 530–542.
ECIR-2011-MassoudiTRW #microblog #quality #query: Incorporating Query Expansion and Quality Indicators in Searching Microblog Posts (KM, MT, MdR, WW), pp. 362–367.
KDD-2011-RashidiC #induction #learning #query: Ask me better questions: active learning queries based on rule induction (PR, DJC), pp. 904–912.
KDIR-2011-AlouaouiTF #mining #query: Querying and Mining Spatiotemporal Association Rules (HA, SYT, SF), pp. 402–405.
KDIR-2011-CamelinDHQL #comprehension #concept: Concept Discovery for Language Understanding in an Information-query Dialogue System (NC, BD, SH, DQ, FL), pp. 24–29.
KDIR-2011-ClariziaCSGN #graph #novel #query: A Novel Query Expansion Technique based on a Mixed Graph of Terms (FC, FC, MDS, LG, PN), pp. 84–93.
KDIR-2011-RomeiT #process #programming #using #xquery: Programming the KDD Process using XQuery (AR, FT), pp. 131–139.
KDIR-2011-SethCRSB #analysis #query #similarity: A Tale of Two (Similar) Cities — Inferring City Similarity through Geo-spatial Query Log Analysis (RS, MC, DR, DS, SB), pp. 179–189.
KEOD-2011-SeinturierMB #data transformation #knowledge-based #multimodal #query #representation: Knowledge-based Multimodal Data Representation and Querying (JS, EM, EB), pp. 152–158.
KMIS-2011-AouichaFTH #automation #query: Structure-based Interrogation and Automatic Query Reformulation (MBA, IKF, MT, ABH), pp. 123–128.
KMIS-2011-SchwinnKR #approach #editing #information management #ontology #query #visual notation: An Approach to a Graphical Query Editor — For Ontology-based Knowledge Management (MS, NK, SR), pp. 436–441.
SIGIR-2011-BenderskyMC #concept #query: Parameterized concept weighting in verbose queries (MB, DM, WBC), pp. 605–614.
SIGIR-2011-BhatiaMM #query: Query suggestions in the absence of query logs (SB, DM, PM), pp. 795–804.
SIGIR-2011-BouadjenekHBD #personalisation #query #social #using: Personalized social query expansion using social bookmarking systems (MRB, HH, MB, JD), pp. 1113–1114.
SIGIR-2011-CaiGZW #adaptation #education #query #ranking: Relevant knowledge helps in choosing right teacher: active query selection for ranking adaptation (PC, WG, AZ, KFW), pp. 115–124.
SIGIR-2011-Campos #analysis #query #using #web: Using k-Top retrieved web snippets to date temporalimplicit queries based on web content analysis (RNTC), pp. 1325–1326.
SIGIR-2011-CumminsJO #performance #predict #query #standard #using: Improved query performance prediction using standard deviation (RC, JMJ, CO), pp. 1089–1090.
SIGIR-2011-DattaV #query: Tossing coins to trim long queries (SD, VV), pp. 1255–1256.
SIGIR-2011-ElsweilerLTF #evaluation #query: Seeding simulated queries with user-study data forpersonal search evaluation (DE, DEL, JCT, RTF), pp. 25–34.
SIGIR-2011-FangSSKM #analysis #query: Analysis of an expert search query log (YF, NS, LS, JK, APM), pp. 1189–1190.
SIGIR-2011-Ghorab #adaptation #information retrieval #multi #personalisation #query: Improving query and result list adaptation in personalized multilingual information retrieval (MRG), pp. 1323–1324.
SIGIR-2011-HeS #performance #query #version control: Faster temporal range queries over versioned text (JH, TS), pp. 565–574.
SIGIR-2011-JainOV #query #web: Synthesizing high utility suggestions for rare web search queries (AJ, UO, EV), pp. 805–814.
SIGIR-2011-Jiang #graph #query #semantics: Query expansion based on a semantic graph model (XJ), pp. 1315–1316.
SIGIR-2011-JiYGHHZC #graph #learning #query #web: Learning search tasks in queries and web pages via graph regularization (MJ, JY, SG, JH, XH, WVZ, ZC), pp. 55–64.
SIGIR-2011-KanhabuaN #performance #predict #query: Time-based query performance predictors (NK, KN), pp. 1181–1182.
SIGIR-2011-KanoulasCCS #multi: Evaluating multi-query sessions (EK, BC, PDC, MS), pp. 1053–1062.
SIGIR-2011-KayaaslanCBJA #energy #multi #query #web: Energy-price-driven query processing in multi-center web search engines (EK, BBC, RB, FPJ, CA), pp. 983–992.
SIGIR-2011-KimSC #automation #query: Automatic boolean query suggestion for professional search (YK, JS, WBC), pp. 825–834.
SIGIR-2011-LiHZW #information retrieval #query #segmentation #using: Unsupervised query segmentation using clickthrough for information retrieval (YL, BJPH, CZ, KW), pp. 285–294.
SIGIR-2011-LinLJY #approach #machine learning #query #social: Social annotation in query expansion: a machine learning approach (YL, HL, SJ, ZY), pp. 405–414.
SIGIR-2011-PolajnarGA #named #query #taxonomy: JuSe: a picture dictionary query system for children (TP, RG, LA), pp. 1281–1282.
SIGIR-2011-Shokouhi #analysis #detection #query: Detecting seasonal queries by time-series analysis (MS), pp. 1171–1172.
SIGIR-2011-SinghPS #behaviour #query: User behavior in zero-recall ecommerce queries (GS, NP, NS), pp. 75–84.
SIGIR-2011-SongZH #query: Post-ranking query suggestion by diversifying search results (YS, DZ, LwH), pp. 815–824.
SIGIR-2011-SongZXLL #query #ranking: Query term ranking based on search results overlap (WS, YZ, YX, TL, SL), pp. 1253–1254.
SIGIR-2011-SunDLC #network #query #semantics #social #visualisation: Visualizing and querying semantic social networks (AS, AD, EPL, KC), pp. 1271–1272.
SIGIR-2011-WengLCZZYZ #approach #documentation #query #retrieval: Query by document via a decomposition-based two-level retrieval approach (LW, ZL, RC, YZ, YZ, LTY, LZ), pp. 505–514.
SIGIR-2011-WuYLLYX #learning #rank #using: Learning to rank using query-level regression (JW, ZY, YL, HL, ZY, KX), pp. 1091–1092.
SIGIR-2011-XueC #modelling #query #set: Modeling subset distributions for verbose queries (XX, WBC), pp. 1133–1134.
ECMFA-2011-BergmannHRV #emf #evaluation #incremental #modelling #query #tutorial: Incremental Evaluation of Model Queries over EMF Models: A Tutorial on EMF-IncQuery (GB, ÁH, IR, DV), pp. 389–390.
ICMT-2011-BergmannURV #emf #graph #modelling #query: A Graph Query Language for EMF Models (GB, ZU, IR, DV), pp. 167–182.
ECOOP-2011-PothierT #debugging #query #scalability: Summarized Trace Indexing and Querying for Scalable Back-in-Time Debugging (GP, ÉT), pp. 558–582.
LOPSTR-2011-Almendros-JimenezCGS #declarative #functional #xquery: A Declarative Embedding of XQuery in a Functional-Logic Language (JMAJ, RC, YGR, FSP), pp. 42–56.
PPDP-2011-ColazzoS #complexity #precise #type inference #xquery: Precision and complexity of XQuery type inference (DC, CS), pp. 89–100.
SAC-2011-AdaikkalavanP #query: Secure shared continuous query processing (RA, TP), pp. 1000–1005.
SAC-2011-DabringerE #performance #query #retrieval: Efficient top-k retrieval for user preference queries (CD, JE), pp. 1045–1052.
SAC-2011-GroppeG #database #query #scalability #semantics #web: Parallelizing join computations of SPARQL queries for large semantic web databases (JG, SG), pp. 1681–1686.
SAC-2011-Jamil #graph #query #unification #using: Computing subgraph isomorphic queries using structural unification and minimum graph structures (HMJ), pp. 1053–1058.
SAC-2011-LinC #query #towards: Towards communication-efficient private location dependent queries (KPL, MSC), pp. 433–438.
SAC-2011-LiuCC #network #query: Voronoi-based range query for trajectory data in spatial networks (SL, LC, GC), pp. 1022–1026.
SAC-2011-YeHL #approach #network #query: A Bayesian network approach to context sensitive query expansion (ZY, XH, HL), pp. 1138–1142.
SAC-2011-ZhengC #database #query: Determinacy and rewriting of conjunctive queries over unary database schemas (LZ, HC), pp. 1039–1044.
SLE-2011-KlingJWBC #domain-specific language #named #query #repository: MoScript: A DSL for Querying and Manipulating Model Repositories (WK, FJ, DW, MB, JC), pp. 180–200.
SOSP-2011-PopaRZB #named #query: CryptDB: protecting confidentiality with encrypted query processing (RAP, CMSR, NZ, HB), pp. 85–100.
CADE-2011-ChortarasTS #owl #query: Optimized Query Rewriting for OWL 2 QL (AC, DT, GBS), pp. 192–206.
CSL-2011-DurandS #complexity #higher-order #logic #problem #query: Enumeration Complexity of Logical Query Problems with Second-order Variables (AD, YS), pp. 189–202.
ASE-2010-GibiecCC #mining #query #towards: Towards mining replacement queries for hard-to-retrieve traces (MG, AC, JCH), pp. 245–254.
ASE-2010-KhalekK #automation #database #generative #query #sql #testing: Automated SQL query generation for systematic testing of database engines (SAK, SK), pp. 329–332.
ASE-2010-WangLCZMY #dependence #graph #query: Matching dependence-related queries in the system dependence graph (XW, DL, JC, LZ, HM, JXY), pp. 457–466.
PODS-2010-BarceloHLW #query: Expressive languages for path queries over graph-structured data (PB, CAH, LL, PTW), pp. 3–14.
PODS-2010-BenediktPV #higher-order #query: Positive higher-order queries (MB, GP, HV), pp. 27–38.
PODS-2010-DalviSS #algebra #probability #query: Computing query probability with incidence algebras (NND, KS, DS), pp. 203–214.
PODS-2010-DavidLM #query #xml: Certain answers for XML queries (CD, LL, FM), pp. 191–202.
PODS-2010-DeutchKM #fixpoint #markov #on the #probability #query: On probabilistic fixpoint and Markov chain query languages (DD, CK, TM), pp. 215–226.
PODS-2010-FaginKLRV #comprehension #database #query: Understanding queries in a search database system (RF, BK, YL, SR, SV), pp. 273–284.
PODS-2010-Koch #database #evaluation #incremental #query: Incremental query evaluation in a ring of databases (CK), pp. 87–98.
PODS-2010-LiHRMM #difference #linear #optimisation #privacy #query: Optimizing linear counting queries under differential privacy (CL, MH, VR, GM, AM), pp. 123–134.
PODS-2010-MeierSWL #optimisation #query #semantics: Semantic query optimization in the presence of types (MM, MS, FW, GL), pp. 111–122.
PODS-2010-Wijsen #database #first-order #nondeterminism #on the #query: On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases (JW), pp. 179–190.
SIGMOD-2010-AgrawalCCGKX #generative #query #web: Query portals: dynamically generating portals for entity-oriented web queries (SA, KC, SC, VG, ACK, DX), pp. 1171–1174.
SIGMOD-2010-ArmbrustTFFPLTT #named #performance #query: PIQL: a performance insightful query language (MA, ST, AF, MJF, DAP, NL, BT, JT), pp. 1207–1210.
SIGMOD-2010-BorkarCKKMSTW #framework #visual notation #xquery: Graphical XQuery in the aqualogic data services platform (VRB, MJC, SK, AK, KM, JS, ST, TW), pp. 1069–1080.
SIGMOD-2010-ChaudhuriLN #optimisation #query: Variance aware optimization of parameterized queries (SC, HL, VRN), pp. 531–542.
SIGMOD-2010-ChenMK #database #probability #query: GRN model of probabilistic databases: construction, transition and querying (RC, YM, IK), pp. 291–302.
SIGMOD-2010-CondieCAHGTES #online #pipes and filters #query: Online aggregation and continuous query support in MapReduce (TC, NC, PA, JMH, JG, JT, KE, RS), pp. 1115–1118.
SIGMOD-2010-CurtmolaDRS #community #online #privacy #query: Load-balanced query dissemination in privacy-aware online communities (EC, AD, KKR, DS), pp. 471–482.
SIGMOD-2010-JinBXCC #database #graph #named #query #towards #visual notation: GBLENDER: towards blending visual query formulation and query processing in graph databases (CJ, SSB, XX, JC, BC), pp. 111–122.
SIGMOD-2010-KarvounarakisIT #query: Querying data provenance (GK, ZGI, VT), pp. 951–962.
SIGMOD-2010-LianCS #consistency #database #probability #query: Consistent query answers in inconsistent probabilistic databases (XL, LC, SS), pp. 303–314.
SIGMOD-2010-MeyerDGM #optimisation #query: Optimizing schema-last tuple-store queries in graphd (SMM, JD, JG, BM), pp. 1047–1056.
SIGMOD-2010-MoonCZ #architecture #evolution #optimisation #query #scalability #transaction: Scalable architecture and query optimization fortransaction-time DBs with evolving schemas (HJM, CC, CZ), pp. 207–218.
SIGMOD-2010-MullerTA #compilation #named: Glacier: a query-to-hardware compiler (RM, JT, GA), pp. 1159–1162.
SIGMOD-2010-PerezAJ #evaluation #probability #query: Evaluation of probabilistic threshold queries in MCDB (LLP, SA, CMJ), pp. 687–698.
SIGMOD-2010-PoundIW #flexibility #keyword #query: Expressive and flexible access to web-extracted data: a keyword-based structured query language (JP, IFI, GEW), pp. 423–434.
SIGMOD-2010-QiJSP #nondeterminism #optimisation #query: Threshold query optimization for uncertain data (YQ, RJ, SS, SP), pp. 315–326.
SIGMOD-2010-RaghavanR #framework #generative #multi #named #query: ProgXe: progressive result generation framework for multi-criteria decision support queries (VR, EAR), pp. 1135–1138.
SIGMOD-2010-SarkasPT #query #web: Structured annotations of web queries (NS, SP, PT), pp. 771–782.
SIGMOD-2010-SternBB #approach #network #query: Processing continuous join queries in sensor networks: a filtering approach (MS, KB, EB), pp. 267–278.
SIGMOD-2010-VartakRR #assurance #generative #named #query: QRelX: generating meaningful queries that provide cardinality assurance (MV, VR, EAR), pp. 1215–1218.
SIGMOD-2010-Wei #graph #named #performance #query: TEDI: efficient shortest path query answering on graphs (FW0), pp. 99–110.
SIGMOD-2010-WuOT #multi #online #query: Continuous sampling for online aggregation over multiple queries (SW, BCO, KLT), pp. 651–662.
SIGMOD-2010-ZhouCC #named #prototype #query #type system: DoCQS: a prototype system for supporting data-oriented content query (MZ, TC, KCCC), pp. 1211–1214.
SIGMOD-2010-ZhouSTLLM #maintenance #network #performance #query: Efficient querying and maintenance of network provenance at internet-scale (WZ, MS, TT, XL, BTL, YM), pp. 615–626.
VLDB-2010-AbdessalemCD #lightweight #named #query #web: ObjectRunner: Lightweight, Targeted Extraction and Querying of Structured Web Data (TA, BC, ND), pp. 1585–1588.
VLDB-2010-AkdereCU #predict #query #streaming: Database-support for Continuous Prediction Queries over Streaming Data (MA, UÇ, EU), pp. 1291–1301.
VLDB-2010-BrunoNR #query #slicing: Slicing Long-Running Queries (NB, VRN, RR), pp. 530–541.
VLDB-2010-CaliGP #ontology #query: Advanced Processing for Ontological Queries (AC, GG, AP), pp. 554–565.
VLDB-2010-CanimKHM #database #query #relational: Building Disclosure Risk Aware Query Optimizers for Relational Databases (MC, MK, BH, SM), pp. 13–24.
VLDB-2010-DeutchMPY #evaluation #process #query: Optimal Top-K Query Evaluation for Weighted Business Processes (DD, TM, NP, TY), pp. 940–951.
VLDB-2010-FabbriLZ #named #query: PolicyReplay: Misconfiguration-Response Queries for Data Breach Reporting (DF, KL, QZ), pp. 36–47.
VLDB-2010-Haritsa #database #query #visualisation: The Picasso Database Query Optimizer Visualizer (JRH), pp. 1517–1520.
VLDB-2010-HerodotouB #named #query: Xplus: A SQL-Tuning-Aware Query Optimizer (HH, SB), pp. 1149–1160.
VLDB-2010-HerschelH #query: Explaining Missing Answers to SPJUA Queries (MH, MAH), pp. 185–196.
VLDB-2010-IoannouNNV #on the fly #query: On-the-Fly Entity-Aware Query Processing in the Presence of Linkage (EI, WN, CN, YV), pp. 429–438.
VLDB-2010-KazemitabarDAAS #query #sql #using: Geospatial Stream Query Processing using Microsoft SQL Server StreamInsight (SJK, UD, MHA, AA, CS), pp. 1537–1540.
VLDB-2010-LoCH #database #generative #query: Generating Databases for Query Workloads (EL, NC, WKH), pp. 848–859.
VLDB-2010-ManethN #optimisation #query #xpath: XPath Whole Query Optimization (SM, KN), pp. 882–893.
VLDB-2010-MozafariZZ #execution #query #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.
VLDB-2010-NeumannW #consistency #database #named #performance #query #rdf: x-RDF-3X: Fast Querying, High Update Rates, and Consistency for RDF Databases (TN, GW), pp. 256–263.
VLDB-2010-NykielPMKK #multi #named #pipes and filters #query: MRShare: Sharing Across Multiple Queries in MapReduce (TN, MP, CM, GK, NK), pp. 494–505.
VLDB-2010-PangDX #privacy #query: Embellishing Text Search Queries To Protect User Privacy (HP, XD, XX), pp. 598–607.
VLDB-2010-PestiLBIW #mobile #named #network #query #scalability: RoadTrack: Scaling Location Updates for Mobile Clients on Road Networks with Query Awareness (PP, LL, BB, AI, MW), pp. 1493–1504.
VLDB-2010-PramanikWML #query: Transforming Range Queries To Equivalent Box Queries To Optimize Page Access (SP, AW, CRM, AXL), pp. 409–416.
VLDB-2010-QinYC #keyword #parallel #query: Ten Thousand SQLs: Parallel Keyword Queries Computing (LQ, JXY, LC), pp. 58–69.
VLDB-2010-SenDG #database #evaluation #probability #query: Read-Once Functions and Query Evaluation in Probabilistic Databases (PS, AD, LG), pp. 1068–1079.
VLDB-2010-SharifzadehS #diagrams #named #nearest neighbour #performance #query: VoR-Tree: R-trees with Voronoi Diagrams for Efficient Processing of Spatial Nearest Neighbor Queries (MS, CS), pp. 1231–1242.
VLDB-2010-TzoumasDJ #clustering #correlation #query: Sharing-Aware Horizontal Partitioning for Exploiting Correlations During Query Processing (KT, AD, CSJ), pp. 542–553.
VLDB-2010-VlachouDNK #identification #query: Identifying the Most Influential Data Objects with Reverse Top-k Queries (AV, CD, KN, YK), pp. 364–372.
VLDB-2010-VoCO #query #towards #transaction: Towards Elastic Transactional Cloud Storage with Range Query Support (HTV, CC, BCO), pp. 506–517.
VLDB-2010-WangFGH #information management #probability #query: Querying Probabilistic Information Extraction (DZW, MJF, MNG, JMH), pp. 1057–1067.
VLDB-2010-WuBMPS #query: Processing Top-k Join Queries (MW, LBE, AM, CMP, DS), pp. 860–870.
VLDB-2010-ZhaoH #graph #network #on the #optimisation #query #scalability: On Graph Query Optimization in Large Networks (PZ, JH), pp. 340–351.
VLDB-2010-ZouWSHAGW #distributed #query #relational: From a Stream of Relational Queries to Distributed Stream Processing (QZ, HW, RS, MH, HA, BG, KLW), pp. 1394–1405.
VLDB-2011-MeliouGMS #complexity #query: The Complexity of Causality and Responsibility for Query Answers and non-Answers (AM, WG, KFM, DS), pp. 34–45.
VLDB-2011-OroRS10 #documentation #named #query #towards #web #xpath: SXPath — Extending XPath towards Spatial Querying on Web Documents (EO, MR, SS), pp. 129–140.
VLDB-2011-RiceT10 #graph #network #query #strict: Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions (MNR, VJT), pp. 69–80.
VLDB-2011-Rocha-JuniorVDN10 #performance #query: Efficient Processing of Top-k Spatial Preference Queries (JBRJ, AV, CD, KN), pp. 93–104.
VLDB-2011-SagyKSS10 #difference #distributed #query #representation: Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation (GS, DK, IS, AS), pp. 46–57.
STOC-2010-Marx #constraints #query: Tractable hypergraph properties for constraint satisfaction and conjunctive queries (DM), pp. 735–744.
CIAA-2010-TirnaucaT #automaton #identification #query: Types of Trusted Information That Make DFA Identification with Correction Queries Feasible (CT, CIT), pp. 272–281.
SEFM-2010-KatzK #query #refinement #specification: User Queries for Specification Refinement Treating Shared Aspect Join Points (EK, SK), pp. 73–82.
CHI-2010-ChoKJSS #distance #interface #proximity #query: 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.
CHI-2010-KellyCDNG #information management #quality #query: Effects of popularity and quality on the usage of query suggestions during information search (DK, AC, MD, XN, KG), pp. 45–54.
CAiSE-2010-StecherCNN #integration #query #ranking: Query Ranking in Information Integration (RS, SC, CN, WN), pp. 230–235.
ICEIS-DISI-2010-LemosCV #query #relational #sql #using #xml: Using SQL/XML for Efficiently Translating Queries over XML View of Relational Data (FCL, CC, VMPV), pp. 269–274.
ICEIS-DISI-2010-PanZH #library #open source #query #retrieval #using: An Open Source Software based Library Catalogue System using Soundexing Retrieval and Query Caching (ZP, YZ, JH), pp. 182–189.
ICEIS-ISAS-2010-ClariziaGN #identification #query #web: A New Technique for Identification of Relevant Web Pages in Informational Queries Results (FC, LG, PN), pp. 70–79.
ICEIS-J-2010-BorovskiyKZ10a #api #data access #enterprise #query: Business Object Query Language as Data Access API in ERP Systems (VB, WK, AZ), pp. 135–148.
CIKM-2010-BenderskyCS #feedback #pseudo #query #using: Structural annotation of search queries using pseudo-relevance feedback (MB, WBC, DAS), pp. 1537–1540.
CIKM-2010-CaiP #graph #named #query #reachability #scalability: Path-hop: efficiently indexing large graphs for reachability queries (JC, CKP), pp. 119–128.
CIKM-2010-CarmanCHB #modelling #personalisation #query #topic #towards #using: Towards query log based personalization using topic models (MJC, FC, MH, MB), pp. 1849–1852.
CIKM-2010-CartrightALM #approximate #modelling #performance #query #using: Fast query expansion using approximations of relevance models (MAC, JA, VL, AM), pp. 1573–1576.
CIKM-2010-ChenLZY #energy #network #query: Energy-efficient top-k query processing in wireless sensor networks (BC, WL, RZ, JXY), pp. 329–338.
CIKM-2010-ChongQSBNZ #evaluation #query #rdf #streaming: Open user schema guided evaluation of streaming RDF queries (ZC, GQ, HS, JB, WN, AZ), pp. 1281–1284.
CIKM-2010-ChrysakisCP #algorithm #evaluation #network #peer-to-peer #query #using: Evaluation of top-k queries in peer-to-peer networks using threshold algorithms (IC, CC, DP), pp. 1305–1308.
CIKM-2010-DeyJ #approach #database #graph #query #reachability #scalability: A hierarchical approach to reachability query answering in very large graph databases (SKD, HMJ), pp. 1377–1380.
CIKM-2010-GaoYW #mining #multi #named #query: SEQUEL: query completion via pattern mining on multi-column structural data (CG, QY, JW), pp. 1955–1956.
CIKM-2010-Garcia-AlvaradoCO #query #recommendation: OLAP-based query recommendation (CGA, ZC, CO), pp. 1353–1356.
CIKM-2010-GuoCXS #approach #query #recommendation #social: A structured approach to query recommendation with social annotation data (JG, XC, GX, HS), pp. 619–628.
CIKM-2010-GuptaGNM #query #using: Efficiently querying archived data using Hadoop (RG, HG, UN, MKM), pp. 1301–1304.
CIKM-2010-HauffKA #comparison #performance #predict #query: A comparison of user and system query performance predictions (CH, DK, LA), pp. 979–988.
CIKM-2010-HouleOQ #query #similarity: Active caching for similarity queries based on shared-neighbor information (MEH, VO, UQ), pp. 669–678.
CIKM-2010-HuangSN #graph #query #refinement #using #word: Query model refinement using word graphs (YH, LS, JYN), pp. 1453–1456.
CIKM-2010-JainM #query #web: Organizing query completions for web search (AJ, GM), pp. 1169–1178.
CIKM-2010-KaluarachchiVBWPF #evolution #query #retrieval: Incorporating terminology evolution for query translation in text retrieval with association rules (ACK, ASV, SJB, GW, JP, AF), pp. 1789–1792.
CIKM-2010-KashyapHP #named #query: FACeTOR: cost-driven exploration of faceted query results (AK, VH, MP), pp. 719–728.
CIKM-2010-KhalefaML #nondeterminism #query: Skyline query processing for uncertain data (MEK, MFM, JJL), pp. 1293–1296.
CIKM-2010-KotovKDC #profiling #query #ranking #web: Temporal query log profiling to improve web search ranking (AK, PK, LD, YC), pp. 1149–1158.
CIKM-2010-LevandoskiMK #evaluation #query: Preference query evaluation over expensive attributes (JJL, MFM, MEK), pp. 319–328.
CIKM-2010-LiH #integration #ontology #optimisation #query: Query optimization for ontology-based information integration (YL, JH), pp. 1369–1372.
CIKM-2010-LiLY #named #query #semantics #using: EntityEngine: answering entity-relationship queries using shallow semantics (XL, CL, CY), pp. 1925–1926.
CIKM-2010-LinYC #probability #query: Selective data acquisition for probabilistic K-NN query (YCL, DNY, MSC), pp. 1357–1360.
CIKM-2010-ParkSYRY #network #performance #query: An efficient data-centric storage scheme considering storage and query hot-spots in sensor networks (YP, DS, JY, CTR, JY), pp. 1325–1328.
CIKM-2010-PobleteBMB #graph #image #query #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.
CIKM-2010-XueHC #query #set #using: Improving verbose queries using subset distribution (XX, SH, WBC), pp. 1059–1068.
CIKM-2010-YanLRRD #named #wiki: Facetedpedia: enabling query-dependent faceted search for wikipedia (NY, CL, SBR, RR, GD), pp. 1927–1928.
ECIR-2010-ArampatzisK #empirical #query: An Empirical Study of Query Specificity (AA, JK), pp. 594–597.
ECIR-2010-BalogBR #modelling #query: Category-Based Query Modeling for Entity Search (KB, MB, MdR), pp. 319–331.
ECIR-2010-Collins-ThompsonB #classification #performance #predict #query: Predicting Query Performance via Classification (KCT, PNB), pp. 140–152.
ECIR-2010-CoxZFH #approximate #correctness #query #using: Improving Query Correctness Using Centralized Probably Approximately Correct (PAC) Search (IJC, JZ, RF, LKH), pp. 265–280.
ECIR-2010-GoharianFYM #peer-to-peer #query #using: Enriching Peer-to-Peer File Descriptors Using Association Rules on Query Logs (NG, OF, WGY, JM), pp. 636–639.
ECIR-2010-GottronL #comparison #identification: A Comparison of Language Identification Approaches on Short, Query-Style Texts (TG, NL), pp. 611–614.
ECIR-2010-HauffAHJ #effectiveness #evaluation #performance #predict #query: Query Performance Prediction: Evaluation Contrasted with Effectiveness (CH, LA, DH, FdJ), pp. 204–216.
ECIR-2010-KellyJ #independence #query #retrieval: Biometric Response as a Source of Query Independent Scoring in Lifelog Retrieval (LK, GJFJ), pp. 520–531.
ECIR-2010-MendozaMFP #learning #query #web: Learning to Distribute Queries into Web Search Nodes (MM, MM, FF, BP), pp. 281–292.
ECIR-2010-PascaARMH #query #web: The Role of Query Sessions in Extracting Instance Attributes from Web Search Queries (MP, EA, ERA, RMB, KBH), pp. 62–74.
ECIR-2010-RudinacLH #consistency #query #retrieval: Exploiting Result Consistency to Select Query Expansions for Spoken Content Retrieval (SR, ML, AH), pp. 645–648.
ECIR-2010-SahibTR #elicitation #interactive #query: Enabling Interactive Query Expansion through Eliciting the Potential Effect of Expansion Terms (NGS, AT, IR), pp. 532–543.
ECIR-2010-SantosPMO: Explicit Search Result Diversification through Sub-queries (RLTS, JP, CM, IO), pp. 87–99.
ECIR-2010-SaralegiL #query #web: Estimating Translation Probabilities from the Web for Structured Queries on CLIR (XS, MLdL), pp. 586–589.
ECIR-2010-XingZH #image #predict #query #retrieval: Query Difficulty Prediction for Contextual Image Retrieval (XX, YZ, MH), pp. 581–585.
ECIR-2010-ZhengF #information retrieval #query: Query Aspect Based Term Weighting Regularization in Information Retrieval (WZ, HF), pp. 344–356.
ICPR-2010-HarmanciH #adaptation #image #query: Content Adaptive Hash Lookups for Near-Duplicate Image Search by Full or Partial Image Queries (OH, IH), pp. 1582–1585.
KDD-2010-LaoC #execution #modelling #performance #query #random #retrieval: Fast query execution for retrieval models based on path-constrained random walks (NL, WWC), pp. 881–888.
KDD-2010-MaserratP #network #query #social: Neighbor query friendly compression of social networks (HM, JP), pp. 533–542.
KDIR-2010-AsfariDBS #query #web: A Context-based Model for Web Query Reformulation (OA, BLD, YB, JPS), pp. 288–293.
KDIR-2010-CamposFHM #approach #feedback #query: A Content-Bsed Approach to Relevance Feedback in XML-IR for Content and Structure Queries (LMdC, JMFL, JFH, CJMD), pp. 418–427.
KDIR-2010-Codina-FilbaN #analysis #behaviour #internet #query #web: Collective Behaviour in Internet — Tendency Analysis of the Frequency of User Web Queries (JCF, DFN), pp. 168–175.
KDIR-2010-JedrzejczakW #generative #query #using: Integrated Candidate Generation in Processing Batches of Frequent Itemset Queries using Apriori (PJ, MW), pp. 487–490.
KDIR-2010-KleizaKT #approach #documentation #identification #query #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.
KDIR-2010-SharmaV #enterprise #query #wiki: Query Processing for Enterprise Search with Wikipedia Link Structure (NS, VV), pp. 243–248.
KDIR-2010-SinghMG #feedback #query #realtime: Dynamic Query Expansion based on User’s Real Time Implicit Feedback (SRS, HAM, TAG), pp. 112–121.
KR-2010-BaaderBLW #logic #query: Query and Predicate Emptiness in Description Logics (FB, MB, CL, FW).
KR-2010-GlimmR #decidability #query: Status QIO: Conjunctive Query Entailment Is Decidable (BG, SR).
KR-2010-KontchakovLTWZ #approach #query: The Combined Approach to Query Answering in DL-Lite (RK, CL, DT, FW, MZ).
KR-2010-RosatiA #ontology #query: Improving Query Answering over DL-Lite Ontologies (RR, AA).
RecSys-2010-Baeza-Yates #predict #query #recommendation: Query intent prediction and recommendation (RABY), pp. 5–6.
SIGIR-2010-BalasubramanianKC #query #reduction #web: Exploring reductions for long web queries (NB, GK, VRC), pp. 571–578.
SIGIR-2010-BalasubramanianKC10a #performance #predict #query #web: Predicting query performance on the web (NB, GK, VRC), pp. 785–786.
SIGIR-2010-BordinoCDG #graph #query #similarity: Query similarity by projecting the query-flow graph (IB, CC, DD, AG), pp. 515–522.
SIGIR-2010-CambazogluVKAB #distributed #query: Query forwarding in geographically distributed search engines (BBC, EV, EK, CA, RABY), pp. 90–97.
SIGIR-2010-CarmelY #information retrieval #query: Estimating the query difficulty for information retrieval (DC, EYT), p. 911.
SIGIR-2010-ChenYLZQ #classification #personalisation #predict #query #question: Predicting query potential for personalization, classification or regression? (CC, MY, SL, TZ, HQ), pp. 725–726.
SIGIR-2010-DangBC #learning #query #rank: Learning to rank query reformulations (VD, MB, WBC), pp. 807–808.
SIGIR-2010-DuZYCC #query #recognition #using: Using search session context for named entity recognition in query (JD, ZZ, JY, YC, ZC), pp. 765–766.
SIGIR-2010-FengCCZL #multi #query #video #web: Multi-modal query expansion for web video search (BF, JC, ZC, YZ, SL), pp. 721–722.
SIGIR-2010-FilaliNL #ambiguity #query #transitive: Transitive history-based query disambiguation for query reformulation (KF, AN, CL), pp. 849–850.
SIGIR-2010-GoharianM #classification #query #using: Context aware query classification using dynamic query window and relationship net (NG, SSRM), pp. 723–724.
SIGIR-2010-HagenPSB #power of #query #segmentation: The power of naive query segmentation (MH, MP, BS, CB), pp. 797–798.
SIGIR-2010-HauffJKA #predict #quality #query: Query quality: user ratings and system predictions (CH, FdJ, DK, LA), pp. 743–744.
SIGIR-2010-HerdagdelenCMHHRA #modelling #query #semantics: Generalized syntactic and semantic models of query reformulation (AH, MC, DM, MH, KBH, SR, EA), pp. 283–290.
SIGIR-2010-HustonC #query: Evaluating verbose query processing techniques (SH, WBC), pp. 291–298.
SIGIR-2010-LevelingJ #query: Query recovery of short user queries: on query expansion with stopwords (JL, GJFJ), pp. 733–734.
SIGIR-2010-MeijR #modelling #query #using #wiki: Supervised query modeling using wikipedia (EM, MdR), pp. 875–876.
SIGIR-2010-PandeyPFJ #query: Estimating advertisability of tail queries for sponsored search (SP, KP, MF, VJ), pp. 563–570.
SIGIR-2010-ParkC #dependence #parsing #query #ranking: Query term ranking based on dependency parsing of verbose queries (JHP, WBC), pp. 829–830.
SIGIR-2010-RudinacLH #concept #query #retrieval #visual notation: Visual concept-based selection of query expansions for spoken content retrieval (SR, ML, AH), pp. 891–892.
SIGIR-2010-ShtokKC #modelling #predict #statistics #using: Using statistical decision theory and relevance models for query-performance prediction (AS, OK, DC), pp. 259–266.
SIGIR-2010-TorresHS #analysis #information retrieval #query: Query log analysis in the context of information retrieval for children (SDT, DH, PS), pp. 847–848.
SIGIR-2010-WangH #distance #effectiveness #metric #query #similarity: Effective query expansion with the resistance distance based term similarity metric (SW, MH), pp. 715–716.
SIGIR-2010-WangLC #bound #detection #query: Intent boundary detection in search query logs (CJW, KHYL, HHC), pp. 749–750.
SIGIR-2010-WhiteH10a #predict #query #web: Predicting escalations of medical queries based on web page structure and content (RWW, EH), pp. 769–770.
MoDELS-v1-2010-BergmannHRVBBO #emf #evaluation #incremental #modelling #query: Incremental Evaluation of Model Queries over EMF Models (GB, ÁH, IR, DV, AB, ZB, AÖ), pp. 76–90.
GPCE-J-2007-GilL10 #c++ #query #sql: Simple and safe SQL queries with C++ templates (JYG, KL), pp. 573–595.
PPDP-2010-TekleGL #datalog #graph #optimisation #query: Graph queries through datalog optimizations (KTT, MG, YAL), pp. 25–34.
PPDP-2010-TekleL #analysis #complexity #datalog #performance #precise #query: Precise complexity analysis for efficient datalog queries (KTT, YAL), pp. 35–44.
PADL-2010-GomesAS #hybrid #implementation #knowledge base #query: Implementing Query Answering for Hybrid MKNF Knowledge Bases (ASG, JJA, TS), pp. 25–39.
SAC-2010-BelohlavekV10a #database #logic #query #similarity: Query systems in similarity-based databases: logical foundations, expressive power, and completeness (RB, VV), pp. 1648–1655.
SAC-2010-BenaouichaTB #flexibility #probability #query: Flexible document-query matching based on a probabilistic content and structure score combination (MB, MT, MB), pp. 1728–1734.
SAC-2010-BraynerCS #approach #detection #energy #network #quality #query #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.
SAC-2010-CalvaneseKNRS #database #ontology #query #visual notation: Web-based graphical querying of databases through an ontology: the Wonder system (DC, CMK, WN, MRM, GS), pp. 1388–1395.
SAC-2010-Chen #algorithm #query: A time optimal algorithm for evaluating tree pattern queries (YC), pp. 1638–1642.
SAC-2010-DomanPD #fuzzy #network #query: Leveraging fuzzy query processing to support applications in wireless sensor networks (MD, JP, TD), pp. 764–771.
SAC-2010-ElliottMCOO #database #interface #network #query: Advanced querying interface for biochemical network databases (BE, SM, AC, GÖ, ZMÖ), pp. 1526–1533.
SAC-2010-JungCCL #on the #query: On processing location based top-k queries in the wireless broadcasting system (HJ, BKC, YDC, LL), pp. 585–591.
SAC-2010-LamprierASL10a #approach #clustering #multi #query: Query-oriented clustering: a multi-objective approach (SL, TA, FS, BL), pp. 1789–1795.
FSE-2010-KimGLR #logic #named #query #re-engineering #refactoring: Ref-Finder: a refactoring reconstruction tool based on logic query templates (MK, MG, AL, NR), pp. 371–372.
ICSE-2010-GenevesL #source code #xquery: Eliminating dead-code from XQuery programs (PG, NL), pp. 305–306.
ICSE-2010-WurschGRG #developer #natural language #query: Supporting developers with natural language queries (MW, GG, GR, HG), pp. 165–174.
CC-2010-IuCZ #database #imperative #named #query: JReq: Database Queries in Imperative Languages (MYI, EC, WZ), pp. 84–103.
HPDC-2010-GehaniKM #distributed #performance #query: Efficient querying of distributed provenance stores (AG, MK, TM), pp. 613–621.
HPDC-2010-PanBM #multi #pipes and filters #query: Parallelizing multiple group-by query in share-nothing environment: a MapReduce study case (JP, YLB, FM), pp. 856–863.
CSL-2010-BaganDFG #performance #query: Efficient Enumeration for Conjunctive Queries over X-underbar Structures (GB, AD, EF, OG), pp. 80–94.
ICLP-J-2010-AlvianoFL #decidability #effectiveness #query: Disjunctive ASP with functions: Decidable queries and effective computation (MA, WF, NL), pp. 497–512.
LICS-2010-BaranyGO #query: Querying the Guarded Fragment (VB, GG, MO), pp. 1–10.
LICS-2010-CaliGLMP #datalog #information management #logic #product line #query #representation: Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications (AC, GG, TL, BM, AP), pp. 228–242.
CASE-2009-VeilumuthuR #clustering #query: Intent based clustering of search engine query log (AV, PR), pp. 647–652.
DocEng-2009-BarcenasGL #analysis #constraints #on the #query: On the analysis of queries with counting constraints (EB, PG, NL), pp. 21–24.
ICDAR-2009-Rodriguez-SerranoP #image #query #retrieval #word: Handwritten Word Image Retrieval with Synthesized Typed Queries (JARS, FP), pp. 351–355.
PODS-2009-AbiteboulBM #documentation #query #satisfiability: Satisfiability and relevance for queries over active documents (SA, PB, BM), pp. 87–96.
PODS-2009-BarceloLPS #modelling #query #xml: XML with incomplete information: models, properties, and query answering (PB, LL, AP, CS), pp. 237–246.
PODS-2009-CaliGL #framework #ontology #query: A general datalog-based framework for tractable query answering over ontologies (AC, GG, TL), pp. 77–86.
PODS-2009-ChirkovaG #dependence #embedded #equivalence #query #sql: Equivalence of SQL queries in presence of embedded dependencies (RC, MRG), pp. 217–226.
PODS-2009-DeHaan #equivalence #query #semantics: Equivalence of nested queries with mixed semantics (DD), pp. 207–216.
PODS-2009-GottlobLV #bound #query: Size and treewidth bounds for conjunctive queries (GG, STL, GV), pp. 45–54.
PODS-2009-LiD #database #probability #query: Consensus answers for queries over probabilistic databases (JL, AD), pp. 259–268.
PODS-2009-RastogiHMS #privacy #query: Relationship privacy: output perturbation for queries with joins (VR, MH, GM, DS), pp. 107–116.
PODS-2009-Yi #bound #query: Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes (KY), pp. 187–196.
SIGMOD-2009-BrodskyBCEW #abstraction #database #programming #query: A decisions query language (DQL): high-level abstraction for mathematical programming over databases (AB, MMB, MC, NEE, XSW), pp. 1059–1062.
SIGMOD-2009-BrunoCR #interactive #optimisation #query: Interactive plan hints for query optimization (NB, SC, RR), pp. 1043–1046.
SIGMOD-2009-Chaudhuri #contract #query #question: Query optimizers: time to rethink the contract? (SC), pp. 961–968.
SIGMOD-2009-ChuBCDN #ad hoc #database #keyword #query: Combining keyword search and forms for ad hoc querying of databases (EC, AB, XC, AD, JFN), pp. 349–360.
SIGMOD-2009-ElmonguiNR #framework #query #testing: A framework for testing query transformation rules (HGE, VRN, RR), pp. 257–268.
SIGMOD-2009-GaoZ #database #nearest neighbour #query: Continuous obstructed nearest neighbor queries in spatial databases (YG, BZ), pp. 577–590.
SIGMOD-2009-GeZM #nondeterminism #query: Top-k queries on uncertain data: on score distribution and typical answers (TG, SBZ, SM), pp. 375–388.
SIGMOD-2009-GhazalSBCKG #generative #query: Dynamic plan generation for parameterized queries (AG, DYS, RB, AC, MK, VG), pp. 909–916.
SIGMOD-2009-HanL #manycore #optimisation #order #query: Dependency-aware reordering for parallelizing query optimization in multi-core CPUs (WSH, JL), pp. 45–58.
SIGMOD-2009-JiangYCC #ad hoc #detection #named #query: AIDE: ad-hoc intents detection engine over query logs (YJ, HTY, KCCC, YSC), pp. 1091–1094.
SIGMOD-2009-JinXRF #named #query #reachability: 3-HOP: a high-compression indexing scheme for reachability query (RJ, YX, NR, DF), pp. 813–826.
SIGMOD-2009-KaderBMK #named #optimisation #runtime: ROX: run-time optimization of XQueries (RAK, PAB, SM, MvK), pp. 615–626.
SIGMOD-2009-KimC #documentation #named #performance #query #retrieval: Skip-and-prune: cosine-based top-k query processing for efficient context-sensitive document retrieval (JWK, KSC), pp. 115–126.
SIGMOD-2009-KimelfeldSW #documentation #named #query #xml: ExQueX: exploring and querying XML documents (BK, YS, GW), pp. 1103–1106.
SIGMOD-2009-McSherry #data analysis #framework #privacy #query: Privacy integrated queries: an extensible platform for privacy-preserving data analysis (FM), pp. 19–30.
SIGMOD-2009-MeiM #adaptation #cost analysis #detection #named #query: ZStream: a cost-based query processor for adaptively detecting composite events (YM, SM), pp. 193–206.
SIGMOD-2009-MoonCHZ #evolution #named #query: PRIMA: archiving and querying historical data with evolving schemas (HJM, CC, MH, CZ), pp. 1019–1022.
SIGMOD-2009-Neumann #optimisation #query: Query simplification: graceful degradation for join-order optimization (TN0), pp. 403–414.
SIGMOD-2009-NicaBH #query #visualisation: Extreme visualisation of query optimizer search space (AN, DSB, DWH), pp. 1067–1070.
SIGMOD-2009-OlteanuH #query: Secondary-storage confidence computation for conjunctive queries with inequalities (DO, JH), pp. 389–402.
SIGMOD-2009-PaparizosNSA #data flow #query #using #web: Answering web queries using structured data sources (SP, AN, JCS, RA), pp. 1127–1130.
SIGMOD-2009-TranCP #query: Query by output (QTT, CYC, SP), pp. 535–548.
SIGMOD-2009-TsirogiannisHSWG #query: Query processing techniques for solid state drives (DT, SH, MAS, JLW, GG), pp. 59–72.
SIGMOD-2009-WaasH #query: Parallelizing extensible query optimizers (FMW, JMH), pp. 871–878.
VLDB-2009-BamfordBBFFGKKMNZ #xquery: XQuery Reloaded (RB, VRB, MB, PMF, DF, DAG, DK, TK, DM, SN, MZ), pp. 1342–1353.
VLDB-2009-BeskalesSIB #detection #modelling #query: Modeling and Querying Possible Repairs in Duplicate Detection (GB, MAS, IFI, SBD), pp. 598–609.
VLDB-2009-CateCKT #query #sql: Laconic Schema Mappings: Computing the Core with SQL Queries (BtC, LC, PGK, WCT), pp. 1006–1017.
VLDB-2009-CautisDOV #performance #query #set #specification #using #xpath: Efficient Rewriting of XPath Queries Using Query Set Specifications (BC, AD, NO, VV), pp. 301–312.
VLDB-2009-ChandramouliGM #detection #on the fly #query: On-the-fly Progress Detection in Iterative Stream Queries (BC, JG, DM), pp. 241–252.
VLDB-2009-ChaudhuriD #database #keyword #query #ranking: Keyword querying and Ranking in Databases (SC, GD), pp. 1658–1659.
VLDB-2009-ChaudhuriNR #optimisation #query #testing: Exact Cardinality Query Optimization for Optimizer Testing (SC, VRN, RR), pp. 994–1005.
VLDB-2009-GuptaS #query #web: Answering Table Augmentation Queries from Unstructured Lists on the Web (RG, SS), pp. 289–300.
VLDB-2009-HassanzadehXMKLW #query: Linkage Query Writer (OH, RX, RJM, AK, LL, MW), pp. 1590–1593.
VLDB-2009-KabischDYL #approach #integration #interface #query #web: A Hierarchical Approach to Model Web Query Interfaces for Web Source Integration (TK, ECD, CTY, UL), pp. 325–336.
VLDB-2009-LiuLGF #approximate #network #query: Enabling epsilon-Approximate Querying in Sensor Networks (YL, JL, HG, XF), pp. 169–180.
VLDB-2009-MullerTA #compilation #query: Streams on Wires — A Query Compiler for FPGAs (RM, JT, GA), pp. 229–240.
VLDB-2009-NehmeWRB #multi #query: Query Mesh: Multi-Route Query Processing Technology (RVN, KW, EAR, EB), pp. 1530–1533.
VLDB-2009-SarkasBDK #keyword: Measure-driven Keyword-Query Expansion (NS, NB, GD, NK), pp. 121–132.
VLDB-2009-UMM #algorithm #multi #query: A Fair Assignment Algorithm for Multiple Preference Queries (LHU, NM, KM), pp. 1054–1065.
VLDB-2009-VigfussonSCF #adaptation #distributed #query: Adaptively Parallelizing Distributed Range Queries (YV, AS, BFC, RF), pp. 682–693.
VLDB-2009-ZhangACIMPS #query #xml: Binary XML Storage and Query Processing in Oracle 11g (NZ, NA, SC, SI, VM, SP, BS), pp. 1354–1365.
VLDB-2009-ZhangCJOZ #effectiveness #nondeterminism #predict #query: Effectively Indexing Uncertain Moving Objects for Predictive Queries (MZ, SC, CSJ, BCO, ZZ), pp. 1198–1209.
VLDB-2009-ZhouSA #query #scalability: Scalable Delivery of Stream Query Results (YZ, AS, KA), pp. 49–60.
VLDB-2009-ZouCO #database #graph #named #query #scalability: DistanceJoin: Pattern Match Query In a Large Graph Database (LZ, LC, MTÖ), pp. 886–897.
FASE-2009-ChatterjeeJS #java #named #query #using: SNIFF: A Search Engine for Java Using Free-Form Queries (SC, SJ, KS), pp. 385–400.
FASE-2009-RajamaniJPR #mobile #network #nondeterminism #query: Inquiry and Introspection for Non-deterministic Queries in Mobile Networks (VR, CJ, JP, GCR), pp. 401–416.
STOC-2009-CleveGMSY #algorithm #performance #quantum #query #simulation: Efficient discrete-time simulations of continuous-time quantum query algorithms (RC, DG, MM, RDS, DLYM), pp. 409–416.
STOC-2009-Efremenko: 3-query locally decodable codes of subexponential length (KE), pp. 39–44.
STOC-2009-ImpagliazzoKW: New direct-product testers and 2-query PCPs (RI, VK, AW), pp. 131–140.
CIAA-2009-FreivaldsI #permutation #quantum #query: Quantum Queries on Permutations with a Promise (RF, KI), pp. 208–216.
CIAA-2009-InabaH #query #representation #set: Compact Representation for Answer Sets of n-ary Regular Queries (KI, HH), pp. 94–104.
ICALP-v1-2009-DemaineLW #on the #query: On Cartesian Trees and Range Minimum Queries (EDD, GML, OW), pp. 341–353.
LATA-2009-GauwinNT #bound #concurrent #query: Bounded Delay and Concurrency for Earliest Query Answering (OG, JN, ST), pp. 350–361.
ICFP-2009-GenevesLQ #evolution #identification #query #xml: Identifying query incompatibilities with evolving XML schemas (PG, NL, VQ), pp. 221–230.
CAiSE-2009-HornungML #algebra #process #query #workflow: Process Algebra-Based Query Workflows (TH, WM, GL), pp. 440–454.
ICEIS-DISI-2009-BergerS #architecture #case study #implementation #named #query: FedDW: A Tool for Querying Federations of Data Warehouses — Architecture, Use Case and Implementation (SB, MS), pp. 113–122.
ICEIS-DISI-2009-ElarissKG #multi #optimisation #paradigm #query: Query Melting — A New Paradigm for GIS Multiple Query Optimization (HEE, SK, DG), pp. 82–90.
ICEIS-DISI-2009-GorawskiD #algorithm #distributed #execution #performance #query: Algorithms for Efficient Top-K Spatial Preference Query Execution in a Heterogeneous Distributed Environment (MG, KD), pp. 43–48.
ICEIS-DISI-2009-KudagbaBB #query #semantics #xml: An User-centric and Semantic-driven Query Rewriting over Proteomics XML Sources (KK, OEB, HB), pp. 123–130.
ICEIS-DISI-2009-Perez-CebrerosMC #algorithm #parallel #query #scheduling: PSO-based Resource Scheduling Algorithm for Parallel Query Processing on Grids (APC, GML, NCC), pp. 131–137.
ICEIS-DISI-2009-SantosB #optimisation #performance #query: A Bit-selector Technique for Performance Optimization of Decision-support Queries (RJS, JB), pp. 151–157.
ICEIS-J-2009-AliPTD #data flow #distributed #framework #named #semistructured data #xquery: DeXIN: An Extensible Framework for Distributed XQuery over Heterogeneous Data Sources (MIA, RP, HLT, SD), pp. 172–183.
ICEIS-J-2009-CastellaniKRWG #maintenance #query: Creation and Maintenance of Query Expansion Rules (SC, ANK, FR, JW, AG), pp. 819–830.
ICEIS-J-2009-ChoB #query #retrieval #xml: Relaxing XML Preference Queries for Cooperative Retrieval (SC, WTB), pp. 160–171.
ICEIS-J-2009-Cuzzocrea #approximate #evaluation #named #probability #query #reduction #scalability: s-OLAP: Approximate OLAP Query Evaluation on Very Large Data Warehouses via Dimensionality Reduction and Probabilistic Synopses (AC), pp. 248–262.
ICEIS-J-2009-QuimbayaRAV #knowledge base #query #scalability: Knowledge Based Query Processing in Large Scale Virtual Organizations (APQ, CR, JA, MDPV), pp. 208–219.
CIKM-2009-AltingovdeOU #query #web: Exploiting query views for static index pruning in web search engines (ISA, RO, ÖU), pp. 1951–1954.
CIKM-2009-AnastasakosHKR #approach #collaboration #graph #recommendation #using: A collaborative filtering approach to ad recommendation using the query-ad click graph (TA, DH, SK, HR), pp. 1927–1930.
CIKM-2009-BalasubramanianC #automation #generative #modelling #topic #using: Automatic generation of topic pages using query-based aspect models (NB, SC), pp. 2049–2052.
CIKM-2009-BaragliaCDNPS #graph #query: Aging effects on query flow graphs for query suggestion (RB, CC, DD, FMN, RP, FS), pp. 1947–1950.
CIKM-2009-BohmFOPW #probability #query: Probabilistic skyline queries (CB, FF, AO, CP, BW), pp. 651–660.
CIKM-2009-CaoQCS #feedback #query: Exploring path query results through relevance feedback (HC, YQ, KSC, MLS), pp. 1959–1962.
CIKM-2009-CaoSXHYC #classification #named #personalisation #query: PQC: personalized query classification (BC, JTS, EWX, DHH, QY, ZC), pp. 1217–1226.
CIKM-2009-CetintasSY #learning #query: Learning from past queries for resource selection (SC, LS, HY), pp. 1867–1870.
CIKM-2009-ChengKN #graph #performance #query #scalability: Efficient processing of group-oriented connection queries in a large graph (JC, YK, WN), pp. 1481–1484.
CIKM-2009-ChenLY #evaluation #maintenance #network #query: Progressive skyline query evaluation and maintenance in wireless sensor networks (BC, WL, JXY), pp. 1445–1448.
CIKM-2009-ChuiLKH #query #ranking #sequence: Supporting ranking pattern-based aggregate queries in sequence data cubes (CKC, EL, BK, WSH), pp. 997–1006.
CIKM-2009-Collins-Thompson #optimisation #query #robust: Reducing the risk of query expansion via robust constrained optimization (KCT), pp. 837–846.
CIKM-2009-DasdanDKD #automation #interface #query #retrieval #using: Automatic retrieval of similar content using search engine query interface (AD, PD, SK, CD), pp. 701–710.
CIKM-2009-DoulkeridisVNKV #distributed #multi #performance #query: Multidimensional routing indices for efficient distributed query processing (CD, AV, KN, YK, MV), pp. 1489–1492.
CIKM-2009-DriesNR #network #query: A query language for analyzing networks (AD, SN, LDR), pp. 485–494.
CIKM-2009-ElbassuoniRSSW #query #ranking: Language-model-based ranking for queries on RDF-graphs (SE, MR, RS, MS, GW), pp. 977–986.
CIKM-2009-GuoR #interactive #mining #query: Mining linguistic cues for query expansion: applications to drug interaction search (SG, NR), pp. 335–344.
CIKM-2009-GuYGC #data type #probability #query: Probabilistic moving range query over RFID spatio-temporal data streams (YG, GY, NG, YC), pp. 1413–1416.
CIKM-2009-HaghaniMA #data type #query #semistructured data: Evaluating top-k queries over incomplete data streams (PH, SM, KA), pp. 877–886.
CIKM-2009-HeZSC #clustering #data type #multi #query #rank: Cluster based rank query over multidimensional data streams (DH, YZ, LS, GC), pp. 1493–1496.
CIKM-2009-HongHVAA #effectiveness #query: Effective anonymization of query logs (YH, XH, JV, NRA, VA), pp. 1465–1468.
CIKM-2009-HuangE #query #web: Analyzing and evaluating query reformulation strategies in web search logs (JH, ENE), pp. 77–86.
CIKM-2009-KatoOOT #query #relational #using #web: Query by analogical example: relational search using web search engine indices (MPK, HO, SO, KT), pp. 27–36.
CIKM-2009-KementsietsidisW #evaluation #query #question #what: Provenance query evaluation: what’s so special about it? (AK, MW), pp. 681–690.
CIKM-2009-LeeCKC #approach #dependence #query #ranking: A term dependency-based approach for query terms ranking (CJL, RCC, SHK, PJC), pp. 1267–1276.
CIKM-2009-LeeM #query #relational #xml: Bitmap indexes for relational XML twig query processing (KHL, BM), pp. 465–474.
CIKM-2009-LiM #query: Supporting context-based query in personal DataSpace (YL, XM), pp. 1437–1440.
CIKM-2009-LimWW #challenge #database #problem #query #semantics: Semantic queries in databases: problems and challenges (LL, HW, MW), pp. 1505–1508.
CIKM-2009-LiuH #evaluation #incremental #query: Incremental query evaluation for support vector machines (DL, KAH), pp. 1815–1818.
CIKM-2009-LiuZSNW #clustering #documentation #query #ranking: Clustering queries for better document ranking (YL, LZ, RS, JYN, JRW), pp. 1569–1572.
CIKM-2009-LukYL #query #relational: Group-by skyline query processing in relational engines (MHL, MLY, EL), pp. 1433–1436.
CIKM-2009-LvZ09a #case study #comparative #feedback #modelling #pseudo #query: A comparative study of methods for estimating query language models with pseudo feedback (YL, CZ), pp. 1895–1898.
CIKM-2009-MarinFMGC #query #web: Location cache for web queries (MM, FF, MM, CGP, VGC), pp. 1995–1998.
CIKM-2009-MeijWR #modelling #normalisation #query: A query model based on normalized log-likelihood (EM, WW, MdR), pp. 1903–1906.
CIKM-2009-NicolaK #generative #query #sql #xml: Generating SQL/XML query and update statements (MN, TK), pp. 1187–1196.
CIKM-2009-ParkSNL #multi #named #query: M-COPE: a multiple continuous query processing engine (HKP, SJS, SHN, WSL), pp. 2065–2066.
CIKM-2009-RafieiL #query #using #web: Data extraction from the web using wild card queries (DR, HL), pp. 1939–1942.
CIKM-2009-ShenLLZ #classification #query: Product query classification (DS, YL, XL, DZ), pp. 741–750.
CIKM-2009-TongQJF #graph #interactive #named #performance #proximity #query: iPoG: fast interactive proximity querying on graphs (HT, HQ, HJ, CF), pp. 1673–1676.
CIKM-2009-WangHLS #comprehension #learning #query #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.
CIKM-2009-WangWLL #named #query #ranking #summary: HyperSum: hypergraph based semi-supervised sentence ranking for query-oriented summarization (WW, FW, WL, SL), pp. 1855–1858.
CIKM-2009-WeiLWH #framework #interactive #named #ranking #summary: iRANK: an interactive ranking framework and its application in query-focused summarization (FW, WL, WW, YH), pp. 1557–1560.
CIKM-2009-WeiPTLD #query #web: Context sensitive synonym discovery for web search queries (XW, FP, HT, YL, BD), pp. 1585–1588.
CIKM-2009-WhissellCA #clustering #query #web: Clustering web queries (JSW, CLAC, AA), pp. 899–908.
CIKM-2009-WuLACB #algebra #benchmark #generative #named #query #xpath: XQGen: an algebra-based XPath query generator for micro-benchmarking (YW, NL, RA, SC, SB), pp. 2109–2110.
CIKM-2009-WuTW #query #revisited #using #xml: Answering XML queries using materialized views revisited (XW, DT, WHW), pp. 475–484.
CIKM-2009-XueC #automation #generative #query: Automatic query generation for patent search (XX, WBC), pp. 2037–2040.
CIKM-2009-ZhuCWZWC #divide and conquer #learning #query #ranking: To divide and conquer search ranking by learning query difficulty (ZAZ, WC, TW, CZ, GW, ZC), pp. 1883–1886.
ECIR-2009-Ailon #algorithm #linear #query #ranking #using: A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables (NA), pp. 685–690.
ECIR-2009-AltingovdeOU #cost analysis #query #web: A Cost-Aware Strategy for Query Result Caching in Web Search Engines (ISA, RO, ÖU), pp. 628–636.
ECIR-2009-AshkanCAG #query: Classifying and Characterizing Query Intent (AA, CLAC, EA, QG), pp. 578–586.
ECIR-2009-CarterettePKAA #query: If I Had a Million Queries (BC, VP, EK, JAA, JA), pp. 288–300.
ECIR-2009-ChowdaryK #multi #named #performance #summary: ESUM: An Efficient System for Query-Specific Multi-document Summarization (CRC, PSK), pp. 724–728.
ECIR-2009-Croft #evolution #query: Query Evolution (WBC), p. 1.
ECIR-2009-Efron #aspect-oriented #multi #query #using: Using Multiple Query Aspects to Build Test Collections without Human Relevance Judgments (ME), pp. 276–287.
ECIR-2009-HauffAH #evaluation #performance #predict #query: The Combination and Evaluation of Query Performance Prediction Methods (CH, LA, DH), pp. 301–312.
ECIR-2009-HeO #effectiveness #query: Studying Query Expansion Effectiveness (BH, IO), pp. 611–619.
ECIR-2009-LeaseAC #learning #query #rank: Regression Rank: Learning to Meet the Opportunity of Descriptive Queries (ML, JA, WBC), pp. 90–101.
ECIR-2009-NaLNL #retrieval #sentiment: Improving Opinion Retrieval Based on Query-Specific Sentiment Lexicon (SHN, YL, SHN, JHL), pp. 734–738.
ECIR-2009-OrlandoS #mining #query: Mining Query Logs (SO, FS), pp. 814–817.
ECIR-2009-PengO #independence #information retrieval #web: Selective Application of Query-Independent Features in Web Information Retrieval (JP, IO), pp. 375–387.
ECIR-2009-PetkovaCD #keyword #query #retrieval #xml: Refining Keyword Queries for XML Retrieval by Combining Content and Structure (DP, WBC, YD), pp. 662–669.
ECIR-2009-SarigiannisPB #case study #distributed #query #web: A Study of the Impact of Index Updates on Distributed Query Processing for Web Search (CS, VP, RABY), pp. 595–602.
ECIR-2009-TsegayPTZ #documentation #generative #performance #query: Document Compaction for Efficient Query Biased Snippet Generation (YT, SJP, AT, JZ), pp. 509–520.
ECIR-2009-UdupaSBB #information retrieval #mining #query #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.
ECIR-2009-YinSC #query #using: Query Expansion Using External Evidence (ZY, MS, NC), pp. 362–374.
KDD-2009-LeeHNW #clustering #query: Query result clustering for object-level search (JL, SwH, ZN, JRW), pp. 1205–1214.
KDD-2009-WangCP #aspect-oriented #mining #query: Mining broad latent query aspects from search sessions (XW, DC, KP), pp. 867–876.
KDIR-2009-Fernandez-FernandezG #mining #query #taxonomy #topic: Hierarchical Taxonomy Extraction by Mining Topical Query Sessions (MFF, DGA), pp. 229–235.
KDIR-2009-GoyalBM #query #using: Entailment of Causal Queries in Narratives using Action Language (PG, LB, TMM), pp. 112–118.
KMIS-2009-SonntagM #image #information management #problem #query #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.
RecSys-2009-BaragliaCCFFPS #approach #query #recommendation: Search shortcuts: a new approach to the recommendation of queries (RB, FC, VC, DF, VF, RP, FS), pp. 77–84.
RecSys-2009-Schubert #knowledge-based #personalisation #query #recommendation: Personalized query relaxations and repairs in knowledge-based recommendation (MS), pp. 409–412.
SIGIR-2009-Azzopardi #analysis #effectiveness #empirical #evaluation #query: Query side evaluation: an empirical analysis of effectiveness and effort (LA), pp. 556–563.
SIGIR-2009-BanerjeeCR #learning #query #rank: Learning to rank for quantity consensus queries (SB, SC, GR), pp. 243–250.
SIGIR-2009-BenderskyCS #information retrieval #query #segmentation: Two-stage query segmentation for information retrieval (MB, WBC, DAS), pp. 810–811.
SIGIR-2009-CaoHSJSCY #classification #query: Context-aware query classification (HC, DHH, DS, DJ, JTS, EC, QY), pp. 3–10.
SIGIR-2009-CarmanBGC #comparison #query #statistics: A statistical comparison of tag and query logs (MJC, MB, RG, FC), pp. 123–130.
SIGIR-2009-CloughSANP #multi #query: Multiple approaches to analysing query diversity (PDC, MS, MA, SN, MLP), pp. 734–735.
SIGIR-2009-Collins-ThompsonB #performance #predict #query #using: Estimating query performance using class predictions (KCT, PNB), pp. 672–673.
SIGIR-2009-DengKL #graph #modelling #query #representation: Entropy-biased models for query representation on the click graph (HD, IK, MRL), pp. 339–346.
SIGIR-2009-GuoXCL #query #recognition: Named entity recognition in query (JG, GX, XC, HL), pp. 267–274.
SIGIR-2009-HauffA #effectiveness #performance #predict #query #question: When is query performance prediction effective? (CH, LA), pp. 829–830.
SIGIR-2009-KalmanovichK #clustering #query: Cluster-based query expansion (IGK, OK), pp. 646–647.
SIGIR-2009-KellyGB #comparison #interactive #query: A comparison of query and term suggestion features for interactive searching (DK, KG, EWB), pp. 371–378.
SIGIR-2009-KonigGW #predict #query: Click-through prediction for news queries (ACK, MG, QW), pp. 347–354.
SIGIR-2009-KumaranC #predict #quality #query #using: Reducing long queries using query quality predictors (GK, VRC), pp. 564–571.
SIGIR-2009-Lease #markov #query #random: An improved markov random field model for supporting verbose queries (ML), pp. 476–483.
SIGIR-2009-LiWA #query #random: Extracting structured information from user queries with semi-supervised conditional random fields (XL, YYW, AA), pp. 572–579.
SIGIR-2009-MeijMZ #evaluation #query: An evaluation of entity and frequency based query completion methods (EM, PM, HZ), pp. 678–679.
SIGIR-2009-MeisterKK #clustering #documentation #retrieval: Integrating clusters created offline with query-specific clusters for document retrieval (LM, OK, IGK), pp. 706–707.
SIGIR-2009-MetzlerJPZ #query: Improving search relevance for implicitly temporal queries (DM, RJ, FP, RZ), pp. 700–701.
SIGIR-2009-PunithaJG #automation #feature model #multi #query #retrieval #topic #using #video: Topic prerogative feature selection using multiple query examples for automatic video retrieval (PP, JMJ, AG), pp. 804–805.
SIGIR-2009-SakaiN #analysis #query #wiki: Serendipitous search via wikipedia: a query log analysis (TS, KN), pp. 780–781.
SIGIR-2009-ScholerG #evaluation #predict #query: A case for improved evaluation of query difficulty prediction (FS, SG), pp. 640–641.
SIGIR-2009-ShokouhiAT #effectiveness #query: Effective query expansion for federated search (MS, LA, PT), pp. 427–434.
SIGIR-2009-WangLFXY #performance #query: Efficient query expansion for advertisement search (HW, YL, LF, GRX, YY), pp. 51–58.
SIGIR-2009-XueC #query: Transforming patents into prior-art queries (XX, WBC), pp. 808–809.
SIGIR-2009-XuJW #feedback #pseudo #query #wiki: Query dependent pseudo-relevance feedback based on wikipedia (YX, GJFJ, BW), pp. 59–66.
SIGIR-2009-YangWGH #learning #query #ranking #web: Query sampling for ranking learning in web search (LY, LW, BG, XSH), pp. 754–755.
SIGIR-2009-ZhangL #query #question #web #what: What queries are likely to recur in web search? (DZ, JL), pp. 827–828.
SIGIR-2009-ZhangYYLC #query: Temporal query substitution for ad search (WZ, JY, SY, NL, ZC), pp. 798–799.
SIGIR-2009-ZhuWVC #evaluation #information retrieval #query #topic: Topic (query) selection for IR evaluation (JZ, JW, VV, IJC), pp. 802–803.
ICMT-2009-HillairetBL #model transformation #query: Rewriting Queries by Means of Model Transformations from SPARQL to OQL and Vice-Versa (GH, FB, JYL), pp. 116–131.
PADL-2009-PereiraP #logic programming #modelling #query #source code #top-down: Layered Models Top-Down Querying of Normal Logic Programs (LMP, AMP), pp. 254–268.
SAC-2009-Abbadeni #database #information retrieval #multi #query #using #visual notation: Information retrieval from visual databases using multiple representations and multiple queries (NA), pp. 1523–1527.
SAC-2009-AmoR #named #query: CPref-SQL: a query language supporting conditional preferences (SdA, MRR), pp. 1573–1577.
SAC-2009-BoscPS #query: Stratified division queries involving ordinal user preferences (PB, OP, OS), pp. 1748–1749.
SAC-2009-ChoB #performance #query #xml: Building an efficient preference XML query processor (SC, WTB), pp. 1585–1586.
SAC-2009-GroppeNL #java #named #query #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.
SAC-2009-MahboubiD #performance #query #xml: Enhancing XML data warehouse query performance by fragmentation (HM, JD), pp. 1555–1562.
SAC-2009-MaLWW #query #realtime #scheduling: Real-time scheduling for continuous queries with deadlines (LM, XL, YW, HW), pp. 1516–1517.
SAC-2009-MattheT #query #using: Bipolar query satisfaction using satisfaction and dissatisfaction degrees: bipolar satisfaction degrees (TM, GDT), pp. 1699–1703.
SAC-2009-NecaskyM #query #xml: Discovering XML keys and foreign keys in queries (MN, IM), pp. 632–638.
SAC-2009-YeeNF #peer-to-peer #query: Alternatives to conjunctive query processing in peer-to-peer file-sharing systems (WGY, LTN, OF), pp. 1737–1741.
ICSE-2009-HillPV #automation #maintenance #reuse #source code: Automatically capturing source code context of NL-queries for software maintenance and reuse (EH, LLP, KVS), pp. 232–242.
SLE-2009-SpiewakZ #database #named #query #scala: ScalaQL: Language-Integrated Database Queries for Scala (DS, TZ), pp. 154–163.
HPDC-2009-SchollRK #collaboration #coordination #query: Collaborative query coordination in community-driven data grids (TS, AR, AK), pp. 197–206.
CSL-2009-HorbachW #induction #query: Deciding the Inductive Validity of FOR ALL THERE EXISTS * Queries (MH, CW), pp. 332–347.
ICLP-2009-BroechelerSS #logic programming #probability #query #source code #using: Using Histograms to Better Answer Queries to Probabilistic Logic Programs (MB, GIS, VSS), pp. 40–54.
ICLP-2009-DungHT #information management #multi #query: Stabilization of Information Sharing for Queries Answering in Multiagent Systems (PMD, DDH, PMT), pp. 84–98.
VMCAI-2009-HolzerSTV #testing: Query-Driven Program Testing (AH, CS, MT, HV), pp. 151–166.
ASE-2008-KhalekELK #constraints #generative #relational #testing #theorem proving #using: Query-Aware Test Generation Using a Relational Constraint Solver (SAK, BE, YOL, SK), pp. 238–247.
DocEng-2008-SchroederM #approach #design #documentation #performance #query #xml: Improving query performance on XML documents: a workload-driven design approach (RS, RdSM), pp. 177–186.
PODS-2008-AfratiK #query: Answering aggregate queries in data exchange (FNA, PGK), pp. 129–138.
PODS-2008-FosterGT #query #xml: Annotated XML: queries and provenance (JNF, TJG, VT), pp. 271–280.
PODS-2008-JhaRS #constraints #evaluation #query: Query evaluation with soft-key constraints (AKJ, VR, DS), pp. 119–128.
PODS-2008-Koch #approximate #database #probability #query: Approximating predicates and expressive queries on probabilistic databases (CK), pp. 99–108.
PODS-2008-MoorSAV #datalog #optimisation #query #type inference: Type inference for datalog and its application to query optimisation (OdM, DS, PA, MV), pp. 291–300.
SIGMOD-2008-BrunoN #design #optimisation #parametricity #physics #query: Configuration-parametric query optimization for physical design tuning (NB, RVN), pp. 941–952.
SIGMOD-2008-CaoDCT #multi #optimisation #query: Optimizing complex queries with multiple relation instances (YC, GCD, CYC, KLT), pp. 525–538.
SIGMOD-2008-ChenC #constraints #query: Minimization of tree pattern queries with constraints (DC, CYC), pp. 609–622.
SIGMOD-2008-FournyKKPF #xquery: XQuery in the browser (GF, DK, TK, MP, DF), pp. 1337–1340.
SIGMOD-2008-GhelliORS #optimisation #query #xml: XML query optimization in the presence of side effects (GG, NO, KHR, JS), pp. 339–352.
SIGMOD-2008-GhinitaKKST #query: Private queries in location based services: anonymizers are not necessary (GG, PK, AK, CS, KLT), pp. 121–132.
SIGMOD-2008-HeS #data access #database #graph #named #query: Graphs-at-a-time: query language and access methods for graph databases (HH, AKS), pp. 405–418.
SIGMOD-2008-HuangLC #generative #query #xml: Query biased snippet generation in XML search (YH, ZL, YC), pp. 315–326.
SIGMOD-2008-HuaPZL #approach #nondeterminism #probability #query #ranking: Ranking queries on uncertain data: a probabilistic threshold approach (MH, JP, WZ, XL), pp. 673–686.
SIGMOD-2008-JinXRW #graph #query #reachability #scalability: Efficiently answering reachability queries on very large directed graphs (RJ, YX, NR, HW), pp. 595–608.
SIGMOD-2008-JohnsonMSS #clustering #data type #monitoring #network: Query-aware partitioning for monitoring massive network data streams (TJ, SMM, VS, OS), pp. 1135–1146.
SIGMOD-2008-KimelfeldKS #modelling #performance #probability #query #xml: Query efficiency in probabilistic XML models (BK, YK, YS), pp. 701–714.
SIGMOD-2008-LeeC #performance #query #using: Efficient storage scheme and query processing for supply chain management using RFID (CHL, CWC), pp. 291–302.
SIGMOD-2008-MishraK #query: Stretch’n’shrink: resizing queries to user preferences (CM, NK), pp. 1227–1230.
SIGMOD-2008-MishraKZ #database #generative #query #testing: Generating targeted queries for database testing (CM, NK, CZ), pp. 499–510.
SIGMOD-2008-MitraWH #clustering #documentation #lifecycle: Query-based partitioning of documents and indexes for information lifecycle management (SM, MW, WWH), pp. 623–636.
SIGMOD-2008-PeiHTL #nondeterminism #probability #query #summary #tutorial: Query answering techniques on uncertain and probabilistic data: tutorial summary (JP, MH, YT, XL), pp. 1357–1364.
SIGMOD-2008-ReLBS #correlation #probability #query: Event queries on correlated probabilistic streams (CR, JL, MB, DS), pp. 715–728.
SIGMOD-2008-SaitoM #query #xml: Relational-style XML query (TLS, SM), pp. 303–314.
SIGMOD-2008-ScheideggerVKFS #query #workflow: Querying and re-using workflows with VsTrails (CES, HTV, DK, JF, CTS), pp. 1251–1254.
SIGMOD-2008-TatemuraCLPCA #named #nondeterminism #query #web #web service: UQBE: uncertain query by example for web service mashup (JT, SC, FL, OP, KSC, DA), pp. 1275–1280.
SIGMOD-2008-ThiagarajanM #database #query: Querying continuous functions in a database system (AT, SM), pp. 791–804.
SIGMOD-2008-VlachouDNV #distributed #on the #performance #query: On efficient top-k query processing in highly distributed environments (AV, CD, KN, MV), pp. 753–764.
SIGMOD-2008-WuLOT #query #retrieval: Just-in-time query retrieval over partially indexed data on structured P2P overlays (SW, JL, BCO, KLT), pp. 279–290.
SIGMOD-2008-WuXH #named #query #ranking: ARCube: supporting ranking aggregate queries in partially materialized data cubes (TW, DX, JH), pp. 79–92.
SIGMOD-2008-YangWL #approximate #cost analysis #query #string: Cost-based variable-length-gram selection for string collections to support approximate queries efficiently (XY, BW, CL), pp. 353–364.
SIGMOD-2008-ZhangB #distributed #named #xquery: XRPC: distributed XQuery and update processing with heterogeneous XQuery engines (YZ, PAB), pp. 1331–1336.
VLDB-2008-AntonellisGC #analysis #graph #query: Simrank++: query rewriting through link analysis of the click graph (IA, HGM, CCC), pp. 408–421.
VLDB-2008-Bar-YossefG #mining #query: Mining search engine query logs via suggestion sampling (ZBY, MG), pp. 54–65.
VLDB-2008-BragaCDM #multi #optimisation #query #web: Optimization of multi-domain queries on the web (DB, SC, FD, DM), pp. 562–573.
VLDB-2008-ChaudhuriNR #execution #feedback #framework #query: A pay-as-you-go framework for query execution feedback (SC, VRN, RR), pp. 1141–1152.
VLDB-2008-DeutchM #execution #query #type checking #type inference: Type inference and type checking for queries on execution traces (DD, TM), pp. 352–363.
VLDB-2008-DeutchM08a #modelling #nondeterminism #query: Querying web-based applications under models of uncertainty (DD, TM), pp. 1659–1665.
VLDB-2008-DeyBDH #approximate #diagrams #query: Efficiently approximating query optimizer plan diagrams (AD, SB, HD, JRH), pp. 1325–1336.
VLDB-2008-DingTSWK #comparison #distance #metric #mining #query: Querying and mining of time series data: experimental comparison of representations and distance measures (HD, GT, PS, XW, EJK), pp. 1542–1552.
VLDB-2008-GarrodMAMMOT #query #scalability #web: Scalable query result caching for web applications (CG, AM, AA, BMM, TCM, CO, AT), pp. 550–561.
VLDB-2008-GeZ #approach #query: A skip-list approach for efficiently processing forecasting queries (TG, SBZ), pp. 984–995.
VLDB-2008-GuoARSSV #performance: Efficient top-k processing over query-dependent functions (LG, SAY, RR, JS, US, EV), pp. 1044–1055.
VLDB-2008-GuoLFX #database #multi #named #query: C-DEM: a multi-modal query system for Drosophila Embryo databases (FG, LL, CF, EPX), pp. 1508–1511.
VLDB-2008-HadjieleftheriouYKS #query #set #similarity: Hashed samples: selectivity estimators for set similarity selection queries (MH, XY, NK, DS), pp. 201–212.
VLDB-2008-HanKLLM #optimisation #query: Parallelizing query optimization (WSH, WK, JL, GML, VM), pp. 188–200.
VLDB-2008-HuangCDN #on the #query: On the provenance of non-answers to queries over extracted data (JH, TC, AD, JFN), pp. 736–747.
VLDB-2008-HuRCLZ #database #named #query #visualisation: QueryScope: visualizing queries for repeatable database tuning (LH, KAR, YCC, CAL, DZ), pp. 1488–1491.
VLDB-2008-JayapandianJ #automation #database #interface #query: Automated creation of a forms-based database query interface (MJ, HVJ), pp. 695–709.
VLDB-2008-JinYCYL #nondeterminism #query: Sliding-window top-k queries on uncertain streams (CJ, KY, LC, JXY, XL), pp. 301–312.
VLDB-2008-KementsietsidisNCV #database #multi #optimisation #query #scalability: Scalable multi-query optimization for exploratory queries over federated scientific databases (AK, FN, DVdC, SV), pp. 16–27.
VLDB-2008-LeeZ #query: Closing the query processing loop in Oracle 11g (AWL, MZ), pp. 1368–1378.
VLDB-2008-LiuCBC #independence #physics #sql #towards #xml #xquery: Towards a physical XML independent XQuery/SQL/XML engine (ZHL, SC, TB, HJC), pp. 1356–1367.
VLDB-2008-MathisWHH #compilation #named #xquery: XTCcmp: XQuery compilation on XTC (CM, AMW, TH, CRFH), pp. 1400–1403.
VLDB-2008-MiloD #distributed #monitoring #process #query: Querying and monitoring distributed business processes (TM, DD), pp. 1512–1515.
VLDB-2008-MoonCDHZ #database #evolution #query #transaction: Managing and querying transaction-time databases under schema evolution (HJM, CC, AD, CYH, CZ), pp. 882–895.
VLDB-2008-NutanongZTK #approach #query: The V*-Diagram: a query-dependent approach to moving KNN queries (SN, RZ, ET, LK), pp. 1095–1106.
VLDB-2008-PangM #authentication #query: Authenticating the query results of text search engines (HP, KM), pp. 126–137.
VLDB-2008-PuY #keyword #query: Keyword query cleaning (KQP, XY), pp. 909–920.
VLDB-2008-ShahabiTX #performance #query: Indexing land surface for efficient kNN query (CS, LAT, SX), pp. 1020–1031.
VLDB-2008-SharafLC #data type #query #scheduling: Scheduling continuous queries in data stream management systems (MAS, AL, PKC), pp. 1526–1527.
VLDB-2008-SlezakWES #ad hoc #named #query: Brighthouse: an analytic data warehouse for ad-hoc queries (DS, JW, VE, PS), pp. 1337–1345.
VLDB-2008-TalukdarJMCIPG #learning #query: Learning to create data-integrating queries (PPT, MJ, MSM, KC, ZGI, FCNP, SG), pp. 785–796.
VLDB-2008-TerwilligerMB #query #sql #xml: Language-integrated querying of XML data in SQL server (JFT, SM, PAB), pp. 1396–1399.
VLDB-2008-TeubnerGMS #xquery: Dependable cardinality forecasts for XQuery (JT, TG, SM, SS), pp. 463–477.
VLDB-2008-TianPNMK #graph #named #query #tool support: Periscope/GQ: a graph querying toolkit (YT, JMP, VN, SM, MK), pp. 1404–1407.
VLDB-2008-WangLLG #documentation #query #xml: Hash-base subgraph query processing method for graph-structured XML documents (HW, JL, JL, HG), pp. 478–489.
VLDB-2008-WongFPHWL #performance #query: Efficient skyline querying with variable user preferences on nominal attributes (RCWW, AWCF, JP, YSH, TW, YL), pp. 1032–1043.
VLDB-2008-WuYCT #named #nearest neighbour #query: FINCH: evaluating reverse k-Nearest-Neighbor queries on location data (WW, FY, CYC, KLT), pp. 1056–1067.
VLDB-2008-XiaoT #query: Output perturbation with query relaxation (XX, YT), pp. 857–869.
VLDB-2008-YehWYC #distributed #named #query: LeeWave: level-wise distribution of wavelet coefficients for processing kNN queries over distributed streams (MYY, KLW, PSY, MSC), pp. 586–597.
ITiCSE-2008-Hollingsworth #approach #education #query: Teaching query writing: an informed instruction approach (JEH), p. 351.
ESOP-2008-Cheney #query #regular expression #type system #xml: Regular Expression Subtyping for XML Query and Update Languages (JC), pp. 32–47.
ICPC-2008-VerbaereGG #comprehension #query: Query Technologies and Applications for Program Comprehension (QTAPC 2008) (MV, MWG, TG), pp. 285–288.
ICSM-2008-ZhangBJAL #analysis #generative #visual notation: Query-based filtering and graphical view generation for clone analysis (YZ, HAB, SJ, DA, ML), pp. 376–385.
SCAM-2008-GorbovitskiTRSL #analysis #debugging #performance: Analysis and Transformations for Efficient Query-Based Debugging (MG, KTT, TR, SDS, YAL), pp. 174–183.
WCRE-2008-GhanbariCA #analysis #aspectj #hybrid #java #query #source code: A Hybrid Query Engine for the Structural Analysis of Java and AspectJ Programs (HG, CC, VA), pp. 133–137.
SAS-2008-LalR #data flow #multi #query #using: Solving Multiple Dataflow Queries Using WPDSs (AL, TWR), pp. 93–109.
STOC-2008-ChoiK #bound #complexity #graph #query: Optimal query complexity bounds for finding graphs (SSC, JHK), pp. 749–758.
ICALP-A-2008-Ben-SassonHLM: Sound 3-Query PCPPs Are Long (EBS, PH, OL, AM), pp. 686–697.
ICFP-2008-MorihataMT #framework #query #recursion: Write it recursively: a generic framework for optimal path queries (AM, KM, MT), pp. 169–178.
GT-VMT-2006-Varro08 #database #graph transformation #implementation #independence #plugin #query #using: Implementing an EJB3-Specific Graph Transformation Plugin by Using Database Independent Queries (GV), pp. 121–132.
GT-VMT-2008-Weinell #graph #query #reduction: Extending Graph Query Languages by Reduction (EW).
ICGT-2008-YuH #graph transformation #query #semantics #web: Graph Transformation for the Semantic Web: Queries and Inference Rules (HY, YH), pp. 511–513.
CHI-2008-HeerAW #interactive #query: Generalized selection via interactive query relaxation (JH, MA, WW), pp. 959–968.
CHI-2008-KamvarB #comprehension #mobile #query: Query suggestions for mobile search: understanding usage patterns (MK, SB), pp. 1013–1016.
CHI-2008-LuoLLT #image #multi #named #query: MQSearch: image search by multi-class query (YL, WL, JL, XT), pp. 49–52.
EDOC-2008-AwadPW #modelling #process #query #semantics: Semantic Querying of Business Process Models (AA, AP, MW), pp. 85–94.
ICEIS-AIDSS-2008-KompaoreMT #information retrieval #query: Combining Indexing Methods and Query Sizes in Information Retrieval in French (DK, JM, LT), pp. 149–154.
ICEIS-DISI-2008-Chen #evaluation #query #xml: Tree Embedding and XML Query Evaluation (YC), pp. 173–178.
ICEIS-DISI-2008-DroopFGGLPSSSSZ #query #xpath: Embedding Xpath Queries into SPARQL Queries (MD, MF, JG, SG, VL, JP, FS, MS, FS, HS, SZ), pp. 5–14.
ICEIS-DISI-2008-GroppeL #query #satisfiability #xpath: Discovering Veiled Unsatisfiable Xpath Queries (JG, VL), pp. 149–158.
ICEIS-DISI-2008-Savnik #algebra #data flow #implementation #query #web: Implementation of Algebra for Querying Web Data Sources (IS), pp. 91–96.
CIKM-2008-AhmadABM #database #interactive #modelling #query: Modeling and exploiting query interactions in database systems (MA, AA, SB, KM), pp. 183–192.
CIKM-2008-BoldiBCDGV #graph: The query-flow graph: model and applications (PB, FB, CC, DD, AG, SV), pp. 609–618.
CIKM-2008-ChenCKSS #integration #optimisation #query #xml: Query optimization in xml-based information integration (DC, RC, MK, FS, TJS), pp. 1405–1406.
CIKM-2008-ChuangC #query #web: Integrating web query results: holistic schema matching (SLC, KCCC), pp. 33–42.
CIKM-2008-ChungLC #performance #probability #query: Efficient processing of probabilistic spatio-temporal range queries over moving objects (BSEC, WCL, ALPC), pp. 1399–1400.
CIKM-2008-CustisA #corpus #query #statistics: Investigating external corpus and clickthrough statistics for query expansion in the legal domain (TC, KAK), pp. 1363–1364.
CIKM-2008-DakkaGI #query: Answering general time sensitive queries (WD, LG, PGI), pp. 1437–1438.
CIKM-2008-DowneyDLH #comprehension #query: Understanding the relationship between searchers’ queries and information goals (DD, STD, DJL, EH), pp. 449–458.
CIKM-2008-ErcegovacJLMS #query: Supporting sub-document updates and queries in an inverted index (VE, VJ, NL, MRM, EJS), pp. 659–668.
CIKM-2008-GueniACW #query #xquery: Pruning nested XQuery queries (BG, TA, BC, EW), pp. 541–550.
CIKM-2008-HauffHJ #bibliography #performance #predict #query: A survey of pre-retrieval query performance predictors (CH, DH, FdJ), pp. 1419–1420.
CIKM-2008-HauffMB #predict #query #web: Improved query difficulty prediction for the web (CH, VM, RABY), pp. 439–448.
CIKM-2008-HauglidN #database #distributed #named #query: PROQID: partial restarts of queries in distributed databases (JOH, KN), pp. 1251–1260.
CIKM-2008-HuangS #markov #query #using: A latent variable model for query expansion using the hidden markov model (QH, DS), pp. 1417–1418.
CIKM-2008-JonesK #automation #query #segmentation #topic: Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs (RJ, KLK), pp. 699–708.
CIKM-2008-KarnstedtSHHSS #database #query: Estimating the number of answers with guarantees for structured queries in p2p databases (MK, KUS, MH, MH, BS, RS), pp. 1407–1408.
CIKM-2008-KormilitsinCFS #algorithm #heuristic: View and index selection for query-performance improvement: quality-centered algorithms and heuristics (MK, RC, YF, MFS), pp. 1329–1330.
CIKM-2008-LeeLZ #framework #named #network #performance #query: ROAD: an efficient framework for location dependent spatial queries on road networks (KCKL, WCL, BZ), pp. 1327–1328.
CIKM-2008-LeeSZL #mobile #query: Valid scope computation for location-dependent spatial query in mobile broadcast environments (KCKL, JS, BZ, WCL), pp. 1231–1240.
CIKM-2008-LiangCY #energy #maintenance #network #query: Energy-efficient skyline query processing and maintenance in sensor networks (WL, BC, JXY), pp. 1471–1472.
CIKM-2008-MaYKL #learning #query #semantics: Learning latent semantic relations from clickthrough data for query suggestion (HM, HY, IK, MRL), pp. 709–718.
CIKM-2008-MeiZC #query #using: Query suggestion using hitting time (QM, DZ, KWC), pp. 469–478.
CIKM-2008-NguyenS08a #correlation #order #query #rank: Polyhedral transformation for indexed rank order correlation queries (PN, NS), pp. 1477–1478.
CIKM-2008-OzcanAU #query: Utilization of navigational queries for result presentation and caching in search engines (RO, ISA, ÖU), pp. 1499–1500.
CIKM-2008-ParikhS #behaviour #query #semantics: Inferring semantic query relations from collective user behavior (NP, NS), pp. 349–358.
CIKM-2008-PlacekTSDS #approach #heuristic #query: A heuristic approach for checking containment of generalized tree-pattern queries (PP, DT, SS, TD, TKS), pp. 551–560.
CIKM-2008-RazenteBTFT #approach #data access #metric #novel #optimisation #process #query #similarity: A novel optimization approach to efficiently process aggregate similarity queries in metric access methods (HLR, MCNB, AJMT, CF, CTJ), pp. 193–202.
CIKM-2008-VaidyaL #database #query: Characterization of TPC-H queries for a column-oriented database on a dual-core amd athlon processor (PV, JJL), pp. 1411–1412.
CIKM-2008-WangYPY #assurance #encryption #query: Dual encryption for query integrity assurance (HW, JY, CSP, PSY), pp. 863–872.
CIKM-2008-WangZ #effectiveness #mining #query: Mining term association patterns from search logs for effective query reformulation (XW, CZ), pp. 479–488.
CIKM-2008-WuT #query #xml: Evaluating partial tree-pattern queries on XML streams (XW, DT), pp. 1409–1410.
CIKM-2008-XieCGZ #navigation #optimisation #xquery: Some rewrite optimizations of DB2 XQuery navigation (GX, QC, JG, CZ), pp. 531–540.
CIKM-2008-XuA #feedback #query: Active relevance feedback for difficult queries (ZX, RA), pp. 459–468.
CIKM-2008-XuDW #query #using #wiki: Entity-based query reformulation using wikipedia (YX, FD, BW), pp. 1441–1442.
CIKM-2008-YangCJWZM #query #search-based: Search-based query suggestion (JMY, RC, FJ, SW, LZ, WYM), pp. 1439–1440.
CIKM-2008-ZhuSYW #process #query #question: Can phrase indexing help to process non-phrase queries? (MZ, SS, NY, JRW), pp. 679–688.
ECIR-2008-AltingovdeCU #performance #query #strict #web: Efficient Processing of Category-Restricted Queries for Web Directories (ISA, FC, ÖU), pp. 695–699.
ECIR-2008-HeLR #metric #predict #query #using: Using Coherence-Based Measures to Predict Query Difficulty (JH, ML, MdR), pp. 689–694.
ECIR-2008-HuangSR #documentation #feedback #pseudo #query #robust: Robust Query-Specific Pseudo Feedback Document Selection for Query Expansion (QH, DS, SMR), pp. 547–554.
ECIR-2008-JarvelinPDN #evaluation #information retrieval #multi: Discounted Cumulated Gain Based Evaluation of Multiple-Query IR Sessions (KJ, SLP, LMLD, MLN), pp. 4–15.
ECIR-2008-NaKL08c #probability #similarity #using: Query-Based Inter-document Similarity Using Probabilistic Co-relevance Model (SHN, ISK, JHL), pp. 684–688.
ECIR-2008-SongHRB #composition #mining #modelling #multi #query #using: Facilitating Query Decomposition in Query Language Modeling by Association Rule Mining Using Multiple Sliding Windows (DS, QH, SMR, PB), pp. 334–345.
ECIR-2008-WeiLLH #clustering #graph #multi #query #summary: A Cluster-Sensitive Graph Model for Query-Oriented Multi-document Summarization (FW, WL, QL, YH), pp. 446–453.
ECIR-2008-ZhaoST #effectiveness #performance #predict #query #similarity #using #variability: Effective Pre-retrieval Query Performance Prediction Using Similarity and Variability Evidence (YZ, FS, YT), pp. 52–64.
ICML-2008-LanLQML #learning #rank: Query-level stability and generalization in learning to rank (YL, TYL, TQ, ZM, HL), pp. 512–519.
ICML-2008-PuolamakiAK #learning #query: Learning to learn implicit queries from gaze patterns (KP, AA, SK), pp. 760–767.
ICPR-2008-PadmanabhanN #query: Query by table (RKP, GN), pp. 1–4.
KDD-2008-BonchiCDG #composition #query #topic: Topical query decomposition (FB, CC, DD, AG), pp. 52–60.
KDD-2008-CaoJPHLCL #mining #query: Context-aware query suggestion by mining click-through and session data (HC, DJ, JP, QH, ZL, EC, HL), pp. 875–883.
KDD-2008-KoenigsteinST #analysis #query #string #using: Spotting out emerging artists using geo-aware analysis of P2P query strings (NK, YS, TT), pp. 937–945.
KDD-2008-LingD #learning #query: Active learning with direct query construction (CXL, JD), pp. 480–487.
KDD-2008-ParikhS #detection #query #realtime #scalability: Scalable and near real-time burst detection from eCommerce queries (NP, NS), pp. 972–980.
KDD-2008-SarmaGI #query #using: Bypass rates: reducing query abandonment using negative inferences (ADS, SG, SI), pp. 177–185.
KDD-2008-SiaCCT #performance #query: Efficient computation of personal aggregate queries on blogs (KCS, JC, YC, BLT), pp. 632–640.
KR-2008-BinasM #consistency #peer-to-peer #query: Peer-to-Peer Query Answering with Inconsistent Knowledge (AB, SAM), pp. 329–339.
KR-2008-CaliGK #constraints #infinity #query #relational: Taming the Infinite Chase: Query Answering under Expressive Relational Constraints (AC, GG, MK), pp. 70–80.
KR-2008-CalvaneseGLR #logic #ontology #query: View-Based Query Answering over Description Logic Ontologies (DC, GDG, ML, RR), pp. 242–251.
KR-2008-Cortes-CalabuigDAB #approximate #database #fixpoint #performance #query: Accuracy and Efficiency of Fixpoint Methods for Approximate Query Answering in Locally Complete Databases (ACC, MD, OA, MB), pp. 81–91.
KR-2008-GlimmHS #query: Unions of Conjunctive Queries in SHOQ (BG, IH, US), pp. 252–262.
RecSys-2008-LiWZZC #named #parallel #query #recommendation: Pfp: parallel fp-growth for query recommendation (HL, YW, DZ, MZ, EYC), pp. 107–114.
SEKE-2008-SaccolEG #metadata #peer-to-peer #query #xml: A Metadata Model for Managing and Querying XML Resources in Peer-to-peer Systems (DdBS, NE, RdMG), pp. 525–530.
SIGIR-2008-AltingovdeDCU #query: Site-based dynamic pruning for query processing in search engines (ISA, ED, FC, ÖU), pp. 861–862.
SIGIR-2008-ArampatzisK #case study #query: A study of query length (AA, JK), pp. 811–812.
SIGIR-2008-BalogWR #modelling #query: A few examples go a long way: constructing query models from elaborate query formulations (KB, WW, MdR), pp. 371–378.
SIGIR-2008-BenderskyC #concept #query: Discovering key concepts in verbose queries (MB, WBC), pp. 491–498.
SIGIR-2008-BilenkoWRM #query: Talking the talk vs. walking the walk: salience of information needs in querying vs. browsing (MB, RWW, MR, GCM), pp. 705–706.
SIGIR-2008-BuscherDE #feedback #query #using: Query expansion using gaze-based feedback on the subdocument level (GB, AD, LvE), pp. 387–394.
SIGIR-2008-CarterettePKAA #evaluation #query: Evaluation over thousands of queries (BC, VP, EK, JAA, JA), pp. 651–658.
SIGIR-2008-ChiaSLN #approach #documentation #retrieval: A lattice-based approach to query-by-example spoken document retrieval (TKC, KCS, HL, HTN), pp. 363–370.
SIGIR-2008-DamianiMP #flexibility #query #xml #xpath: A flexible extension of XPath to improve XML querying (ED, SM, GP), pp. 849–850.
SIGIR-2008-Gan #approach #query #using: Using a mediated query approach for matching unstructured query with structured resources (KHG), p. 895.
SIGIR-2008-GengLQALS #nearest neighbour #query #ranking #using: Query dependent ranking using K-nearest neighbor (XG, TYL, TQ, AA, HL, HYS), pp. 115–122.
SIGIR-2008-GuoA #query: Exploring mouse movements for inferring query intent (QG, EA), pp. 707–708.
SIGIR-2008-GuoXLC #query #refinement: A unified and discriminative model for query refinement (JG, GX, HL, XC), pp. 379–386.
SIGIR-2008-HoonKTK #named #query: Minexml: bridging unstructured query with structured resources via mediated query (GKH, PKK, SST, TEK), p. 879.
SIGIR-2008-HuCBLCY #mining #query #web: Web query translation via web log mining (RH, WC, PB, YL, ZC, QY), pp. 749–750.
SIGIR-2008-JohoHJ #documentation #summary #using: Emulating query-biased summaries using document titles (HJ, DH, JMJ), pp. 709–710.
SIGIR-2008-KalashnikovNM #approach #people #quality #towards #web: Towards breaking the quality curse.: a web-querying approach to web people search (DVK, RNT, SM), pp. 27–34.
SIGIR-2008-KumaranA #effectiveness #interactive #performance #query: Effective and efficient user interaction for long queries (GK, JA), pp. 11–18.
SIGIR-2008-Kurland #approach #clustering #documentation #ranking: The opposite of smoothing: a language model approach to ranking query-specific document clusters (OK), pp. 171–178.
SIGIR-2008-KurlandD #approach #clustering: A rank-aggregation approach to searching for optimal query-specific clusters (OK, CD), pp. 547–554.
SIGIR-2008-LiuLLJ #clustering #geometry #query #ranking: Spectral geometry for simultaneously clustering and ranking query search results (YL, WL, YL, LJ), pp. 539–546.
SIGIR-2008-LiWA #graph #learning #query: Learning query intent from regularized click graphs (XL, YYW, AA), pp. 339–346.
SIGIR-2008-Nguyen #approach #preprocessor #query #web #word: Query preprocessing: improving web search through a Vietnamese word tokenization approach (DN), pp. 765–766.
SIGIR-2008-RadlinskiBCGJR #approach #optimisation #query: Optimizing relevance and revenue in ad search: a query substitution approach (FR, AZB, PC, EG, VJ, LR), pp. 403–410.
SIGIR-2008-Sanderson #ambiguity #query: Ambiguous queries: test collections need more sense (MS), pp. 499–506.
SIGIR-2008-SchenkelCKMNPW #network #performance #query: Efficient top-k querying over social-tagging networks (RS, TC, MK, SM, TN, JXP, GW), pp. 523–530.
SIGIR-2008-SunHL #case study #query: Searching blogs and news: a study on popular queries (AS, MH, EPL), pp. 729–730.
SIGIR-2008-TeevanDL #modelling #personalisation #query: To personalize or not to personalize: modeling queries with variation in user intent (JT, STD, DJL), pp. 163–170.
SIGIR-2008-ValletZ #approach #query #semantics: Inferring the most important types of a query: a semantic approach (DV, HZ), pp. 857–858.
SIGIR-2008-VelosoAGM #learning #rank #using: Learning to rank at query-time using association rules (AV, HMdA, MAG, WMJ), pp. 267–274.
SIGIR-2008-WeiLLH #multi #query #summary: Query-sensitive mutual reinforcement chain and its application in query-oriented multi-document summarization (FW, WL, QL, YH), pp. 283–290.
SIGIR-2008-WeiPD #query #web: Analyzing web text association to disambiguate abbreviation in queries (XW, FP, BD), pp. 751–752.
SIGIR-2008-WelchC #automation #identification #query: Automatically identifying localizable queries (MJW, JC), pp. 507–514.
SIGIR-2008-ZhangL #learning #multi: Learning with support vector machines for query-by-multiple-examples (DZ, WSL), pp. 835–836.
SIGIR-2008-ZighelnicK #query #robust: Query-drift prevention for robust query expansion (LZ, OK), pp. 825–826.
OOPSLA-2008-WiedermannIC #interprocedural #persistent #query: Interprocedural query extraction for transparent persistence (BW, AI, WRC), pp. 19–36.
OOPSLA-2008-WillisPN #java #query: Caching and incrementalisation in the java query language (DW, DJP, JN), pp. 1–18.
GPCE-2008-RothamelL #generative #implementation #incremental #query: Generating incremental implementations of object-set queries (TR, YAL), pp. 55–66.
PPDP-2008-BenzakenCCM #programming #query #visual notation #xml: Pattern by example: type-driven visual programming of XML queries (VB, GC, DC, CM), pp. 131–142.
SAC-2008-BordognaPPP #nondeterminism #query: Evaluating uncertain location-based spatial queries (GB, MP, GP, GP), pp. 1095–1100.
SAC-2008-BugattiTT #integration #query #similarity: Assessing the best integration between distance-function and image-feature to answer similarity queries (PHB, AJMT, CTJ), pp. 1225–1230.
SAC-2008-CrassoZC #query #web #web service: Query by example for web services (MC, AZ, MC), pp. 2376–2380.
SAC-2008-DaltioMGL #framework #process #query: A framework to process complex biodiversity queries (JD, CBM, LGJ, TML), pp. 2293–2297.
SAC-2008-DoringPE #e-commerce #query: Advanced preference query processing for e-commerce (SD, TP, ME), pp. 1457–1462.
SAC-2008-GennaroMOR #network #peer-to-peer #query #similarity: Processing complex similarity queries in peer-to-peer networks (CG, MM, SO, FR), pp. 473–478.
SAC-2008-GroppeGLKHR #xquery: Embedding SPARQL into XQuery/XSLT (SG, JG, VL, DK, NH, CR), pp. 2271–2278.
SAC-2008-IsikmanYOOGA #adaptation #fuzzy #multi #query #web: Adaptive weighted multi-criteria fuzzy query processing for web based real estate applications (ÖÖI, BGY, MÖ, TÖ, HG, RA), pp. 987–991.
SAC-2008-RazenteBTT #feedback #image #query #retrieval #similarity: Aggregate similarity queries in relevance feedback methods for content-based image retrieval (HLR, MCNB, AJMT, CTJ), pp. 869–874.
SAC-2008-SansL #algebra #interface #named #order #visualisation #xquery: IFOX: interface for ordered XQuery an algebraic oriented tool for ordered XQuery visualization (VS, DL), pp. 1252–1257.
SAC-2008-YuiMUK #distributed #named #parallel #using #xquery: XBird/D: distributed and parallel XQuery processing using remote proxy (MY, JM, SU, HK), pp. 1003–1007.
SAC-2008-ZhouTBAG #ambiguity #graph #named #query: G^con: a graph-based technique for resolving ambiguity in query translation candidates (DZ, MT, TJB, HA, JG), pp. 1566–1573.
ICSE-2008-AlwisM #concept #query: Answering conceptual queries with Ferret (BdA, GCM), pp. 21–30.
HPDC-2008-GuptaBG #framework #grid #ontology #query: Ontological framework for a free-form query based grid search engine (CG, RB, MG), pp. 205–208.
IJCAR-2008-Lutz #complexity #logic #query: The Complexity of Conjunctive Query Answering in Expressive Description Logics (CL), pp. 179–193.
DocEng-2007-TriebseesB #automation #documentation #embedded #migration #query #semantics #towards: Towards automatic document migration: semantic preservation of embedded queries (TT, UMB), pp. 209–218.
ICDAR-2007-BanerjeeHC #concept #database #documentation #image #query #semantics #word: Word image based latent semantic indexing for conceptual querying in document image databases (SB, GH, SC), pp. 1208–1212.
ICDAR-2007-JoutelEBE #query: Curvelets Based Queries for CBIR Application in Handwriting Collections (GJ, VE, SB, HE), pp. 649–653.
PODS-2007-BadiaV #query: Non-linear prefixes in query languages (AB, SV), pp. 185–194.
PODS-2007-BusscheGV #database #query: A crash course on database queries (JVdB, DVG, SV), pp. 143–154.
PODS-2007-CateL #complexity #query #xpath: The complexity of query containment in expressive fragments of XPath 2.0 (BtC, CL), pp. 73–82.
PODS-2007-CohenDKLT #data type #query #sketching: Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.
PODS-2007-DalviS07a #probability #query: The dichotomy of conjunctive queries on probabilistic structures (NND, DS), pp. 293–302.
PODS-2007-Machlin #array #equivalence #multi #query #safety: Index-based multidimensional array queries: safety and equivalence (RM), pp. 175–184.
PODS-2007-Marx #query: Queries determined by views: pack your views (MM), pp. 23–30.
PODS-2007-MunagalaSW #optimisation #query: Optimization of continuous queries with shared expensive filters (KM, US, JW), pp. 215–224.
PODS-2007-Schweikardt #bound #modelling #query: Machine models and lower bounds for query processing (NS), pp. 41–52.
SIGMOD-2007-AnciauxBBPS #named #query: GhostDB: querying visible and hidden data without leaks (NA, MB, LB, PP, DS), pp. 677–688.
SIGMOD-2007-BeeriEMP #monitoring #process: Query-based monitoring of BPEL business processes (CB, AE, TM, AP), pp. 1122–1124.
SIGMOD-2007-BinnigKLO #database #generative #named #testing: QAGen: generating query-aware test databases (CB, DK, EL, MTÖ), pp. 341–352.
SIGMOD-2007-BravoR #optimisation #probability #query: Optimizing mpf queries: decision support and probabilistic inference (HCB, RR), pp. 701–712.
SIGMOD-2007-ChandramouliBBY #query: Query suspend and resume (BC, CNB, SB, JY), pp. 557–568.
SIGMOD-2007-ChengKNL #database #graph #named #query #towards: Fg-index: towards verification-free query processing on graph databases (JC, YK, WN, AL), pp. 857–872.
SIGMOD-2007-ChenL #navigation: Addressing diverse user preferences in SQL-query-result navigation (ZC, TL), pp. 641–652.
SIGMOD-2007-CongFK #distributed #evaluation #performance #query: Distributed query evaluation with performance guarantees (GC, WF, AK), pp. 509–520.
SIGMOD-2007-CormodeG07a #data type #distributed #query #streaming: Streaming in a connected world: querying and tracking distributed data streams (GC, MNG), pp. 1178–1181.
SIGMOD-2007-FanCB #query #syntax #xml: Querying xml with update syntax (WF, GC, PB), pp. 293–304.
SIGMOD-2007-FangHLYGLS #named #query #using: GPUQP: query co-processing using graphics processors (RF, BH, ML, KY, NKG, QL, PVS), pp. 1061–1063.
SIGMOD-2007-FernandezJMOS #distributed #xquery: Highly distributed XQuery with DXQ (MFF, TJ, KM, NO, JS), pp. 1159–1161.
SIGMOD-2007-HeLLY #in memory #named #query: EaseDB: a cache-oblivious in-memory query processor (BH, YL, QL, DY), pp. 1064–1066.
SIGMOD-2007-HongDGKRW #multi: Massively multi-query join processing in publish/subscribe systems (MH, AJD, JG, CK, MR, WMW), pp. 761–772.
SIGMOD-2007-HuangN #data flow #named #query: K-relevance: a spectrum of relevance for data sources impacting a query (JH, JFN), pp. 163–174.
SIGMOD-2007-HuebschGHS #distributed #query: Sharing aggregate computation for distributed queries (RH, MNG, JMH, IS), pp. 485–496.
SIGMOD-2007-JermaineAPD #approximate #query #scalability: Scalable approximate query processing with the DBO engine (CMJ, SA, AP, AD), pp. 725–736.
SIGMOD-2007-LiCYSJ #adaptation #interface #named #natural language #query #xml: DaNaLIX: a domain-adaptive natural language interface for querying XML (YL, IC, HY, SPS, HVJ), pp. 1165–1168.
SIGMOD-2007-LuoLWZ #database #keyword #named #query #relational: Spark: top-k keyword query in relational databases (YL, XL, WW, XZ), pp. 115–126.
SIGMOD-2007-MishraV #monitoring #named #query: ConEx: a system for monitoring queries (CM, MV), pp. 1076–1078.
SIGMOD-2007-NandiJ #interface #query #using: Assisted querying using instant-response interfaces (AN, HVJ), pp. 1156–1158.
SIGMOD-2007-PetropoulosDP #architecture #interactive #named #query: CLIDE: interactive query formulation for service oriented architectures (MP, AD, YP), pp. 1119–1121.
SIGMOD-2007-QiCS #consistency #data flow #named #nondeterminism #query: FICSR: feedback-based inconsistency resolution and query processing on misaligned data sources (YQ, KSC, MLS), pp. 151–162.
SIGMOD-2007-QiCSK #query #taxonomy: Integrating and querying taxonomies with quest in the presence of conflicts (YQ, KSC, MLS, KWK), pp. 1153–1155.
SIGMOD-2007-SolimanIC #database #evaluation #named #nondeterminism #performance #query: URank: formulation and efficient evaluation of top-k queries in uncertain databases (MAS, IFI, KCCC), pp. 1082–1084.
SIGMOD-2007-TatemuraSPCCAG #query #web #web service: Mashup Feeds: : continuous queries over web services (JT, AS, OP, SC, KSC, DA, MG), pp. 1128–1130.
SIGMOD-2007-TrisslL #graph #performance #query #scalability: Fast and practical indexing and querying of very large graphs (ST, UL), pp. 845–856.
SIGMOD-2007-WyssW #integration #multi #optimisation #query #relational: Extending relational query optimization to dynamic schemas for information integration in multidatabases (CMW, FIW), pp. 473–484.