Sciweavers

1022 search results - page 80 / 205
» Efficient Query Processing in Large Traffic Networks
Sort
View
COOPIS
2004
IEEE
15 years 8 months ago
Supporting Similarity Operations Based on Approximate String Matching on the Web
Querying and integrating sources of structured data from the Web in most cases requires similarity-based concepts to deal with data level conflicts. This is due to the often errone...
Eike Schallehn, Ingolf Geist, Kai-Uwe Sattler
ICDE
2006
IEEE
163views Database» more  ICDE 2006»
16 years 5 months ago
A Sampling-Based Approach to Optimizing Top-k Queries in Sensor Networks
Wireless sensor networks generate a vast amount of data. This data, however, must be sparingly extracted to conserve energy, usually the most precious resource in battery-powered ...
Adam Silberstein, Carla Schlatter Ellis, Jun Yang ...
WWW
2006
ACM
16 years 5 months ago
Semantic link based top-K join queries in P2P networks
An important issue arising from Peer-to-Peer applications is how to accurately and efficiently retrieve a set of K best matching data objects from different sources while minimizi...
Jie Liu, Liang Feng, Chao He
SIGMOD
2007
ACM
150views Database» more  SIGMOD 2007»
16 years 4 months ago
System design issues in sensor databases
In-network sensor query processing systems (ISQPs), or sensor databases, have been developed to acquire, process and aggregate data from wireless sensor networks (WSNs). Because W...
Qiong Luo, Hejun Wu
ICDE
2009
IEEE
156views Database» more  ICDE 2009»
16 years 6 months ago
Distributed Structural Relaxation of XPath Queries
Due to the structural heterogeneity of XML, queries are often interpreted approximately. This is achieved by relaxing the query and ranking the results based on their relevance to ...
Georgia Koloniari, Evaggelia Pitoura