Sciweavers

1038 search results - page 63 / 208
» Space-Bounded Query Approximation
Sort
View
110
Voted
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 2 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 2 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
ITCC
2003
IEEE
15 years 7 months ago
The Effects of Search Engines and Query Operators on Top Ranked Results
We examine whether the use of query operators changes the documents retrieved by three popular Web search engines. One hundred queries containing query operators were selected fro...
Bernard J. Jansen, Caroline M. Eastman
163
Voted
PODS
2010
ACM
213views Database» more  PODS 2010»
15 years 7 months ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
141
Voted
TKDE
2010
199views more  TKDE 2010»
15 years 26 days ago
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data
—Uncertain data is inherent in various important applications and reverse nearest neighbor (RNN) query is an important query type for many applications. While many different type...
Muhammad Aamir Cheema, Xuemin Lin, Wei Wang 0011, ...