ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Database selection for processing k nearest neighbors queries in distributed environments
Full text PdfPdf (198 KB)
Source International Conference on Digital Libraries archive
Proceedings of the 1st ACM/IEEE-CS joint conference on Digital libraries table of contents
Roanoke, Virginia, United States
Pages: 215 - 222  
Year of Publication: 2001
ISBN:1-58113-345-6
Authors
Clement Yu  Dept. of CS, U. of Illinois at Chicago, Chicago, IL
Prasoon Sharma  Dept. of CS, U. of Illinois at Chicago, Chicago, IL
Weiyi Meng  Dept. of CS, SUNY at Binghamton, Binghamton, NY
Yan Qin  Dept. of CS, U. of Illinois at Chicago, Chicago, IL
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 28,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/379437.379504
What is a DOI?

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 efficient.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
5
6
 
7
S. Gauch, G. Wang, and M. Gomez. Profusion: Intelligent Fusion from Multiple, Distributed Search Engines, Journal of Universal Computer Science, 2, 9, 1996, pp. 637-649.
 
8
 
9
 
10
 
11
 
12
 
13
Networked Computer Science Technical Reference Library (http://cs-tr.cs.cornell.edu/).
 
14
 
15
C. Yu, W. Sun, S. Dao, and D. Keirsey. Determining relationships among attributes for Interoperability of Multidatabase Systems. Proc. of the 1st International Workshop on Interoperability in Multidatabase Systems, Kyoto, Japan, April 1991.

CITED BY  8

Collaborative Colleagues:
Clement Yu: colleagues
Prasoon Sharma: colleagues
Weiyi Meng: colleagues
Yan Qin: colleagues