Skip to content

Research at St Andrews

Querying metric spaces with bit operations

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

Author(s)

Richard Connor, Alan Dearle

School/Research organisations

Abstract

Metric search techniques can be usefully characterised by the time at which distance calculations are performed during a query. Most exact search mechanisms use a “just-in-time” approach where distances are calculated as part of a navigational strategy. An alternative is to use a “one-time” approach, where distances to a fixed set of reference objects are calculated at the start of each query. These distances are typically used to re-cast data and queries into a different space where querying is more efficient, allowing an approximate solution to be obtained.

In this paper we use a “one-time” approach for an exact search mechanism. A fixed set of reference objects is used to define a large set of regions within the original space, and each query is assessed with respect to the definition of these regions. Data is then accessed if, and only if, it is useful for the calculation of the query solution.

As dimensionality increases, the number of defined regions must increase, but the memory required for the exclusion calculation does not. We show that the technique gives excellent performance over the SISAP benchmark data sets, and most interestingly we show how increases in dimensionality may be countered by relatively modest increases in the number of reference objects used.
Close

Details

Original languageEnglish
Title of host publicationSimilarity Search and Applications
Subtitle of host publication11th International Conference, SISAP 2018, Lima, Peru, October 7-9, 2018, Proceedings
EditorsStéphane Marchand-Maillet, Yasin N. Silva, Edgar Chávez
Place of PublicationCham
PublisherSpringer
Pages33-46
Number of pages14
ISBN (Electronic)9783030022242
ISBN (Print)9783030022235
DOIs
StatePublished - 2018
Event11th International Conference on Similarity Search and Applications (SISAP 2018) - Lima, Peru
Duration: 7 Oct 20189 Oct 2018
Conference number: 11
http://www.sisap.org/2018/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11223
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Similarity Search and Applications (SISAP 2018)
Abbreviated titleSISAP 2018
CountryPeru
CityLima
Period7/10/189/10/18
Internet address

Discover related content
Find related publications, people, projects and more using interactive charts.

View graph of relations

Related by author

  1. Linking Scottish vital event records using family groups

    Akgün, Ö., Dearle, A., Kirby, G. N. C., Garrett, E., Dalton, T. S., Christen, P., Dibben, C. J. L. & Williamson, L. E. P. 15 Jan 2019 (Accepted/In press) In : Historical Methods: a Journal of Quantitative and Interdisciplinary History.

    Research output: Contribution to journalArticle

  2. Understanding the linking possibilities in Scottish Records and an algorithmic approach to full linkage

    Dearle, A., Kirby, G. N. C., Lee, W. & Dibben, C. 20 Jun 2018 1 p.

    Research output: Contribution to conferencePaper

  3. Unikernel support for the deployment of light-weight, self-contained, and latency avoiding services

    Jaradat, W., Dearle, A. & Lewis, J. 21 Mar 2018 1 p.

    Research output: Contribution to conferenceAbstract

  4. Using metric space indexing for complete and efficient record linkage

    Akgün, Ö., Dearle, A., Kirby, G. N. C. & Christen, P. 2018 Advances in Knowledge Discovery and Data Mining: 22nd Pacific-Asia Conference, PAKDD 2018, Melbourne, VIC, Australia, June 3-6, 2018, Proceedings, Part III. Phung, D., Tseng, V. S., Webb, G., Ho, B., Ganji, M. & Rashidi, L. (eds.). Cham: Springer, p. 89-101 12 p. (Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence); vol. 10939)

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

ID: 255713686