221 search results - page 37 / 45 » Structure and Value Synopses for XML Data Graphs |
107
click to vote
JACM
2000
15 years 8 days ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
114
Voted
IS
2007
15 years 11 days ago
2007
As data mining techniques are being increasingly applied to non-traditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the req...
121
click to vote
WEBI
2001
Springer
15 years 4 months ago
2001
Springer
As meta-data become of ever more importance to the Web, we will need to start managing such meta-data. We argue that there is a strong need for meta-data validation and aggregation...
125
Voted
ER
2005
Springer
15 years 6 months ago
2005
Springer
Extract-Transform-Load (ETL) workflows are data centric workflows responsible for transferring, cleaning, and loading data from their respective sources to the warehouse. Previous ...
112
click to vote
SPAA
2004
ACM
15 years 5 months ago
2004
ACM
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...