Sciweavers

277 search results - page 51 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
PVLDB
2011
12 years 10 months ago
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores
Adaptive indexing is characterized by the partial creation and refinement of the index as side effects of query execution. Dynamic or shifting workloads may benefit from prelimi...
Stratos Idreos, Stefan Manegold, Harumi A. Kuno, G...
FOCS
2008
IEEE
14 years 2 months ago
Dynamic Connectivity: Connecting to Networks and Geometry
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
Timothy M. Chan, Mihai Patrascu, Liam Roditty
BTW
2007
Springer
133views Database» more  BTW 2007»
13 years 11 months ago
Pathfinder: XQuery Compila-tion Techniques for Relational Database Targets
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...
Jens Teubner
ICDE
1999
IEEE
111views Database» more  ICDE 1999»
14 years 9 months ago
Storage of Multidimensional Arrays Based on Arbitrary Tiling
Storage management of multidimensional arrays aims at supporting the array model needed by applications and insuring fast execution of access operations. Current approaches to sto...
Paula Furtado, Peter Baumann
ACSC
2008
IEEE
14 years 2 months ago
A model, schema, and interface for metadata file systems
Modern computer systems are based on the traditional hierarchical file system model, but typically contain large numbers of files with complex interrelationships. This tradition...
Stijn Dekeyser, Richard Watson, Lasse Motrø...