Treating shared data in a browsing-oriented digital library.

Saved in:

Bibliographic Details
Title:	Treating shared data in a browsing-oriented digital library.
Authors:	Sato, Keizo¹, Nakashima, Makoto¹, Ito, Tetsuro¹
Source:	Systems & Computers in Japan. 12/1/2007, Vol. 38 Issue 14, p79-89. 11p. 1 Black and White Photograph, 5 Diagrams, 2 Charts, 2 Graphs.
Subjects:	Digital libraries, Library browsing, Methodology, Information retrieval, Cost effectiveness
Abstract:	It frequently happens that large amounts of data with various formats on computers are shared by multiple users. However, a method of accessing these data efficiently has not been established. This paper considers a browsing-oriented digital library in which shared data are arranged linearly according to their relationships, and formulates a method of extracting the desired data efficiently. For the data extraction, a browsing method is first described in which relevance possibility is suggested on the basis of the content information and the position information in the directory structure. Then a method is described in which efficient browsing is realized in terms of the relevance judgment cost and the retrieval effectiveness by performing extraction and rearrangement of data with the directory as a unit. The effect of the proposed method was verified by an experiment using data in a university laboratory. A navigator for browsing the shared data has also been designed. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(14): 79–89, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20265 [ABSTRACT FROM AUTHOR]
	Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	It frequently happens that large amounts of data with various formats on computers are shared by multiple users. However, a method of accessing these data efficiently has not been established. This paper considers a browsing-oriented digital library in which shared data are arranged linearly according to their relationships, and formulates a method of extracting the desired data efficiently. For the data extraction, a browsing method is first described in which relevance possibility is suggested on the basis of the content information and the position information in the directory structure. Then a method is described in which efficient browsing is realized in terms of the relevance judgment cost and the retrieval effectiveness by performing extraction and rearrangement of data with the directory as a unit. The effect of the proposed method was verified by an experiment using data in a university laboratory. A navigator for browsing the shared data has also been designed. © 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(14): 79–89, 2007; Published online in Wiley InterScience (<URL>www.interscience.wiley.com</URL>). DOI 10.1002/scj.20265 [ABSTRACT FROM AUTHOR]
ISSN:	08821666
DOI:	10.1002/scj.20265