Sciweavers

5954 search results - page 259 / 1191
» Querying Bi-level Information
Sort
View
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
16 years 8 months ago
V*-kNN: An Efficient Algorithm for Moving k Nearest Neighbor Queries
This demonstration program presents the V*-kNN algorithm, an efficient algorithm to process moving k nearest neighbor queries (MkNN). The V*-kNN algorithm is based on a safe-region...
Sarana Nutanong, Rui Zhang, Egemen Tanin, Lars Kul...
WWW
2006
ACM
16 years 7 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
EDBT
2006
ACM
206views Database» more  EDBT 2006»
16 years 6 months ago
The SIRUP Ontology Query API in Action
Ontology languages to represent ontologies exist in large numbers, and users who want to access or reuse ontologies can often be confronted with a language they do not know. Theref...
Patrick Ziegler, Christoph Sturm, Klaus R. Dittric...
WOLLIC
2009
Springer
16 years 1 months ago
Query Answering in Description Logics: The Knots Approach
In the recent years, query answering over Description Logic (DL) knowledge bases has been receiving increasing attention, and various methods and techniques have been presented for...
Thomas Eiter, Carsten Lutz, Magdalena Ortiz, Manta...
ADHOCNOW
2008
Springer
16 years 1 months ago
Query Dissemination with Predictable Reachability and Energy Usage in Sensor Networks
Energy-efficient query dissemination plays an important role for the lifetime of sensor networks. In this work, we consider probabilistic flooding for query dissemination and deve...
Zinaida Benenson, Markus Bestehorn, Erik Buchmann,...