umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Evaluating an Automata Approach to Query Containment
Umeå University, Faculty of Science and Technology, Department of Computing Science. KTH Royal Institute of Technology, Stockholm, Sweden.ORCID iD: 0000-0001-7088-3070
2017 (English)In: Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP) / [ed] Frank Drewes, 2017, p. 75-79Conference paper, Published paper (Refereed)
Abstract [en]

Given two queries Qsuper and Qsub, query containment is the problem of determining if Qsub(D) ⊆ Qsuper(D) for all databases D. This problem has long been explored, but to our knowledge no one has empirically evaluated a straightforward application of finite state automata to the problem. We do so here, covering the case of conjunctive queries with limited set conditions. We evaluate an implementation of our approach against straightforward implementations of both the canonical database and theorem proving approaches. Our implementation outperforms theorem proving on a natural language interface corpus over a photo/video domain. It also outperforms the canonical database implementation on single relation queries with large set conditions.

Place, publisher, year, edition, pages
2017. p. 75-79
National Category
Language Technology (Computational Linguistics)
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:umu:diva-144608OAI: oai:DiVA.org:umu-144608DiVA, id: diva2:1181042
Conference
13th International Conference on Finite State Methods and Natural Language Processing (FSMNLP), 4-6 September, Umeå
Available from: 2018-02-07 Created: 2018-02-07 Last updated: 2018-06-09Bibliographically approved

Open Access in DiVA

fulltext(271 kB)60 downloads
File information
File name FULLTEXT01.pdfFile size 271 kBChecksum SHA-512
d7caa6558c949a5eb2157fc1d2103be6bb1e4bdda6ca6d921ba93a621e7d415db7b22e2899979e9112893410f0a8e253489b269731f9269f9186a2af3e4da23d
Type fulltextMimetype application/pdf

Authority records BETA

Minock, Michael

Search in DiVA

By author/editor
Minock, Michael
By organisation
Department of Computing Science
Language Technology (Computational Linguistics)

Search outside of DiVA

GoogleGoogle Scholar
Total: 60 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 117 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf