Database Selection for Processing k Nearest Neighbors Queries in Distributed Environments.
Saved in:
| Title: | Database Selection for Processing k Nearest Neighbors Queries in Distributed Environments. |
|---|---|
| Language: | English |
| Authors: | Yu, Clement, Sharma, Prasoon, Meng, Weiyi, Qin, Yan |
| Availability: | Association for Computing Machinery, 1515 Broadway, New York NY 10036. Tel: 800-342-6626 (Toll Free); Tel: 212-626-0500; e-mail: acmhelp@acm.org. For full text: http://www1.acm.org/pubs/contents/proceedings/dl/379437/. |
| Peer Reviewed: | N |
| Page Count: | 10 |
| Publication Date: | 2001 |
| Sponsoring Agency: | National Science Foundation, Arlington, VA. |
| Document Type: | Numerical/Quantitative Data Reports - Research Speeches/Meeting Papers |
| Descriptors: | Data Processing, Databases, Electronic Libraries, Information Processing, Information Retrieval, Information Seeking, Online Searching, Online Systems |
| Abstract: | This paper considers the processing of digital library queries, consisting of a text component and a structured component in distributed environments. The paper concentrates on the processing of the structured component of a distributed query. A method is proposed to identify the databases that are likely to be useful for processing any given query and to determine the tuples from each useful site which are necessary for answering the query. In this way, both the communication cost and the local processing costs are saved. One common characteristic of these "k" nearest neighbors queries is that it is not necessary to obtain all the "k" nearest neighbors; it is often sufficient to get most of the "k" neighbors. Experimental results are provided to demonstrate that most of the "k" nearest neighbors (85% to 100%) are obtained using this approach. An average accuracy rate of 94.7% is achieved when the 20 closest neighbors are desired. (Contains 15 references.) (AEF) |
| Entry Date: | 2002 |
| Accession Number: | ED459829 |
| Database: | ERIC |
| FullText | Text: Availability: 0 CustomLinks: – Url: https://eric.ed.gov/contentdelivery/servlet/ERICServlet?accno=ED459829 Name: ERIC Full Text Category: fullText Text: Full Text from ERIC |
|---|---|
| Header | DbId: eric DbLabel: ERIC An: ED459829 AccessLevel: 3 PubType: Electronic Resource PubTypeId: electronicResource PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Database Selection for Processing k Nearest Neighbors Queries in Distributed Environments. – Name: Language Label: Language Group: Lang Data: English – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Yu%2C+Clement%22">Yu, Clement</searchLink><br /><searchLink fieldCode="AR" term="%22Sharma%2C+Prasoon%22">Sharma, Prasoon</searchLink><br /><searchLink fieldCode="AR" term="%22Meng%2C+Weiyi%22">Meng, Weiyi</searchLink><br /><searchLink fieldCode="AR" term="%22Qin%2C+Yan%22">Qin, Yan</searchLink> – Name: Avail Label: Availability Group: Avail Data: Association for Computing Machinery, 1515 Broadway, New York NY 10036. Tel: 800-342-6626 (Toll Free); Tel: 212-626-0500; e-mail: acmhelp@acm.org. For full text: http://www1.acm.org/pubs/contents/proceedings/dl/379437/. – Name: PeerReviewed Label: Peer Reviewed Group: SrcInfo Data: N – Name: Pages Label: Page Count Group: Src Data: 10 – Name: DatePubCY Label: Publication Date Group: Date Data: 2001 – Name: SourceSuprt Label: Sponsoring Agency Group: SrcSuprt Data: National Science Foundation, Arlington, VA. – Name: TypeDocument Label: Document Type Group: TypDoc Data: Numerical/Quantitative Data<br />Reports - Research<br />Speeches/Meeting Papers – Name: Subject Label: Descriptors Group: Su Data: <searchLink fieldCode="DE" term="%22Data+Processing%22">Data Processing</searchLink><br /><searchLink fieldCode="DE" term="%22Databases%22">Databases</searchLink><br /><searchLink fieldCode="DE" term="%22Electronic+Libraries%22">Electronic Libraries</searchLink><br /><searchLink fieldCode="DE" term="%22Information+Processing%22">Information Processing</searchLink><br /><searchLink fieldCode="DE" term="%22Information+Retrieval%22">Information Retrieval</searchLink><br /><searchLink fieldCode="DE" term="%22Information+Seeking%22">Information Seeking</searchLink><br /><searchLink fieldCode="DE" term="%22Online+Searching%22">Online Searching</searchLink><br /><searchLink fieldCode="DE" term="%22Online+Systems%22">Online Systems</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: This paper considers the processing of digital library queries, consisting of a text component and a structured component in distributed environments. The paper concentrates on the processing of the structured component of a distributed query. A method is proposed to identify the databases that are likely to be useful for processing any given query and to determine the tuples from each useful site which are necessary for answering the query. In this way, both the communication cost and the local processing costs are saved. One common characteristic of these "k" nearest neighbors queries is that it is not necessary to obtain all the "k" nearest neighbors; it is often sufficient to get most of the "k" neighbors. Experimental results are provided to demonstrate that most of the "k" nearest neighbors (85% to 100%) are obtained using this approach. An average accuracy rate of 94.7% is achieved when the 20 closest neighbors are desired. (Contains 15 references.) (AEF) – Name: DateEntry Label: Entry Date Group: Date Data: 2002 – Name: AN Label: Accession Number Group: ID Data: ED459829 |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=eric&AN=ED459829 |
| RecordInfo | BibRecord: BibEntity: Languages: – Text: English PhysicalDescription: Pagination: PageCount: 10 Subjects: – SubjectFull: Data Processing Type: general – SubjectFull: Databases Type: general – SubjectFull: Electronic Libraries Type: general – SubjectFull: Information Processing Type: general – SubjectFull: Information Retrieval Type: general – SubjectFull: Information Seeking Type: general – SubjectFull: Online Searching Type: general – SubjectFull: Online Systems Type: general Titles: – TitleFull: Database Selection for Processing k Nearest Neighbors Queries in Distributed Environments. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Yu, Clement – PersonEntity: Name: NameFull: Sharma, Prasoon – PersonEntity: Name: NameFull: Meng, Weiyi – PersonEntity: Name: NameFull: Qin, Yan IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 06 Type: published Y: 2001 |
| ResultId | 1 |