611 search results - page 76 / 123 » Querying Tree-Structured Data Using Dimension Graphs |
135
click to vote
APPML
2007
15 years 6 months ago
2007
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
161
click to vote
VLDB
2000
ACM
15 years 9 months ago
2000
ACM
Primary B+ -tree, a variant of B+ -tree structure with row data in leaf blocks, is an ideal storage organization for queries involving exact match and/or range search on primary k...
186
click to vote
SEDE
2010
15 years 3 months ago
2010
New emerging scientific applications in geosciences, sensor and spatio-temporal domains require adaptive analysis frameworks that can handle large datasets with multiple dimension...
144
click to vote
EDBT
1998
ACM
15 years 10 months ago
1998
ACM
An importantuse of data warehousing is to provide temporal views over the history of source data that may itself be non-temporal. While recent work in view maintenance is applicab...
182
click to vote
INFOCOM
2011
IEEE
14 years 9 months ago
2011
IEEE
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...