Chasing Polarized Order Dependencies.
Jaroslaw Szlichta, Parke Godfrey, Jarek Gryz · 2012
Abstract. Dependencies have played a significant role in database design for many years. They have also been shown to be useful in query optimization. In this paper, we discuss the new type of dependency for polarized lexicographically ordered sets of tuples. We introduce formally the concept of polarized order dependencies (PODs). We discuss their potential significance for database systems, and present a chase procedure for testing logical implication for them.