Sciweavers

2092 search results - page 40 / 419
» Dynamically Distributed Query Evaluation
Sort
View
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
15 years 6 months ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...
GLOBE
2009
Springer
15 years 7 months ago
AGiDS: A Grid-Based Strategy for Distributed Skyline Query Processing
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. A challenging problem is to support skylin...
João B. Rocha-Junior, Akrivi Vlachou, Chris...
DEBS
2009
ACM
15 years 8 months ago
Processing publish/subscribe queries over distributed data streams
We address the problem of processing continuous multi-join queries, over distributed data streams, making use of existing work in the field of publish/subscribe systems. We show ...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
ESWS
2011
Springer
14 years 5 months ago
FedX: A Federation Layer for Distributed Query Processing on Linked Open Data
Driven by the success of the Linked Open Data initiative today’s Semantic Web is best characterized as a Web of interlinked datasets. Hand in hand with this structure new challen...
Andreas Schwarte, Peter Haase, Katja Hose, Ralf Sc...
NBIS
2007
Springer
15 years 8 months ago
Implementing Range Queries with a Decentralized Balanced Tree over Distributed Hash Tables
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we...
Nuno Lopes, Carlos Baquero