Bit-Vector Search Filtering with Application to a Kanji Dictionary

Matthew Skala

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelKonferencebidrag i proceedingsForskningpeer review

Abstrakt

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.
OriginalsprogEngelsk
TitelSimilarity Search and Applications: 9th International Conference, SISAP 2016, Tokyo, Japan, October 24-26, 2016
ForlagSpringer
Publikationsdato2016
Sider138-150
ISBN (Trykt)978-3-319-46758-0
ISBN (Elektronisk)978-3-319-46759-7
DOI
StatusUdgivet - 2016
NavnLecture Notes in Computer Science
Vol/bind9939
ISSN0302-9743

Fingeraftryk

Dyk ned i forskningsemnerne om 'Bit-Vector Search Filtering with Application to a Kanji Dictionary'. Sammen danner de et unikt fingeraftryk.

Citationsformater