Sciweavers

735 search results - page 100 / 147
» Query Optimization In Compressed Database Systems
Sort
View
VLDB
2002
ACM
141views Database» more  VLDB 2002»
14 years 9 months ago
Data page layouts for relational databases on deep memory hierarchies
Relational database systems have traditionally optimized for I/O performance and organized records sequentially on disk pages using the N-ary Storage Model (NSM) (a.k.a., slotted ...
Anastassia Ailamaki, David J. DeWitt, Mark D. Hill
VLDB
1989
ACM
88views Database» more  VLDB 1989»
14 years 1 months ago
Estimating the Size of Generalized Transitive Closures
We present a framework for the estimation of the size of binary recursively defined relations. We show how the framework can be used to provide estimating algo rithms for the size...
Richard J. Lipton, Jeffrey F. Naughton
VLDB
2007
ACM
137views Database» more  VLDB 2007»
14 years 3 months ago
Detecting Attribute Dependencies from Query Feedback
Real-world datasets exhibit a complex dependency structure among the data attributes. Learning this structure is a key task in automatic statistics configuration for query optimi...
Peter J. Haas, Fabian Hueske, Volker Markl
PODS
2009
ACM
130views Database» more  PODS 2009»
14 years 9 months ago
Secondary indexing in one dimension: beyond b-trees and bitmap indexes
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
Rasmus Pagh, Srinivasa Rao Satti
VLDB
2001
ACM
153views Database» more  VLDB 2001»
14 years 1 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...