Sciweavers

1231 search results - page 164 / 247
» Updatable Zero-Knowledge Databases
Sort
View
VLDB
2004
ACM
125views Database» more  VLDB 2004»
15 years 4 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
ICDM
2003
IEEE
141views Data Mining» more  ICDM 2003»
15 years 4 months ago
Association Rule Mining in Peer-to-Peer Systems
We extend the problem of association rule mining – a key data mining problem – to systems in which the database is partitioned among a very large number of computers that are ...
Ran Wolff, Assaf Schuster
SSDBM
2000
IEEE
86views Database» more  SSDBM 2000»
15 years 3 months ago
Serving Datacube Tuples from Main Memory
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...
Kenneth A. Ross, Kazi A. Zaman
PODS
2000
ACM
137views Database» more  PODS 2000»
15 years 3 months ago
Query Containment for Data Integration Systems
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
Todd D. Millstein, Alon Y. Levy, Marc Friedman
SIGMOD
1999
ACM
101views Database» more  SIGMOD 1999»
15 years 3 months ago
Join Synopses for Approximate Query Answering
In large data warehousing environments, it is often advantageous to provide fast, approximate answers to complex aggregate queries based on statistical summaries of the full data....
Swarup Acharya, Phillip B. Gibbons, Viswanath Poos...