Sciweavers

91 search results - page 2 / 19
» Rethinking Database Algorithms for Phase Change Memory
Sort
View
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
13 years 10 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
DASFAA
2005
IEEE
112views Database» more  DASFAA 2005»
13 years 10 months ago
Xandy: Detecting Changes on Large Unordered XML Documents Using Relational Databases
Previous works in change detection on XML documents are not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML...
Erwin Leonardi, Sourav S. Bhowmick, Sanjay Kumar M...
DKE
2006
109views more  DKE 2006»
13 years 4 months ago
Xandy: A scalable change detection technique for ordered XML documents using relational databases
Previous work in change detection to XML documents is not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML ...
Erwin Leonardi, Sourav S. Bhowmick
CIDR
2007
144views Algorithms» more  CIDR 2007»
13 years 6 months ago
Cache-Oblivious Query Processing
We propose a radical approach to relational query processing that aims at automatically and consistently achieving a good performance on any memory hierarchy. We believe this auto...
Bingsheng He, Qiong Luo
VLDB
1989
ACM
155views Database» more  VLDB 1989»
13 years 8 months ago
Parallel Processing of Recursive Queries in Distributed Architectures
This paper presents a parallel algorithm for recursive query processing and shows how it can be efficiently implemented in a local computer network. The algorithm relies on an int...
Guy Hulin