Sciweavers

833 search results - page 54 / 167
» Wallet Databases with Observers
Sort
View
ICDE
1999
IEEE
113views Database» more  ICDE 1999»
14 years 11 months ago
I/O Complexity for Range Queries on Region Data Stored Using an R-tree
In this paper we study the node distribution of an Rtree storing region data, like for instance islands, lakes or human-inhabited areas. We will show that real region datasets are...
Guido Proietti, Christos Faloutsos
VLDB
2004
ACM
139views Database» more  VLDB 2004»
14 years 10 months ago
Amit - the situation manager
: This paper presents the "situation manager", a tool that includes both a language and an efficient run-time execution mechanism, aimed at reducing the complexity of act...
Asaf Adi, Opher Etzion
SIGMOD
2003
ACM
98views Database» more  SIGMOD 2003»
14 years 10 months ago
On Relational Support for XML Publishing: Beyond Sorting and Tagging
In this paper, we study whether the need for efficient XML publishing brings any new requirements for relational query engines, or if sorting query results in the relational engin...
Surajit Chaudhuri, Raghav Kaushik, Jeffrey F. Naug...
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
14 years 10 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna
PODS
2005
ACM
115views Database» more  PODS 2005»
14 years 10 months ago
Histograms revisited: when are histograms the best approximation method for aggregates over joins?
The traditional statistical assumption for interpreting histograms and justifying approximate query processing methods based on them is that all elements in a bucket have the same...
Alin Dobra