Sciweavers

493 search results - page 63 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
PODS
1995
ACM
139views Database» more  PODS 1995»
15 years 9 months ago
Normalizing Incomplete Databases
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
Leonid Libkin
AINA
2007
IEEE
16 years 16 days ago
Grid-Aware Evaluation of Regular Path Queries on Spatial Networks
Regular path queries (RPQs), expressed as regular expressions over the alphabet of database edge-labels, are commonly used for guided navigation of graph databases. While convenie...
Zhuo Miao, Dan C. Stefanescu, Alex Thomo
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 11 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
DOLAP
2004
ACM
15 years 11 months ago
Aggregate queries in peer-to-peer OLAP
A peer-to-peer (P2P) data management system consists essentially of a network of peer systems, each maintaining full autonomy over its own data resources. Data exchange between pe...
Mauricio Minuto Espil, Alejandro A. Vaisman
PODS
2004
ACM
98views Database» more  PODS 2004»
16 years 6 months ago
Processing First-Order Queries under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. Given a first-order query Q, the problem is to decide whether there is an equivalent query whi...
Alan Nash, Bertram Ludäscher