Gå til søgefeltetSpring over til navigationSpring til hovedindhold

Bit-Vector Search Filtering with Application to a Kanji Dictionary

  • Matthew Skala
Publikation:
Konference artikel i Proceeding eller bog/rapport kapitel
Konferencebidrag i proceedings
Forskning
Peer-review

Open Access

Resume

Database query problems can be categorized by the expressiveness of their query languages, and data structure bounds are better for less expressive languages. Highly expressive languages, such as those permitting Boolean operations, lead to difficult query problems with poor bounds, and high dimensionality in geometric problems also causes their query languages to become expressive and inefficient. The IDSgrep kanji dictionary software approaches a highly expressive tree-matching query problem with a filtering technique set in 128-bit Hamming space. It can be a model for other highly expressive query languages. We suggest improvements to bit vector filtering of general applicability, and evaluate them in the context of IDSgrep.

Publikation information

Produktionstype

Publikation:
Konference artikel i Proceeding eller bog/rapport kapitel
Konferencebidrag i proceedings
Forskning
Peer-review

Originalsprog

Engelsk

Sider fra-til (Antal sider)

Sider 138-150

Publikationsmilepæle

  • Udgivet - 2016

Publikationsstatus

Udgivet - 2016

Forlag

Springer, USA, Tyskland

Bogserie

  • Bogserienavn: Lecture Notes in Computer Science
    Bind: 9939
    ISSN: 0302-9743
978-3-319-46758-0

ISBN (Elektronisk)

978-3-319-46759-7

Publikations IDer

  • Scopus: 84989831356

Titel på værtspublikation

Similarity Search and Applications: 9th International Conference, SISAP 2016, Tokyo, Japan, October 24-26, 2016

Metrikker