92 search results - page 9 / 19 » Conjunctive Query Evaluation by Search Tree Revisited |
ADC
2008
Springer
14 years 1 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
WEBDB
2004
Springer
14 years 22 days ago
2004
Springer
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
SIGIR
2011
ACM
12 years 10 months ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
EMNLP
2010
13 years 5 months ago
2010
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
VLDB
2001
ACM
13 years 11 months ago
2001
ACM
Similarity retrieval mechanisms should utilize generalized quadratic form distance functions as well as the Euclidean distance function since ellipsoid queries parameters may vary...