958 search results - page 100 / 192 » Efficient data structures for range-aggregate queries on tre... |
162
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We propose XSEED, a synopsis of path queries for cardinality estimation that is accurate, robust, efficient, and adaptive to memory budgets. XSEED starts from a very small kernel,...
EDBT
2006
ACM
15 years 10 months ago
2006
ACM
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
TALG
2008
14 years 10 months ago
2008
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
172
click to vote
GIS
2006
ACM
15 years 11 months ago
2006
ACM
Geography Markup Language (GML) is an XML-based language for the markup, storage, and exchange of geospatial data. It provides a rich geospatial vocabulary and allows flexible doc...
121
click to vote
CORR
2010
Springer
14 years 5 months ago
2010
Springer
In this paper we describe a new efficient (in fact optimal) data structure for the top-K color problem. Each element of an array A is assigned a color c with priority p(c). For a ...