Sciweavers

2859 search results - page 354 / 572
» Querying Complex Structured Databases
Sort
View
SIGMOD
2001
ACM
124views Database» more  SIGMOD 2001»
16 years 2 months ago
Space-Efficient Online Computation of Quantile Summaries
An -appro ximate quantile summary of a sequence of N elements is a data structure that can answer quantile queries about the sequence to within a precision of N. We presen t a new...
Michael Greenwald, Sanjeev Khanna
150
Voted
DEXAW
2006
IEEE
153views Database» more  DEXAW 2006»
15 years 8 months ago
Extracting Partition Statistics from Semistructured Data
The effective grouping, or partitioning, of semistructured data is of fundamental importance when providing support for queries. Partitions allow items within the data set that sh...
John N. Wilson, Richard Gourlay, Robert Japp, Math...
ICDT
2001
ACM
114views Database» more  ICDT 2001»
15 years 7 months ago
Subsumption for XML types
XML data is often used (validated, stored, queried, etc) with respect to di erent types. Understanding the relationship between these types can provide important information for ma...
Gabriel M. Kuper, Jérôme Siméo...
166
Voted
ICDT
2011
ACM
232views Database» more  ICDT 2011»
14 years 6 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...
CIKM
2010
Springer
15 years 1 months ago
SHRINK: a structural clustering algorithm for detecting hierarchical communities in networks
Community detection is an important task for mining the structure and function of complex networks. Generally, there are several different kinds of nodes in a network which are c...
Jianbin Huang, Heli Sun, Jiawei Han, Hongbo Deng, ...