Sciweavers

493 search results - page 81 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
SIGMOD
1997
ACM
125views Database» more  SIGMOD 1997»
15 years 10 months ago
The Distributed Information Search Component (Disco) and the World Wide Web
The Distributed Information Search COmponent (Disco) is a prototype heterogeneous distributed database that accesses underlying data sources. The Disco prototype currently focuses...
Anthony Tomasic, Rémy Amouroux, Philippe Bo...
PODS
2000
ACM
179views Database» more  PODS 2000»
15 years 10 months ago
Selectivity Estimation for Boolean Queries
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
Zhiyuan Chen, Flip Korn, Nick Koudas, S. Muthukris...
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 11 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
16 years 6 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
SIGIR
1998
ACM
15 years 5 months ago
Exploring the Similarity Space
Ranked queries are used to locate relevant documents in text databases. In a ranked query a list of terms is specified, then the documents that most closely match the query are re...
Justin Zobel, Alistair Moffat