Sciweavers

294 search results - page 9 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
ICDE
2008
IEEE
161views Database» more  ICDE 2008»
15 years 10 months ago
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data
on Uncertain Data (Extended Abstract) Ming Hua Jian Pei Wenjie Zhang Xuemin Lin Simon Fraser University, Canada The University of New South Wales & NICTA {mhua, jpei}@cs.sfu.c...
Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin
DKE
2006
109views more  DKE 2006»
14 years 9 months ago
Xandy: A scalable change detection technique for ordered XML documents using relational databases
Previous work in change detection to XML documents is not suitable for detecting the changes to large XML documents as it requires a lot of memory to keep the two versions of XML ...
Erwin Leonardi, Sourav S. Bhowmick
JIIS
2006
83views more  JIIS 2006»
14 years 9 months ago
Querying a summary of database
For some years, data summarization techniques have been developed to handle the growth of databases. However these techniques are usually not provided with tools for enduserstoeffi...
W. Amenel Voglozin, Guillaume Raschia, Laurent Ugh...
97
Voted
GEOINFO
2003
14 years 10 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
175
Voted
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
15 years 9 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis