Sciweavers

552 search results - page 49 / 111
» Efficient Algorithms for Processing XPath Queries
Sort
View
CIKM
2004
Springer
15 years 8 months ago
Using a compact tree to index and query XML data
Indexing XML is crucial for efficient XML query processing. We propose a compact tree (Ctree) for XML indexing, which provides not only concise path summaries at group level but a...
Qinghua Zou, Shaorong Liu, Wesley W. Chu
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 2 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald
127
Voted
VLDB
1991
ACM
134views Database» more  VLDB 1991»
15 years 6 months ago
Extending the Search Strategy in a Query Optimizer
In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
Rosana S. G. Lanzelotte, Patrick Valduriez
133
Voted
CIKM
2008
Springer
15 years 4 months ago
Efficient and effective link analysis with precomputed salsa maps
SALSA is a link-based ranking algorithm that takes the result set of a query as input, extends the set to include additional neighboring documents in the web graph, and performs a...
Marc Najork, Nick Craswell
146
Voted
DATESO
2008
131views Database» more  DATESO 2008»
15 years 4 months ago
Towards Cost-based Optimizations of Twig Content-based Queries
Abstract In recent years, many approaches to indexing XML data have appeared. These approaches attempt to process XML queries efficiently and sufficient query plans are built for t...
Michal Krátký, Radim Baca