A linear time algorithm for monadic querying of indefinite data over linearly ordered domains

DOI10.1016/S0890-5401(03)00142-1zbMATH Open1078.68025MaRDI QIDQ1887153FDOQ1887153

Authors: Mizuhito Ogawa 

Publication date: 23 November 2004

Published in: Information and Computation (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2242592
• The complexity of querying indefinite data about linearly ordered domains
• Relational queries computable in polynomial time
• First-order queries on databases embedded in an infinite structure
• scientific article; zbMATH DE number 1406216

zbMATH Keywords

Higman's lemmaQuery answeringLinear-time algorithmWell-quasi-orderingIndefinite data

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Graph minors. XX: Wagner's conjecture
• Graph minors. XIII: The disjoint paths problem
• Nonconstructive tools for proving polynomial-time decidability
• Proving termination with multiset orderings
• The complexity of querying indefinite data about linearly ordered domains
• The complexity of query evaluation in indefinite temporal constraint databases
• On conjunctive queries containing inequalities
• An improved algorithm for finding tree decompositions of small width
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordering by Divisibility in Abstract Algebras
• An intuitionistic proof of Kruskal's theorem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Well quasi-ordered sets
• Ordinal numbers and the Hilbert basis theorem
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A linear time algorithm for monadic querying of indefinite data over linearly ordered domains

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