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

DOI10.1016/S0890-5401(03)00142-1zbMath1078.68025MaRDI QIDQ1887153

Mizuhito Ogawa

Publication date: 23 November 2004

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of querying indefinite data about linearly ordered domains
• Graph minors. XX: Wagner's conjecture
• The complexity of query evaluation in indefinite temporal constraint databases
• Well quasi-ordered sets
• An intuitionistic proof of Kruskal's theorem
• Graph minors. XIII: The disjoint paths problem
• On conjunctive queries containing inequalities
• Nonconstructive tools for proving polynomial-time decidability
• Ordinal numbers and the Hilbert basis theorem
• Proving termination with multiset orderings
• AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
• Ordering by Divisibility in Abstract Algebras

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