On representations of ternary order relations in numeric strings

Jinil Kim, Amihood Amir, Joong Chae Na, Kunsoo Park, Jeong Seop Sim

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations


Order-preserving matching is a string matching problem of two numeric strings where the relative orders of consecutive substrings are matched instead of the characters themselves. The order relation between two characters is a ternary relation (>,<,=) rather than a binary relation (>,<), but it was not sufficiently studied in previous works [5, 7, 1]. In this paper, we extend the representations of order relations by Kim et al. [5] to ternary order relations, and prove the equivalence of those representations. The extended prefix representation takes log m + 1 bits per character, while the nearest neighbor representation takes 2 log m bits per character. With our extensions, the time complexities of order-preserving matching in binary order relations can be achieved in ternary order relations as well.

Original languageEnglish
Pages (from-to)46-52
Number of pages7
JournalCEUR Workshop Proceedings
StatePublished - 2014
Event2nd International Conference on Algorithms for Big Data, ICABD 2014 - Palermo, Italy
Duration: 7 Apr 20149 Apr 2014

Bibliographical note

Publisher Copyright:
Copyright © by the paper's authors.


Dive into the research topics of 'On representations of ternary order relations in numeric strings'. Together they form a unique fingerprint.

Cite this