Sciweavers

303 search results - page 38 / 61
» Using a compact tree to index and query XML data
Sort
View
SSDBM
2003
IEEE
95views Database» more  SSDBM 2003»
14 years 24 days ago
A Quad-Tree Based Multiresolution Approach for Two-dimensional Summary Data
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
ECLIPSE
2006
ACM
14 years 1 months ago
XPlainer-Eclipse: explaining XPath within Eclipse
The popularity of XML has motivated the development of novel XML processing tools many of which embed the XPath language for XML querying, transformation, constraint specificatio...
John W. S. Liu, Mariano P. Consens, Flavio Rizzolo
TKDE
2010
218views more  TKDE 2010»
13 years 2 months ago
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
Yuzhe Tang, Shuigeng Zhou, Jianliang Xu
BTW
2007
Springer
142views Database» more  BTW 2007»
14 years 1 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
ICDE
2009
IEEE
183views Database» more  ICDE 2009»
14 years 9 months ago
Efficient Indices Using Graph Partitioning in RDF Triple Stores
With the advance of the Semantic Web, varying RDF data were increasingly generated, published, queried, and reused via the Web. For example, the DBpedia, a community effort to extr...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...