Sciweavers

707 search results - page 34 / 142
» Processing queries on tree-structured data efficiently
Sort
View
CIKM
2006
Springer
13 years 10 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
14 years 10 months ago
XML processing in DHT networks
We study the scalable management of XML data in P2P networks based on distributed hash tables (DHTs). We identify performance limitations in this context, and propose an array of t...
Serge Abiteboul, Ioana Manolescu, Neoklis Polyzoti...
ICDE
2010
IEEE
248views Database» more  ICDE 2010»
14 years 8 months ago
Similarity Search on Supergraph Containment
A supergraph containment search is to retrieve the data graphs contained by a query graph. In this paper, we study the problem of efficiently retrieving all data graphs approximate...
Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ry...
DEXAW
2004
IEEE
206views Database» more  DEXAW 2004»
14 years 11 days ago
Adaptive Query Processing and the Grid: Opportunities and Challenges
Grid technologies have been developed in response to an increase in demand for computing applications designed to yield the benefits from collaboration, data sharing and sophistic...
Anastasios Gounaris, Norman W. Paton, Rizos Sakell...
SIGMOD
2008
ACM
150views Database» more  SIGMOD 2008»
14 years 8 months ago
Ranking queries on uncertain data: a probabilistic threshold approach
Uncertain data is inherent in a few important applications such as environmental surveillance and mobile object tracking. Top-k queries (also known as ranking queries) are often n...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin