Sciweavers

348 search results - page 38 / 70
» An Efficient Index Lattice for XML Query Evaluation
Sort
View
VLDB
2006
ACM
171views Database» more  VLDB 2006»
14 years 8 months ago
Grid-partition index: a hybrid method for nearest-neighbor queries in wireless location-based services
Abstract Traditional nearest-neighbor (NN) search is based on two basic indexing approaches: object-based indexing and solution-based indexing. The former is constructed based on t...
Baihua Zheng, Jianliang Xu, Wang-Chien Lee, Dik Lu...
VLDB
2004
ACM
98views Database» more  VLDB 2004»
14 years 1 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel
SIGMOD
2003
ACM
98views Database» more  SIGMOD 2003»
14 years 7 months ago
On Relational Support for XML Publishing: Beyond Sorting and Tagging
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
Surajit Chaudhuri, Raghav Kaushik, Jeffrey F. Naug...
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 7 months ago
The TopX DB&IR engine
This paper proposes a demo of the TopX search engine, an extensive framework for unified indexing, querying, and ranking of large collections of unstructured, semistructured, and ...
Martin Theobald, Ralf Schenkel, Gerhard Weikum
SIGMOD
2010
ACM
149views Database» more  SIGMOD 2010»
13 years 2 months ago
On models and query languages for probabilistic processes
Probabilistic processes appear naturally in various contexts, with applications to Business Processes, XML data management and more. Many models for specifying and querying such p...
Daniel Deutch, Tova Milo