Sciweavers

277 search results - page 18 / 56
» Opportunistic Data Structures for Range Queries
Sort
View
ICDCN
2009
Springer
14 years 1 months ago
Optimizing Multi-hop Queries in ZigBee Based Multi-sink Sensor Networks
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
Bing Han, Gwendal Simon
EDBTW
2010
Springer
14 years 3 months ago
SPARQL query rewriting for implementing data integration over linked data
There has been lately an increased activity of publishing structured data in RDF due to the activity of the Linked Data community1 . The presence on the Web of such a huge informa...
Gianluca Correndo, Manuel Salvadores, Ian Millard,...
EDBT
2012
ACM
216views Database» more  EDBT 2012»
11 years 11 months ago
Effectively indexing the multi-dimensional uncertain objects for range searching
The range searching problem is fundamental in a wide spectrum of applications such as radio frequency identification (RFID) networks, location based services (LBS), and global po...
Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin
GIR
2006
ACM
14 years 2 months ago
Range-capable Distributed Hash Tables
In this paper, we present a novel indexing data structure called RDHT (Range capable Distributed Hash Table) derived from skip lists and specifically designed for storing and retr...
Alessandro Soro, Cristian Lai
COMPGEOM
2011
ACM
13 years 10 days ago
Three problems about dynamic convex hulls
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
Timothy M. Chan