1101 search results - page 53 / 221 » Scalable Distributed Data Structures for High-Performance Da... |
146
click to vote
ADC
2008
Springer
15 years 8 months ago
2008
Springer
Existing graph mining algorithms typically assume that the dataset can fit into main memory. As many large graph datasets cannot satisfy this condition, truly scalable graph minin...
124
click to vote
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
129
Voted
CLOUD
2010
ACM
15 years 7 months ago
2010
ACM
Batched stream processing is a new distributed data processing paradigm that models recurring batch computations on incrementally bulk-appended data streams. The model is inspired...
117
click to vote
DEXA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The development of scalable parallel database systems requires the design of efficient algorithms for the join operation which is the most frequent and expensive operatio...
PODS
2006
ACM
16 years 2 months ago
2006
ACM
A k-set structure over data streams is a bounded-space data structure that supports stream insertion and deletion operations and returns the set of (item, frequency) pairs in the s...