Sciweavers

91 search results - page 15 / 19
» TID Hash Joins
Sort
View
ICDE
2006
IEEE
183views Database» more  ICDE 2006»
14 years 2 months ago
Similarity Queries on Structured Data in Structured Overlays
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...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
PVLDB
2010
85views more  PVLDB 2010»
13 years 7 months ago
Xplus: A SQL-Tuning-Aware Query Optimizer
The need to improve a suboptimal execution plan picked by the query optimizer for a repeatedly run SQL query arises routinely. Complex expressions, skewed or correlated data, and ...
Herodotos Herodotou, Shivnath Babu
SIGMOD
2004
ACM
95views Database» more  SIGMOD 2004»
14 years 8 months ago
Querying at Internet-Scale
We are developing a distributed query processor called PIER, which is designed to run on the scale of the entire Internet. PIER utilizes a Distributed Hash Table (DHT) as its comm...
Brent N. Chun, Joseph M. Hellerstein, Ryan Huebsch...
PERCOM
2006
ACM
14 years 8 months ago
Performance Analysis of Stealth DHT with Mobile Nodes
The advances in wireless networking and the consequent emergence of new applications that wireless networks increasingly support inevitably leads to low capability mobile nodes co...
Andrew MacQuire, Andrew Brampton, Idris A. Rai, La...
AINA
2007
IEEE
14 years 2 months ago
DHTs over Peer Clusters for Distributed Information Retrieval
Distributed Hash Tables (DHTs) are very efficient for querying based on key lookups, if only a small number of keys has to be registered by each individual peer. However, building...
Odysseas Papapetrou, Wolf Siberski, Wolf-Tilo Balk...