Results 1 - 10 of 284

Distributed Evaluation of Continuous Equi-join Queries over Large Structured Overlay Networks

by Stratos Idreos - In ICDE 2006 , 2005
"... ..."
Abstract - Cited by 7 (3 self) - Add to MetaCart
Abstract not found

Evaluating Conjunctive Triple Pattern Queries over Large Structured Overlay Networks

by Erietta Liarou, Stratos Idreos, Manolis Koubarakis - In International Semantic Web Conference, volume 4273 of Lecture
"... Abstract. We study the problem of evaluating conjunctive queries composed of triple patterns over RDF data stored in distributed hash tables. Our goal is to develop algorithms that scale to large amounts of RDF data, distribute the query processing load evenly and incur little network traffic. We pr ..."
Abstract - Cited by 21 (5 self) - Add to MetaCart
Abstract. We study the problem of evaluating conjunctive queries composed of triple patterns over RDF data stored in distributed hash tables. Our goal is to develop algorithms that scale to large amounts of RDF data, distribute the query processing load evenly and incur little network traffic. We

Range Queries in Trie-Structured Overlays

by Anwitaman Datta , Manfred Hauswirth, Renault John, Roman Schmidt, Karl Aberer - IN P2P’05: PROCEEDINGS OF THE 5TH INTERNATIONAL CONFERENCE ON PEER-TO-PEER COMPUTING , 2005
"... Among the open problems in P2P systems, support for non-trivial search predicates, standardized query languages, distributed query processing, query load balancing, and quality of query results have been identified as some of the most relevant issues. This paper describes how range queries as an imp ..."
Abstract - Cited by 41 (5 self) - Add to MetaCart
as an important non-trivial search predicate can be supported in a structured overlay network that provides O(log n) search complexity on top of a trie abstraction. We provide analytical results that show that the proposed approach is efficient, supports arbitrary granularity of ranges, and demonstrate that its

Network-aware operator placement for stream-processing systems

by Peter Pietzuch, Jonathan Ledlie, Jeffrey Shneidman, Mema Roussopoulos, Matt Welsh, Margo Seltzer - In ICDE , 2006
"... To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple filters to custom business logic, are placed manually at intermediate nodes along the transmission path to meet applicat ..."
Abstract - Cited by 143 (9 self) - Add to MetaCart
To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple filters to custom business logic, are placed manually at intermediate nodes along the transmission path to meet

Continuous RDF Query Processing over DHTs ⋆

by Erietta Liarou, Stratos Idreos, Manolis Koubarakis
"... Abstract. We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long-standing queries and receive answers whenever RDF triples satisfying their queries are published. We pr ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
Abstract. We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long-standing queries and receive answers whenever RDF triples satisfying their queries are published. We

Fast replication in content distribution overlays

by Samrat Ganguly, Akhilesh Saxena, Sudeept Bhatnagar, Suman Banerjee, Rauf Izmailov - in Proc. IEEE INFOCOM , 2005
"... Abstract — We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private network. In order to exploit spatial diversity of the underlying network, SPIDER uses an overlay structure composed of de ..."
Abstract - Cited by 13 (2 self) - Add to MetaCart
Abstract — We present SPIDER – a system for fast replication or distribution of large content from a single source to multiple sites interconnected over Internet or via a private network. In order to exploit spatial diversity of the underlying network, SPIDER uses an overlay structure composed

PlanetSim: A New Overlay Network Simulation Framework

by Pedro García, Carles Pairot, Rubén Mondéjar, Jordi Pujol, Helio Tejedor, Robert Rallo - Mühlhäuser Lecture Notes in Computer Science (LNCS), Software Engineering and Middleware (SEM , 2005
"... Abstract. Current research in peer to peer systems is lacking appropriate environments for simulation and experimentation of large scale overlay services. This has led to a plethora of custom made simulators that waste development resources and hinder fair comparisons between different approaches. I ..."
Abstract - Cited by 53 (1 self) - Add to MetaCart
. In this paper we present a new simulation / experimentation framework for large scale overlay services with three main contributions: i) provide a unifying approach to simulation / experimentation that eases the transition from simulation to network testbeds, ii) it clearly distinguish between the design

Resilient Sensor Network Query Processing Using Logical Overlays

by Alan B. Stokes, Alvaro A. A Fernandes, Norman W. Paton
"... The typical nodes used in mote-level wireless sensor networks (WSNs) are often brittle and severely resource-constrained. In particular, nodes are often battery-powered, thereby making energy depletion a significant risk. When changes to the connectivity graph occur as a result of node failure, the ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
, the overall computation may collapse unless it is capable of adapting to the new WSN state. Sensor network query processors (SNQPs) construe a WSN as a distributed, continuous query platform where the streams of sensed values constitute the logical extents of interest. Crucially, in the context of this paper

Processing Set Expressions over Continuous Update Streams

by Sumit Ganguly, Minos Garofalakis, Rajeev Rastogi , 2003
"... There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In its most general form, a data stream is actually an update stream, i.e., comprising data-item deletions as well as insert ..."
Abstract - Cited by 64 (15 self) - Add to MetaCart
as insertions. Such massive update streams arise naturally in several application domains (e.g., monitoring of large IP network installations, or processing of retail-chain transactions). Estimating the cardinality of set expressions dened over several (perhaps, distributed) update streams is perhaps one

Towards Window Stream Queries Over Continuous Phenomena

by J. C. Whittier, Silvia Nittel, Mark A. Plummer, Qinghan Liang
"... Technological advances have created an unprecedented availability of inexpensive sensors capable of streaming environmental data in real-time. Data stream engines (DSE) with tuple processing rates of around 500k tuples/s have demonstrated their ability to both keep up with large numbers of spatio-te ..."
Abstract - Add to MetaCart
-temporal data streams, and execute stream window queries over them efficiently. Typically, geographically distributed sensors take samples asynchronously; however, when approximating the reality of a continuous phenomenon – such as the radiation field over an urban region- the objective is to integrate
Results 1 - 10 of 284