loading
Documents

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Qiang Xue 1 ; Sakti Pramanik 1 ; Gang Qian 2 and Qiang Zhu 3

Affiliations: 1 Michigan State University, United States ; 2 University of Central Oklahoma, United States ; 3 The University of Michigan, United States

ISBN: 972-8865-19-8

Keyword(s): Hybrid Digital tree, indexing, string databases, prefix searches, substring searches.

Related Ontology Subjects/Areas/Topics: Coupling and Integrating Heterogeneous Data Sources ; Databases and Information Systems Integration ; Enterprise Information Systems

Abstract: There is an increasing demand for efficient indexing techniques to support queries on large string databases. In this paper, a hybrid RAM/disk-based index structure, called the Hybrid Digital tree (HD-tree), is proposed. The HD-tree keeps internal nodes in the RAM to minimize the number of disk I/Os, while maintaining leaf nodes on the disk to maximize the capability of the tree for indexing large databases. Experimental results using real data have shown that the HD-tree outperformed the Prefix B-tree for prefix and substring searches. In particular, for distinctive random queries in the experiments, the average number of disk I/Os was reduced by a factor of two to three, while the running time was reduced in an order of magnitude.

PDF ImageFull Text

Download
Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.87.147.184

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Xue Q.; Pramanik S.; Qian G.; Zhu Q. and (2005). THE HYBRID DIGITAL TREE: A NEW INDEXING TECHNIQUE FOR LARGE STRING DATABASES.In Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS, ISBN 972-8865-19-8, pages 115-121. DOI: 10.5220/0002518501150121

@conference{iceis05,
author={Qiang Xue and Sakti Pramanik and Gang Qian and Qiang Zhu},
title={THE HYBRID DIGITAL TREE: A NEW INDEXING TECHNIQUE FOR LARGE STRING DATABASES},
booktitle={Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,},
year={2005},
pages={115-121},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002518501150121},
isbn={972-8865-19-8},
}

TY - CONF

JO - Proceedings of the Seventh International Conference on Enterprise Information Systems - Volume 1: ICEIS,
TI - THE HYBRID DIGITAL TREE: A NEW INDEXING TECHNIQUE FOR LARGE STRING DATABASES
SN - 972-8865-19-8
AU - Xue, Q.
AU - Pramanik, S.
AU - Qian, G.
AU - Zhu, Q.
PY - 2005
SP - 115
EP - 121
DO - 10.5220/0002518501150121

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.