Sciweavers

123 search results - page 2 / 25
» Incremental Reorganization of Relational Databases
Sort
View
SIGMOD
2005
ACM
215views Database» more  SIGMOD 2005»
14 years 5 months ago
Nested intervals tree encoding in SQL
Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without acc...
Vadim Tropashko
CIDR
2007
100views Algorithms» more  CIDR 2007»
13 years 6 months ago
Database Cracking
Database indices provide a non-discriminative navigational infrastructure to localize tuples of interest. Their maintenance cost is taken during database updates. In this paper, w...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
13 years 12 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend
VLDB
2007
ACM
144views Database» more  VLDB 2007»
13 years 11 months ago
A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Je...
DBPL
1997
Springer
87views Database» more  DBPL 1997»
13 years 9 months ago
Incremental Recomputation of Recursive Queries with Nested Sets and Aggregate Functions
We examine the power of incremental evaluation systems that use an SQL-like language for maintaining recursively-de ned views. We show that recursive queries such as transitive clo...
Leonid Libkin, Limsoon Wong