30 search results - page 5 / 6 » Lookup Tables: Fine-Grained Partitioning for Distributed Dat... |
324
Voted
ICDE
1999
IEEE
16 years 4 months ago
1999
IEEE
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
174
Voted
VLDB
2002
ACM
15 years 3 months ago
2002
ACM
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
167
Voted
ICDE
2006
IEEE
15 years 9 months ago
2006
IEEE
Structured P2P systems based on distributed hash tables are a popular choice for building large-scaled data management systems. Generally, they only support exact match queries, b...
174
Voted
DBISP2P
2004
Springer
15 years 9 months ago
2004
Springer
Distributed Hash Tables (DHTs) have been widely adopted in many Internet-scale P2P systems. Emerging P2P applications such as massively multi player online games (MMOGs) and P2P ca...
120
Voted
DASFAA
2008
IEEE
15 years 10 months ago
2008
IEEE
The DWS (Data Warehouse Striping) technique is a round-robin data partitioning approach especially designed for distributed data warehousing environments. In DWS the fact tables ar...