707 search results - page 15 / 142 » Processing queries on tree-structured data efficiently |
WWW
2005
ACM
14 years 9 months ago
2005
ACM
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
SSD
1993
Springer
14 years 20 days ago
1993
Springer
: Due to the high complexity of objects and queries and also due to extremely large data volumes, geographic database systems impose stringent requirements on their storage and acc...
ADBIS
2007
Springer
14 years 2 months ago
2007
Springer
This paper describes a new XML compression scheme that offers both high compression ratios and short query response time. Its core is a fully reversible transform featuring substit...
DASFAA
2007
IEEE
14 years 16 days ago
2007
IEEE
Abstract. In this paper, we present a novel ordered XPATH evaluation in treeunaware RDBMS. The novelties of our approach lies in the followings. (a) We propose a novel XML storage ...
EDBT
2009
ACM
14 years 3 months ago
2009
ACM
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...