Sciweavers

785 search results - page 16 / 157
» Efficient Processing of Top-k Queries in Uncertain Databases
Sort
View
EDBT
2009
ACM
174views Database» more  EDBT 2009»
14 years 2 months ago
Continuous probabilistic nearest-neighbor queries for uncertain trajectories
This work addresses the problem of processing continuous nearest neighbor (NN ) queries for moving objects trajectories when the exact position of a given object at a particular t...
Goce Trajcevski, Roberto Tamassia, Hui Ding, Peter...
ICEIS
2002
IEEE
14 years 16 days ago
Managing Uncertain Trajectories of Moving Objects with Domino
: This work describes the features of the DOMINO (Database fOr MovINg Objects) system, which brings several novelties to the problem of managing moving objects databases. Our robus...
Goce Trajcevski, Ouri Wolfson, Hu Cao, Hai Lin, Fe...
ICDE
2009
IEEE
278views Database» more  ICDE 2009»
14 years 9 months ago
Probabilistic Skyline Operator over Sliding Windows
Abstract-- Skyline computation has many applications including multi-criteria decision making. In this paper, we study the problem of efficient processing of continuous skyline que...
Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang 001...
PODS
2006
ACM
98views Database» more  PODS 2006»
14 years 7 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch
ADBIS
2004
Springer
133views Database» more  ADBIS 2004»
14 years 1 months ago
Evaluation of the Mine-Merge Method for Data Mining Query Processing
In this paper we consider concurrent execution of multiple data mining queries in the context of discovery of frequent itemsets. If such data mining queries operate on similar part...
Marek Wojciechowski, Maciej Zakrzewicz