Sciweavers

19 search results - page 3 / 4
» Efficient Bulk Deletes in Relational Databases
Sort
View
SIGMOD
2009
ACM
291views Database» more  SIGMOD 2009»
14 years 6 months ago
Partial join order optimization in the paraccel analytic database
The ParAccel Analytic DatabaseTM is a fast shared-nothing parallel relational database system with a columnar orientation, adaptive compression, memory-centric design, and an enha...
Yijou Chen, Richard L. Cole, William J. McKenna, S...
VLDB
2003
ACM
156views Database» more  VLDB 2003»
14 years 6 months ago
Watermarking relational data: framework, algorithms and analysis
We enunciate the need for watermarking database relations to deter data piracy, identify the characteristics of relational data that pose unique challenges for watermarking, and de...
Rakesh Agrawal, Peter J. Haas, Jerry Kiernan
SIGMOD
1996
ACM
112views Database» more  SIGMOD 1996»
13 years 10 months ago
Performance Tradeoffs for Client-Server Query Processing
The constructionof high-performance databasesystems that combine the best aspects of the relational and object-oriented approaches requires the design of client-server architectur...
Michael J. Franklin, Björn Þór J...
CIKM
2006
Springer
13 years 9 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...
ICDE
1996
IEEE
103views Database» more  ICDE 1996»
14 years 7 months ago
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
Martin Sköld, Tore Risch