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

Authors:
Mizuhito Ogawa
Affiliations:
Japan Advanced Institute of Science and Technology, Ishikawa, 923-1292, Japan
Venue:
Information and Computation - TACS 2001
Year:
2003

Citing 11
Cited 0

On conjunctive queries containing inequalities

Journal of the ACM (JACM)
Nonconstructive tools for proving polynomial-time decidability

Journal of the ACM (JACM)
Automata on infinite objects

Handbook of theoretical computer science (vol. B)
The complexity of querying indefinite data about linearly ordered domains

PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
The complexity of query evaluation in indefinite temporal constraint databases

Selected papers from the international workshop on Uncertainty in databases and deductive systems
Proving termination with multiset orderings

Communications of the ACM
Temporal Query Languages: A Survey

ICTL '94 Proceedings of the First International Conference on Temporal Logic
A Constructive Proof that Trees Are Well-Quasi-Ordered Under Minors

TVER '92 Proceedings of the Second International Symposium on Logical Foundations of Computer Science
Highman's Lemma in theory

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper demonstrates the generation of a linear-time query-answering algorithm based on the constructive proof of Higman's lemma by Murthy and Russell [Proceedings of the 5th IEEE Symposium on Logic in Computer Science, 1990, p. 257-267]. The target problem is linear-time evaluation of a fixed disjunctive monadic query on an indefinite database over linearly ordered domains, first posed by van der Meyden [Proceedings of the 11th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1992, p. 331-345]. Van der Meyden showed the existence of a linear-time algorithm, but an explicit construction has, until now, not been reported.