Sciweavers

2104 search results - page 225 / 421
» Sorting with networks of data structures
Sort
View
AINA
2009
IEEE
16 years 1 months ago
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
Yeim-Kuan Chang, Yung-Chieh Lin
GIS
2005
ACM
16 years 7 months ago
ASPEN: an adaptive spatial peer-to-peer network
Geographic Information Systems (GIS) are increasingly managing very large sets of data and hence a centralized data repository may not always provide the most scalable solution. H...
Haojun Wang, Roger Zimmermann, Wei-Shinn Ku
DBISP2P
2003
Springer
105views Database» more  DBISP2P 2003»
15 years 11 months ago
Distributed Queries and Query Optimization in Schema-Based P2P-Systems
Databases have employed a schema-based approach to store and retrieve structured data for decades. For peer-to-peer (P2P) networks, similar approaches are just beginning to emerge,...
Ingo Brunkhorst, Hadhami Dhraief, Alfons Kemper, W...
IPSN
2007
Springer
16 years 19 days ago
Exact distributed Voronoi cell computation in sensor networks
Distributed computation of Voronoi cells in sensor networks, i.e. computing the locus of points in a sensor field closest to a given sensor, is a key building block that supports...
Boulat A. Bash, Peter Desnoyers
ICDE
2010
IEEE
249views Database» more  ICDE 2010»
16 years 1 months ago
PARINET: A tunable access method for in-network trajectories
— In this paper we propose PARINET, a new access method to efficiently retrieve the trajectories of objects moving in networks. The structure of PARINET is based on a combination...
Iulian Sandu Popa, Karine Zeitouni, Vincent Oria, ...