Smart indexes for efficient browsing of library collections

S. Geffner, D. Agrawal, A. El Abbadi, T. Smith, M. Larsgaard

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

To enable efficient browsing and interactive querying of very large collections, such as those found in digital libraries, it is essential to provide users with summaries of query result sets. Smart indexes can be used to generate summary statistics, aggregated classification information, and/or aggregated content-based information for the result sets of arbitrary queries. We present the basic model of a smart index, as well as variations of smart indexes that are suitable when the size of summaries is large. An algorithm for generating summaries of the results of arbitrary queries is given, and algorithms for updating various summaries are discussed. Experimental results show that smart indexes generate summaries much more efficiently than traditional trees for all query areas greater than 1%-2% of the data space, with a relatively small additional storage overhead. Contrary to traditional trees, smart indexes in general perform better as the query area grows larger.

Original languageEnglish
Title of host publicationProceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL
Editors Anon
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages107-116
Number of pages10
Publication statusPublished - 1 Jan 1998
Externally publishedYes
EventProceedings of the 1998 IEEE Forum on Research and Technology Advances in Digital Libraries, IEEE ADL'98 - Santa Barbara, CA, USA
Duration: 22 Apr 199824 Apr 1998

Other

OtherProceedings of the 1998 IEEE Forum on Research and Technology Advances in Digital Libraries, IEEE ADL'98
CitySanta Barbara, CA, USA
Period22/4/9824/4/98

Fingerprint

Digital libraries
Statistics
Query

ASJC Scopus subject areas

  • Management of Technology and Innovation

Cite this

Geffner, S., Agrawal, D., El Abbadi, A., Smith, T., & Larsgaard, M. (1998). Smart indexes for efficient browsing of library collections. In Anon (Ed.), Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL (pp. 107-116). Piscataway, NJ, United States: IEEE.

Smart indexes for efficient browsing of library collections. / Geffner, S.; Agrawal, D.; El Abbadi, A.; Smith, T.; Larsgaard, M.

Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL. ed. / Anon. Piscataway, NJ, United States : IEEE, 1998. p. 107-116.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Geffner, S, Agrawal, D, El Abbadi, A, Smith, T & Larsgaard, M 1998, Smart indexes for efficient browsing of library collections. in Anon (ed.), Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL. IEEE, Piscataway, NJ, United States, pp. 107-116, Proceedings of the 1998 IEEE Forum on Research and Technology Advances in Digital Libraries, IEEE ADL'98, Santa Barbara, CA, USA, 22/4/98.
Geffner S, Agrawal D, El Abbadi A, Smith T, Larsgaard M. Smart indexes for efficient browsing of library collections. In Anon, editor, Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL. Piscataway, NJ, United States: IEEE. 1998. p. 107-116
Geffner, S. ; Agrawal, D. ; El Abbadi, A. ; Smith, T. ; Larsgaard, M. / Smart indexes for efficient browsing of library collections. Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL. editor / Anon. Piscataway, NJ, United States : IEEE, 1998. pp. 107-116
@inproceedings{ff53e575602146d2bee5ce42a6a406d1,
title = "Smart indexes for efficient browsing of library collections",
abstract = "To enable efficient browsing and interactive querying of very large collections, such as those found in digital libraries, it is essential to provide users with summaries of query result sets. Smart indexes can be used to generate summary statistics, aggregated classification information, and/or aggregated content-based information for the result sets of arbitrary queries. We present the basic model of a smart index, as well as variations of smart indexes that are suitable when the size of summaries is large. An algorithm for generating summaries of the results of arbitrary queries is given, and algorithms for updating various summaries are discussed. Experimental results show that smart indexes generate summaries much more efficiently than traditional trees for all query areas greater than 1{\%}-2{\%} of the data space, with a relatively small additional storage overhead. Contrary to traditional trees, smart indexes in general perform better as the query area grows larger.",
author = "S. Geffner and D. Agrawal and {El Abbadi}, A. and T. Smith and M. Larsgaard",
year = "1998",
month = "1",
day = "1",
language = "English",
pages = "107--116",
editor = "Anon",
booktitle = "Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL",
publisher = "IEEE",

}

TY - GEN

T1 - Smart indexes for efficient browsing of library collections

AU - Geffner, S.

AU - Agrawal, D.

AU - El Abbadi, A.

AU - Smith, T.

AU - Larsgaard, M.

PY - 1998/1/1

Y1 - 1998/1/1

N2 - To enable efficient browsing and interactive querying of very large collections, such as those found in digital libraries, it is essential to provide users with summaries of query result sets. Smart indexes can be used to generate summary statistics, aggregated classification information, and/or aggregated content-based information for the result sets of arbitrary queries. We present the basic model of a smart index, as well as variations of smart indexes that are suitable when the size of summaries is large. An algorithm for generating summaries of the results of arbitrary queries is given, and algorithms for updating various summaries are discussed. Experimental results show that smart indexes generate summaries much more efficiently than traditional trees for all query areas greater than 1%-2% of the data space, with a relatively small additional storage overhead. Contrary to traditional trees, smart indexes in general perform better as the query area grows larger.

AB - To enable efficient browsing and interactive querying of very large collections, such as those found in digital libraries, it is essential to provide users with summaries of query result sets. Smart indexes can be used to generate summary statistics, aggregated classification information, and/or aggregated content-based information for the result sets of arbitrary queries. We present the basic model of a smart index, as well as variations of smart indexes that are suitable when the size of summaries is large. An algorithm for generating summaries of the results of arbitrary queries is given, and algorithms for updating various summaries are discussed. Experimental results show that smart indexes generate summaries much more efficiently than traditional trees for all query areas greater than 1%-2% of the data space, with a relatively small additional storage overhead. Contrary to traditional trees, smart indexes in general perform better as the query area grows larger.

UR - http://www.scopus.com/inward/record.url?scp=0031654751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031654751&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0031654751

SP - 107

EP - 116

BT - Proceedings of the Forum on Research and Technology Advances in Digital Libraries, ADL

A2 - Anon, null

PB - IEEE

CY - Piscataway, NJ, United States

ER -