Sciweavers

3935 search results - page 493 / 787
» Database Support for Hypertext
Sort
View
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
16 years 5 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
EDBT
2004
ACM
313views Database» more  EDBT 2004»
16 years 5 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
SIGMOD
2009
ACM
161views Database» more  SIGMOD 2009»
15 years 11 months ago
Dependency-aware reordering for parallelizing query optimization in multi-core CPUs
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
Wook-Shin Han, Jinsoo Lee
SSD
2009
Springer
180views Database» more  SSD 2009»
15 years 11 months ago
Indexing Moving Objects Using Short-Lived Throwaway Indexes
With the exponential growth of moving objects data to the Gigabyte range, it has become critical to develop effective techniques for indexing, updating, and querying these massive ...
Jens Dittrich, Lukas Blunschi, Marcos Antonio Vaz ...
VLDB
2004
ACM
92views Database» more  VLDB 2004»
15 years 10 months ago
Write-Optimized B-Trees
Large writes are beneficial both on individual disks and on disk arrays, e.g., RAID-5. The presented design enables large writes of internal B-tree nodes and leaves. It supports b...
Goetz Graefe