Sciweavers

6846 search results - page 385 / 1370
» Querying a summary of database
Sort
View
MDM
2009
Springer
116views Communications» more  MDM 2009»
16 years 1 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
DASFAA
2007
IEEE
172views Database» more  DASFAA 2007»
16 years 1 months ago
Optimizing Multiple In-Network Aggregate Queries in Wireless Sensor Networks
Abstract. In this paper, we explore the feature of sharing partial results of multiple queries to reduce the total number of messages incurred. Those queries sharing their partial ...
Huei-You Yang, Wen-Chih Peng, Chia-Hao Lo
DASFAA
2007
IEEE
202views Database» more  DASFAA 2007»
16 years 1 months ago
Optimizing Moving Queries over Moving Object Data Streams
With the increasing in demand on location-based aware services and RFIDs, efficient processing of continuous queries over moving object streams becomes important. In this paper, w...
Dan Lin, Bin Cui, Dongqing Yang
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
16 years 1 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
VLDB
2007
ACM
144views Database» more  VLDB 2007»
16 years 27 days ago
A Relational Approach to Incrementally Extracting and Querying Structure in Unstructured Data
There is a growing consensus that it is desirable to query over the structure implicit in unstructured documents, and that ideally this capability should be provided incrementally...
Eric Chu, Akanksha Baid, Ting Chen, AnHai Doan, Je...