Reasoning about strings in databases

DOI10.1006/JCSS.1999.1633zbMATH Open0939.68031OpenAlexW2032874529MaRDI QIDQ1807679FDOQ1807679

Authors: Gösta Grahne, Matti Nykänen, Esko Ukkonen 

Publication date: 23 November 1999

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1999.1633

Recommendations

• scientific article; zbMATH DE number 1173828
• Definable relations and first-order query languages over strings
• scientific article; zbMATH DE number 2080401
• Design and implementation of a string database query language.

zbMATH Keywords

databasestring matching

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Title not available (Why is that?)
• On the valuedness of finite transducers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Temporal logic can be more expressive
• The polynomial-time hierarchy
• Title not available (Why is that?)
• Time-space-optimal string matching
• Mappings of languages by two-tape devices
• Domain independence and the relational calculus
• String variable grammar: A logic grammar formalism for the biological language of DNA
• Multi-tape and multi-head pushdown automata
• Absolutely parallel grammars and two-way finite-state transducers
• Sequences, datalog, and transducers
• On the lengths of values in a finite transducer
• Title not available (Why is that?)

Cited In (6)

• Approximate pattern matching and transitive closure logics.
• Title not available (Why is that?)
• Definable relations and first-order query languages over strings
• Design and implementation of a string database query language.
• A formal framework for stringology
• Using acceptors as transducers

This page was built for publication: Reasoning about strings in databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807679)