Sciweavers

1429 search results - page 125 / 286
» Efficient processing of XPath queries using indexes
Sort
View
IDEAS
2007
IEEE
135views Database» more  IDEAS 2007»
14 years 3 months ago
Bitmap Index Design Choices and Their Performance Implications
Historically, bitmap indexing has provided an important database capability to accelerate queries. However, only a few database systems have implemented these indexes because of t...
Elizabeth J. O'Neil, Patrick E. O'Neil, Kesheng Wu
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 9 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
EDBT
2008
ACM
169views Database» more  EDBT 2008»
14 years 9 months ago
Efficient online top-K retrieval with arbitrary similarity measures
The top-k retrieval problem requires finding k objects most similar to a given query object. Similarities between objects are most often computed as aggregated similarities of the...
Prasad M. Deshpande, Deepak P, Krishna Kummamuru
ICDE
2002
IEEE
130views Database» more  ICDE 2002»
14 years 10 months ago
Structural Joins: A Primitive for Efficient XML Query Pattern Matching
XML queries typically specify patterns of selection predicates on multiple elements that have some specified tree structured relationships. The primitive tree structured relations...
Shurug Al-Khalifa, H. V. Jagadish, Jignesh M. Pate...
TREC
1994
13 years 10 months ago
Indexing Structures Derived from Syntax in TREC-3: System Description
: This paper describes an approach to information retrieval based on a syntactic analysis of the document texts and user queries, and from that analysis, the construction of tree s...
Alan F. Smeaton, Ruairi O'Donnell, Fergus Kelledy