Skip to main navigation Skip to search Skip to main content

Database selection for processing k nearest neighbors queries in distributed environments

  • University of Illinois at Chicago

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

20 Scopus citations

Abstract

We consider the processing of digital library queries, consisting of a text component and a structured component in distributed environments. The text component can be processed using techniques given in previous papers such as [7, 8, 11]. In this paper, we concentrate on the processing of the structured component of a distributed query. Histograms are constructed and algorithms are given to provide estimates of the desirabilities of the databases with respect to the given query. Databases are selected in descending order of desirability. An algorithm is also given to select tuples from the selected databases. Experimental results are given to show that the techniques provided here are effective and eficient.

Original languageEnglish
Title of host publicationProceedings of the 1st ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL 2001
PublisherAssociation for Computing Machinery
Pages215-222
Number of pages8
ISBN (Print)1581133456, 9781581133455
DOIs
StatePublished - 2001
Event1st ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL 2001 - Roanoke, VA, United States
Duration: Jun 24 2001Jun 28 2001

Publication series

NameProceedings of the ACM International Conference on Digital Libraries

Conference

Conference1st ACM/IEEE-CS Joint Conference on Digital Libraries, JCDL 2001
Country/TerritoryUnited States
CityRoanoke, VA
Period06/24/0106/28/01

Keywords

  • Database selection
  • Distributed databases
  • K nearest neighbors
  • Query processing

Fingerprint

Dive into the research topics of 'Database selection for processing k nearest neighbors queries in distributed environments'. Together they form a unique fingerprint.

Cite this