Sciweavers

9683 search results - page 584 / 1937
» Predicting query performance
Sort
View
WMCSA
2002
IEEE
16 years 4 days ago
Supporting Aggregate Queries Over Ad-Hoc Wireless Sensor Networks
We show how the database community’s notion of a generic query interface for data aggregation can be applied to ad-hoc networks of sensor devices. As has been noted in the senso...
Samuel Madden, Robert Szewczyk, Michael J. Frankli...
SSD
2001
Springer
112views Database» more  SSD 2001»
15 years 11 months ago
K-Nearest Neighbor Search for Moving Query Point
Abstract. This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research an...
Zhexuan Song, Nick Roussopoulos
CIKM
2006
Springer
15 years 11 months ago
Approximate reverse k-nearest neighbor queries in general metric spaces
In this paper, we propose an approach for efficient approximative RkNN search in arbitrary metric spaces where the value of k is specified at query time. Our method uses an approx...
Elke Achtert, Christian Böhm, Peer Kröge...
DEXA
2006
Springer
118views Database» more  DEXA 2006»
15 years 11 months ago
Using an Oracle Repository to Accelerate XPath Queries
One of the problems associated with XML databases is the poor performance of XPath queries. Although this has attracted much attention by the research community, solutions are eith...
Colm Noonan, Cian Durrigan, Mark Roantree
DLOG
2007
15 years 9 months ago
Exploiting Conjunctive Queries in Description Logic Programs
We present cq-programs, which enhance nonmonotonic description logics (dl-) programs by conjunctive queries (CQ) and union of conjunctive queries (UCQ) over Description Logics kno...
Thomas Eiter, Giovambattista Ianni, Thomas Krennwa...