Scalable polyadic queries

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

Abstract

In previous work, the notion of polyadic similarity query was introduced. Normally, similarity queries take a single argument and attempt to find those objects within a large collection which are most similar to that argument. The idea of polyadic queries is to generalise this notion, by taking a number of query arguments, and giving results based on some combination of their characteristics. It was previously shown how polyadic queries could be of use in various contexts.

The initial work on polyadic queries provided a proof of concept but left many unanswered questions. In particular, it did not show a proper semantic basis for the polyadic query function used or how to achieve sub-linear query times for polyadic searches over large data.

Here, we address these issues. This work demonstrates that the polyadic query mechanism can scale to large data, and gives results which are better than those obtained by executing simple queries over each of the arguments individually.
Original languageEnglish
Title of host publicationSimilarity search and applications
Subtitle of host publication17th International conference, SISAP 2024, Providence, RI, USA, November 4–6, 2024, proceedings
EditorsEdgar Chávez, Benjamin Kimia, Jakub Lokoč, Marco Patella, Jan Sedmidubsky
Place of PublicationCham
PublisherSpringer
Pages57-64
ISBN (Electronic)9783031758232
ISBN (Print)9783031758225
DOIs
Publication statusPublished - 25 Oct 2024
Event17th International Conference on Similarity Search and Applications, SISAP 2024 - Providence, United States
Duration: 4 Nov 20246 Nov 2024
Conference number: 17
https://www.sisap.org/2024/

Publication series

NameLecture notes in computer science
PublisherSpringer
Volume15268
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th International Conference on Similarity Search and Applications, SISAP 2024
Abbreviated titleSISAP 2024
Country/TerritoryUnited States
CityProvidence
Period4/11/246/11/24
Internet address

Keywords

  • Similarity search
  • Polyadic query
  • SED
  • MSED

Fingerprint

Dive into the research topics of 'Scalable polyadic queries'. Together they form a unique fingerprint.

Cite this