Sciweavers

1445 search results - page 92 / 289
» XPath query containment
Sort
View
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
15 years 10 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
SIGMOD
2007
ACM
219views Database» more  SIGMOD 2007»
15 years 10 months ago
Efficient exploitation of similar subexpressions for query processing
Complex queries often contain common or similar subexpressions, either within a single query or among multiple queries submitted as a batch. If so, query execution time can be imp...
Jingren Zhou, Johann Christoph Freytag, Per-Å...
WWW
2010
ACM
15 years 4 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura
CIKM
2010
Springer
14 years 8 months ago
Reverted indexing for feedback and expansion
Traditional interactive information retrieval systems function by creating inverted lists, or term indexes. For every term in the vocabulary, a list is created that contains the d...
Jeremy Pickens, Matthew Cooper, Gene Golovchinsky
WAIM
2010
Springer
14 years 7 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan