Sciweavers

184 search results - page 19 / 37
» A new range query algorithm for Universal B-trees
Sort
View
VLDB
2000
ACM
129views Database» more  VLDB 2000»
15 years 3 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
CTRSA
2008
Springer
109views Cryptology» more  CTRSA 2008»
15 years 1 months ago
Super-Efficient Verification of Dynamic Outsourced Databases
We develop new algorithmic and cryptographic techniques for authenticating the results of queries over databases that are outsourced to an untrusted responder. We depart from previ...
Michael T. Goodrich, Roberto Tamassia, Nikos Trian...
WWW
2008
ACM
16 years 14 days ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
ICLP
2009
Springer
16 years 13 days ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...
DOLAP
1999
ACM
15 years 4 months ago
A Cache Filtering Optimisation for Queries to Massive Datasets on Tertiary Storage
We consider a system in which many users run queries to examine subsets of a large object set. The object set is partitioned into files on tape. A single subset of objects will b...
Koen Holtman, Peter van der Stok, Ian Willers