19 search results - page 1 / 4 » Efficient Bulk Deletes in Relational Databases |
ICDE
2001
IEEE
14 years 8 months ago
2001
IEEE
Many applications require that large amounts of data are deleted from the database ? typically, such bulk deletes are carried out periodically and involve old or out-of-date data....
EXPDB
2006
ACM
14 years 1 months ago
2006
ACM
In data warehousing applications, the ability to efficiently delete large chunks of data from a table is very important. This feature is also known as Rollout. Rollout is generall...
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
We present a framework for designing, in a declarative and flexible way, efficient migration programs and an undergoing implementation of a migration tool called RelOO whose targe...
BNCOD
2004
13 years 8 months ago
2004
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
VLDB
2000
ACM
13 years 10 months ago
2000
ACM
Modern database applications show a growing demand for efficient and dynamic management of intervals, particularly for temporal and spatial data or for constraint handling. Common...