Sciweavers

330 search results - page 5 / 66
» A data abstraction approach for query relaxation
Sort
View
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
14 years 27 days ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
ICDE
2005
IEEE
240views Database» more  ICDE 2005»
14 years 8 months ago
Adaptive Processing of Top-K Queries in XML
The ability to compute top-k matches to XML queries is gaining importance due to the increasing number of large XML repositories. The efficiency of top-k query evaluation relies o...
Amélie Marian, Divesh Srivastava, Nick Koud...
TWC
2011
417views more  TWC 2011»
13 years 1 months ago
A Spatiotemporal Approach for Secure Range Queries in Tiered Sensor Networks
Abstract—We target a two-tier sensor network with resourcerich master nodes at the upper tier and resource-poor sensor nodes at the lower tier. Master nodes collect data from sen...
Jing Shi, Rui Zhang, Yanchao Zhang
IJSNET
2008
130views more  IJSNET 2008»
13 years 7 months ago
SENSTRAC: scalable querying of sensor networks from mobile platforms using tracking-style queries
Abstract-- Future applications running on mobile platforms will sometimes need to query sensors and track sensor data over time. This paper uses the publishsubscribe paradigm as a ...
Stefan Pleisch, Kenneth P. Birman
EDBTW
2004
Springer
14 years 26 days ago
Clustering Structured Web Sources: A Schema-Based, Model-Differentiation Approach
Abstract. The Web has been rapidly “deepened” with the prevalence of databases online. On this “deep Web,” numerous sources are structured, providing schema-rich data– Th...
Bin He, Tao Tao, Kevin Chen-Chuan Chang