Sciweavers

707 search results - page 38 / 142
» Processing queries on tree-structured data efficiently
Sort
View
ICDE
2009
IEEE
198views Database» more  ICDE 2009»
14 years 10 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...
ICDE
2008
IEEE
135views Database» more  ICDE 2008»
14 years 10 months ago
Online Filtering, Smoothing and Probabilistic Modeling of Streaming data
In this paper, we address the problem of extending a relational database system to facilitate efficient real-time application of dynamic probabilistic models to streaming data. he ...
Bhargav Kanagal, Amol Deshpande
CAISE
2006
Springer
14 years 11 days ago
An Efficient Approach to Support Querying Secure Outsourced XML Information
Abstract. Data security is well-recognized a vital issue in an information system that is supported in an outsource environment. However, most of conventional XML encryption propos...
Yin Yang, Wilfred Ng, Ho Lam Lau, James Cheng
CIDR
2009
157views Algorithms» more  CIDR 2009»
13 years 9 months ago
Capturing Data Uncertainty in High-Volume Stream Processing
We present the design and development of a data stream system that captures data uncertainty from data collection to query processing to final result generation. Our system focuse...
Yanlei Diao, Boduo Li, Anna Liu, Liping Peng, Char...
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
14 years 10 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh