Sciweavers

14 search results - page 2 / 3
» Best Effort Query Processing in DHT-based P2P Systems
Sort
View
WAIM
2004
Springer
13 years 10 months ago
DHT Based Searching Improved by Sliding Window
Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Som...
Shen Huang, Gui-Rong Xue, Xing Zhu, Yan-Feng Ge, Y...
P2P
2006
IEEE
229views Communications» more  P2P 2006»
13 years 10 months ago
Cost-Aware Processing of Similarity Queries in Structured Overlays
Large-scale distributed data management with P2P systems requires the existence of similarity operators for queries as we cannot assume that all users will agree on exactly the sa...
Marcel Karnstedt, Kai-Uwe Sattler, Manfred Hauswir...
INFOCOM
2006
IEEE
13 years 10 months ago
Performance of Full Text Search in Structured and Unstructured Peer-to-Peer Systems
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
Yong Yang, Rocky Dunlap, Mike Rexroad, Brian F. Co...
EDBTW
2006
Springer
13 years 8 months ago
Data Stream Sharing
Abstract. Recent research efforts in the fields of data stream processing and data stream management systems (DSMSs) show the increasing importance of processing data streams, e. g...
Richard Kuntschke, Alfons Kemper
ICDE
2010
IEEE
219views Database» more  ICDE 2010»
14 years 4 months ago
PIP: A Database System for Great and Small Expectations
Estimation via sampling out of highly selective join queries is well known to be problematic, most notably in online aggregation. Without goal-directed sampling strategies, samples...
Oliver Kennedy, Christoph Koch