Sciweavers

686 search results - page 110 / 138
» Query Answering in Peer-to-Peer Data Exchange Systems
Sort
View
QEST
2006
IEEE
16 years 6 days ago
Optimization of Cache Expiration Dates in Content Networks
One of the fundamental decisions in content networks is how the information about the existing contents is deployed and accessed. In particular, in many content network architectu...
Héctor Cancela, Pablo Rodríguez-Bocc...
SIGMOBILE
2008
72views more  SIGMOBILE 2008»
15 years 6 months ago
RFID-based networks: exploiting diversity and redundancy
In this article, we outline a research agenda for developing protocols and algorithms for densely populated RFID based systems covering a wide geographic area. This will need mult...
Nitin Vaidya, Samir R. Das
ICDE
1998
IEEE
139views Database» more  ICDE 1998»
15 years 10 months ago
Cost and Imprecision in Modeling the Position of Moving Objects
Consider a database that represents the location of moving objects, such as taxi-cabs (typical query: retrieve the cabs that are currently within 1 mile of 33 Michigan Ave., Chica...
Ouri Wolfson, Sam Chamberlain, Son Dao, Liqin Jian...
CONEXT
2005
ACM
15 years 8 months ago
Location based placement of whole distributed systems
The high bandwidth and low latency of the modern internet has made possible the deployment of distributed computing platforms. The XenoServer platform provides a distributed compu...
David Spence, Jon Crowcroft, Steven Hand, Timothy ...
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang