Sciweavers

486 search results - page 44 / 98
» An Efficient Path Index for Querying Semi-structured Data
Sort
View
DPD
2006
141views more  DPD 2006»
14 years 12 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
FCSC
2007
131views more  FCSC 2007»
14 years 11 months ago
SONNET: subscription using path queries over structured overlay networks
Application-level content-based routing using XML is a key technology for decentralized publish/subscribe systems. In this paper, a new approach is proposed to support the efficien...
Weining Qian, Linhao Xu, Aoying Zhou, Minqi Zhou
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
16 years 1 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
ICDE
2007
IEEE
192views Database» more  ICDE 2007»
16 years 1 months ago
APLA: Indexing Arbitrary Probability Distributions
The ability to store and query uncertain information is of great benefit to databases that infer values from a set of observations, including databases of moving objects, sensor r...
Vebjorn Ljosa, Ambuj K. Singh
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
15 years 11 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...