Sciweavers

1429 search results - page 26 / 286
» Efficient processing of XPath queries using indexes
Sort
View
ICIP
2001
IEEE
14 years 9 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
EDBT
2004
ACM
313views Database» more  EDBT 2004»
14 years 7 months ago
XQzip: Querying Compressed XML Using Structural Indexing
XML makes data flexible in representation and easily portable on the Web but it also substantially inflates data size as a consequence of using tags to describe data. Although many...
James Cheng, Wilfred Ng
CIKM
2009
Springer
13 years 11 months ago
Scalable indexing of RDF graphs for efficient join processing
Current approaches to RDF graph indexing suffer from weak data locality, i.e., information regarding a piece of data appears in multiple locations, spanning multiple data structur...
George H. L. Fletcher, Peter W. Beck
WWW
2008
ACM
14 years 8 months ago
Using graphics processors for high-performance IR query processing
Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over t...
Shuai Ding, Jinru He, Hao Yan, Torsten Suel
WEBDB
2005
Springer
97views Database» more  WEBDB 2005»
14 years 1 months ago
Towards a Query Language for Multihierarchical XML: Revisiting XPath
In recent years it has been argued that when XML encodings become complex, DOM trees are no longer adequate for query processing. Alternative representations of XML documents, suc...
Ionut Emil Iacob, Alex Dekhtyar