Sciweavers

1101 search results - page 108 / 221
» Fault-Tolerance in Distributed Query Processing
Sort
View
AINA
2007
IEEE
15 years 4 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...
CIKM
2001
Springer
15 years 2 months ago
Approaches to Collection Selection and Results Merging for Distributed Information Retrieval
We have investigated two major issues in Distributed Information Retrieval (DIR), namely: collection selection and search results merging. While most published works on these two ...
Yves Rasolofo, Faiza Abbaci, Jacques Savoy
SIGMOD
2012
ACM
345views Database» more  SIGMOD 2012»
13 years 9 days ago
Shark: fast data analysis using coarse-grained distributed memory
Shark is a research data analysis system built on a novel rained distributed shared-memory abstraction. Shark marries query processing with deep data analysis, providing a unifie...
Cliff Engle, Antonio Lupher, Reynold Xin, Matei Za...
DEBS
2007
ACM
15 years 1 months ago
Temporal order optimizations of incremental joins for composite event detection
Queries for composite events typically involve the four complementary dimensions of event data, event composition, relationships between events (esp. temporal and causal), and acc...
François Bry, Michael Eckert
CIKM
2005
Springer
15 years 3 months ago
Securing XML data in third-party distribution systems
Web-based third-party architectures for data publishing are today receiving growing attention, due to their scalability and the ability to efficiently manage large numbers of use...
Barbara Carminati, Elena Ferrari, Elisa Bertino