Sciweavers

709 search results - page 43 / 142
» Efficient Evaluation of All-Nearest-Neighbor Queries
Sort
View
RTCSA
2007
IEEE
16 years 1 days ago
A Continuous Query Index for Processing Queries on RFID Data Stream
RFID middleware systems collect and filter RFID streaming data gathered continuously by numerous readers to process requests from applications. These requests are called continuou...
Jaekwan Park, Bonghee Hong, ChaeHoon Ban
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 7 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
16 years 7 months ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su
BNCOD
2009
145views Database» more  BNCOD 2009»
15 years 6 months ago
A Study of a Positive Fragment of Path Queries: Expressiveness, Normal Form, and Minimization
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
Yuqing Wu, Dirk Van Gucht, Marc Gyssens, Jan Pared...
SIGMOD
1994
ACM
99views Database» more  SIGMOD 1994»
15 years 9 months ago
Optimizing Queries on Files
We present a framework which allows the user to access and manipulate data uniformly, regardless of whether it resides in a database or in the file system (or in both). A key issu...
Mariano P. Consens, Tova Milo