Sciweavers

313 search results - page 50 / 63
» Data Sufficiency for Queries on Cache
Sort
View
SIGMOD
1991
ACM
104views Database» more  SIGMOD 1991»
13 years 11 months ago
Managing Persistent Objects in a Multi-Level Store
This paper presents an architecture for a persistent object store in which multi-level storage is explicitly included. Traditionally, DBMSs have assumed that all accessible data r...
Michael Stonebraker
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
14 years 9 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
PVLDB
2008
111views more  PVLDB 2008»
13 years 7 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
SSD
2009
Springer
167views Database» more  SSD 2009»
14 years 2 months ago
Continuous Spatial Authentication
Recent advances in wireless communications and positioning devices have generated a tremendous amount of interest in the continuous monitoring of spatial queries. However, such app...
Stavros Papadopoulos, Yin Yang, Spiridon Bakiras, ...
BTW
2007
Springer
121views Database» more  BTW 2007»
14 years 2 months ago
Algorithms for merged indexes
B-tree and index into two layers of abstraction. In addition, this paper provides algorithms for (i) concurrency control and recovery including locking of individual keys and of co...
Goetz Graefe