1101 search results - page 54 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
143
click to vote
SBACPAD
2003
IEEE
15 years 7 months ago
2003
IEEE
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
140
click to vote
MIDDLEWARE
2004
Springer
15 years 7 months ago
2004
Springer
Data grids, large scale web applications generating dynamic content and database service providing pose significant scalability challenges to database engines. Replication is the ...
218
click to vote
ICDE
2007
IEEE
16 years 3 months ago
2007
IEEE
We introduce the Haar+ tree: a refined, wavelet-inspired data structure for synopsis construction. The advantages of this structure are twofold: First, it achieves higher synopsis...
129
Voted
WWW
2003
ACM
16 years 3 months ago
2003
ACM
We consider the problem of building a P2P-based search engine for massive document collections. We describe a prototype system called ODISSEA (Open DIStributed Search Engine Archi...
130
click to vote
BTW
2007
Springer
15 years 6 months ago
2007
Springer
: Relational database systems are highly efficient hosts to table-shaped data. It is all the more interesting to see how a careful inspection of both, the XML tree structure as wel...