481 search results - page 70 / 97 » Approximate XML Query Answers |
COMPGEOM
2010
ACM
14 years 25 days ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Online Scientific Applications (OSA) require statistical analysis of large multidimensional datasets. Towards this end, we have designed and developed a data storage and retrieval...
TKDE
2010
13 years 6 months ago
2010
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
DASFAA
2007
IEEE
14 years 2 months ago
2007
IEEE
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, Tw...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...