Sciweavers

2514 search results - page 100 / 503
» On the Computation of Approximations of Database Queries
Sort
View
INFOCOM
2005
IEEE
15 years 12 months ago
Power aware routing for sensor databases
— Wireless sensor networks offer the potential to span and monitor large geographical areas inexpensively. Sensor network databases like TinyDB [1] are the dominant architectures...
Chiranjeeb Buragohain, Divyakant Agrawal, Subhash ...
ICDCSW
2002
IEEE
15 years 11 months ago
DBGlobe: A Data-Centric Approach to Global Computing
In the near future, there will be increasingly powerful computers in smart cards, telephones, and other information appliances. This will create a massive infrastructure composed ...
Alexandros Karakasidis, Evaggelia Pitoura
SSDBM
2010
IEEE
133views Database» more  SSDBM 2010»
15 years 4 months ago
PrefIndex: An Efficient Supergraph Containment Search Technique
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, H...
ALGORITHMICA
2011
15 years 1 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
16 years 7 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang