Sciweavers

23 search results - page 3 / 5
» Speed Up Queries in Unstructured Peer-to-Peer Networks
Sort
View
GIS
2006
ACM
14 years 8 months ago
Distance join queries on spatial networks
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
ISAAC
2010
Springer
308views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Levelwise Mesh Sparsification for Shortest Path Queries
Shortest path query is a problem to answer the shortest path from the origin to the destination in short time. The network is fixed, and the goal of the study is to develop efficie...
Yuichiro Miyamoto, Takeaki Uno, Mikio Kubo
FPGA
2006
ACM
100views FPGA» more  FPGA 2006»
13 years 11 months ago
A generic lookup cache architecture for network processing applications
Abstract-- In this paper, we introduce a novel architecture for constructing caches for lookup operations that are used in a variety of network processing applications. The disting...
Janardhan Singaraju, John A. Chandy
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 9 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...
WAIM
2010
Springer
13 years 6 months ago
Query Processing with Materialized Views in a Traceable P2P Record Exchange Framework
Materialized views which are derived from base relations and stored in the database are often used to speed up query processing. In this paper, we leverage them in a traceable peer...
Fengrong Li, Yoshiharu Ishikawa