Meta Data Caching Mechanism in Distributed Directory Database Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 6, pp. 1746-1752, Jun. 2000
10.3745/KIPSTE.2000.7.6.1746,   PDF Download:

Abstract

In this paper, a cache mechanism is proposed to improve the speed of query processing in distributed director database systems. To decrease search time of requested objects and query processing time. query requests and results about objects in a remote site are stored in the cache of a local site. Cache system architecture is designed according to the classified information. Cache schema are designed for each cache information. Operational algorithms are developed for meta data cache which has meta data tree. This tree improves the speed of query processing by reducing the scope of search space. Finally, performance evaluation is performed by comparing the proposed cache mechanism with X500.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. W. Lee and J. G. Koh, "Meta Data Caching Mechanism in Distributed Directory Database Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 6, pp. 1746-1752, 2000. DOI: 10.3745/KIPSTE.2000.7.6.1746.

[ACM Style]
Kang Woo Lee and Jin Gwang Koh. 2000. Meta Data Caching Mechanism in Distributed Directory Database Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 6, (2000), 1746-1752. DOI: 10.3745/KIPSTE.2000.7.6.1746.