File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces

TitleAn efficient cost model for optimization of nearest neighbor search in low and medium dimensional spaces
Authors
KeywordsInformation storage and retrieval
Selection process
Issue Date2004
PublisherI E E E. The Journal's web site is located at http://www.computer.org/tkde
Citation
Ieee Transactions On Knowledge And Data Engineering, 2004, v. 16 n. 10, p. 1169-1184 How to Cite?
Abstract
Existing models for nearest neighbor search in multidimensional spaces are not appropriate for query optimization because they either lead to erroneous estimation or involve complex equations that are expensive to evaluate in real-time. This paper proposes an alternative method that captures the performance of nearest neighbor queries using approximation. For uniform data, our model involves closed formulae that are very efficient to compute and accurate for up to 10 dimensions. Further, the proposed equations can be applied on nonuniform data with the aid of histograms. We demonstrate the effectiveness of the model by using it to solve several optimization problems related to nearest neighbor search.
Persistent Identifierhttp://hdl.handle.net/10722/43627
ISSN
2013 Impact Factor: 1.815
2013 SCImago Journal Rankings: 1.763
References

 

DC FieldValueLanguage
dc.contributor.authorTao, Yen_HK
dc.contributor.authorZhang, Jen_HK
dc.contributor.authorPapadias, Den_HK
dc.contributor.authorMamoulis, Nen_HK
dc.date.accessioned2007-03-23T04:50:47Z-
dc.date.available2007-03-23T04:50:47Z-
dc.date.issued2004en_HK
dc.identifier.citationIeee Transactions On Knowledge And Data Engineering, 2004, v. 16 n. 10, p. 1169-1184en_HK
dc.identifier.issn1041-4347en_HK
dc.identifier.urihttp://hdl.handle.net/10722/43627-
dc.description.abstractExisting models for nearest neighbor search in multidimensional spaces are not appropriate for query optimization because they either lead to erroneous estimation or involve complex equations that are expensive to evaluate in real-time. This paper proposes an alternative method that captures the performance of nearest neighbor queries using approximation. For uniform data, our model involves closed formulae that are very efficient to compute and accurate for up to 10 dimensions. Further, the proposed equations can be applied on nonuniform data with the aid of histograms. We demonstrate the effectiveness of the model by using it to solve several optimization problems related to nearest neighbor search.en_HK
dc.format.extent1486069 bytes-
dc.format.extent26624 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/msword-
dc.languageengen_HK
dc.publisherI E E E. The Journal's web site is located at http://www.computer.org/tkdeen_HK
dc.relation.ispartofIEEE Transactions on Knowledge and Data Engineeringen_HK
dc.rights©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectInformation storage and retrievalen_HK
dc.subjectSelection processen_HK
dc.titleAn efficient cost model for optimization of nearest neighbor search in low and medium dimensional spacesen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1041-4347&volume=16&issue=10&spage=1169&epage=1184&date=2004&atitle=An+efficient+cost+model+for+optimization+of+nearest+neighbor+search+in+low+and+medium+dimensional+spacesen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TKDE.2004.48en_HK
dc.identifier.scopuseid_2-s2.0-13844298845en_HK
dc.identifier.hkuros103327-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-13844298845&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume16en_HK
dc.identifier.issue10en_HK
dc.identifier.spage1169en_HK
dc.identifier.epage1184en_HK
dc.publisher.placeUnited Statesen_HK
dc.identifier.scopusauthoridTao, Y=7402420191en_HK
dc.identifier.scopusauthoridZhang, J=14030943100en_HK
dc.identifier.scopusauthoridPapadias, D=7005757795en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats