Sciweavers

1101 search results - page 87 / 221
» Fault-Tolerance in Distributed Query Processing
Sort
View
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 10 months ago
Ranking distributed probabilistic data
Ranking queries are essential tools to process large amounts of probabilistic data that encode exponentially many possible deterministic instances. In many applications where unce...
Feifei Li, Ke Yi, Jeffrey Jestes
ICDCS
2007
IEEE
15 years 4 months ago
Two-Tier Multiple Query Optimization for Sensor Networks
When there are multiple queries posed to the resourceconstrained wireless sensor network, it is critical to process them efficiently. In this paper, we propose a Two-Tier Multipl...
Shili Xiang, Hock-Beng Lim, Kian-Lee Tan, Yongluan...
CIDR
2007
165views Algorithms» more  CIDR 2007»
14 years 11 months ago
A Black-Box Approach to Query Cardinality Estimation
We present a “black-box” approach to estimating query cardinality that has no knowledge of query execution plans and data distribution, yet provides accurate estimates. It doe...
Tanu Malik, Randal C. Burns, Nitesh V. Chawla
CIKM
2008
Springer
14 years 11 months ago
Estimating the number of answers with guarantees for structured queries in p2p databases
Structured P2P overlays supporting standard database functionalities are a popular choice for building large-scale distributed data management systems. In such systems, estimating...
Marcel Karnstedt, Kai-Uwe Sattler, Michael Ha&szli...
IPPS
2008
IEEE
15 years 4 months ago
Towards feasibility and scalability of text search in peer-to-peer systems
— In this paper, we introduce a search engine, Dgoogle, designed for large scale P2P systems. Dgoogle is purely text-based, does not organize documents based on pre-defined keyw...
A. Lal, V. Gupta, Khaled Harfoush, Injong Rhee