Sciweavers

1567 search results - page 93 / 314
» Compressing Relations and Indexes
Sort
View
XSYM
2005
Springer
154views Database» more  XSYM 2005»
14 years 2 months ago
An Extended Preorder Index for Optimising XPath Expressions
Many of the problems with native XML databases relate to query performance and subsequently, it can be difficult to convince traditional database users of the benefits of using se...
Martin F. O'Connor, Zohra Bellahsene, Mark Roantre...
WEBDB
2004
Springer
170views Database» more  WEBDB 2004»
14 years 2 months ago
Content and Structure in Indexing and Ranking XML
Rooted in electronic publishing, XML is now widely used for modelling and storing structured text documents. Especially in the WWW, retrieval of XML documents is most useful in co...
Felix Weigel, Holger Meuss, Klaus U. Schulz, Fran&...
EDBT
2006
ACM
112views Database» more  EDBT 2006»
14 years 9 months ago
Indexing Shared Content in Information Retrieval Systems
Abstract. Modern document collections often contain groups of documents with overlapping or shared content. However, most information retrieval systems process each document separa...
Andrei Z. Broder, Nadav Eiron, Marcus Fontoura, Mi...
VLDB
2001
ACM
153views Database» more  VLDB 2001»
14 years 1 months ago
A Fast Index for Semistructured Data
Queries navigate semistructured data via path expressions, and can be accelerated using an index. Our solution encodes paths as strings, and inserts those strings into a special i...
Brian F. Cooper, Neal Sample, Michael J. Franklin,...
ADC
2000
Springer
326views Database» more  ADC 2000»
14 years 1 months ago
T-Tree or B-Tree: Main Memory Database Index Structure Revisited
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
Hongjun Lu, Yuet Yeung Ng, Zengping Tian