We use the Edit distance with Moves on words and trees and say that two regular (tree) languages are -close if every word (tree) of one language is -close to the other. A transduc...
The semantics of a new language (CUDL – Conceptual Universal Database Language), designed to manage dynamic database environments, are presented. This language conforms to the FD...
Nikitas Karanikolas, Maria Nitsiou, Emmanuel J. Ya...
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Querying any information system requires the knowledge of some formal language, making it inaccessible to computer-na?ve potential users. We propose a new intuitive querying mecha...
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...