Sciweavers

610 search results - page 57 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
117
Voted
VLDB
2005
ACM
112views Database» more  VLDB 2005»
15 years 6 months ago
Content-Based Routing: Different Plans for Different Data
Query optimizers in current database systems are designed to pick a single efficient plan for a given query based on current statistical properties of the data. However, different...
Pedro Bizarro, Shivnath Babu, David J. DeWitt, Jen...
PODS
2008
ACM
174views Database» more  PODS 2008»
16 years 22 days ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
192
Voted
GIS
2007
ACM
16 years 1 months ago
TS2-tree - an efficient similarity based organization for trajectory data
The increasingly popular GPS technology and the growing amount of trajectory data it generates create the need for developing applications that efficiently store and query traject...
Petko Bakalov, Eamonn J. Keogh, Vassilis J. Tsotra...
VLDB
2007
ACM
109views Database» more  VLDB 2007»
16 years 25 days ago
FluxCapacitor: Efficient Time-Travel Text Search
An increasing number of temporally versioned text collections is available today with Web archives being a prime example. Search on such collections, however, is often not satisfa...
Klaus Berberich, Srikanta J. Bedathur, Thomas Neum...
184
Voted
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 1 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...