240 search results - page 11 / 48 » A Fast Index for Semistructured Data |
WIDM
2004
ACM
15 years 3 months ago
2004
ACM
In this paper, we propose a novel compact tree (Ctree) for XML indexing, which provides not only concise path summaries at the group level but also detailed child-parent links at ...
CLUSTER
2003
IEEE
15 years 3 months ago
2003
IEEE
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
ICDE
1992
IEEE
15 years 1 months ago
1992
IEEE
This paper presents two algorithms for maintaining Btree index consistency in a DBMS which does not use write-ahead logging (WAL). One algorithm is similar to shadow paging, but i...
VLDB
1994
ACM
15 years 1 months ago
1994
ACM
Full-text information retrieval systems have traditionally been designed for archival environments. They often provide little or no support for adding new documents to an existing...
118
click to vote
KAIS
2000
14 years 9 months ago
2000
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...