JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/7884

Title: Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders
Authors: Ogawa, Mizuhito
Issue Date: 2001
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 2215
Start page: 283
End page: 297
DOI: 10.1007/3-540-45500-0_14
Abstract: This paper demonstrates the generation of a linear time query processing algorithm based on the constructive proof of Higman’s lemma described by Murthy-Russell (IEEE LICS 1990). A linear time evaluation of a fixed disjunctive monadic query in an indefinite database on a linearly ordered domain, first posed by Van der Meyden (ACM PODS 1992), is used as an example. Van der Meyden showed the existence of a linear time algorithm, but an actual construction has, until now, not been published elsewhere.
Rights: This is the author-created version of Springer, Mizuhito Ogawa, Lecture Notes in Computer Science, 2215, 2001, 283-297. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/3-540-45500-0_14
URI: http://hdl.handle.net/10119/7884
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
TACS01.pdf233KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology