Nested intervals tree encoding in SQL

ABSTRACT

Nested Intervals generalize Nested Sets. They are immune to hierarchy reorganization problem. They allow answering ancestor path hierarchical queries algorithmically - without accessing the stored hierarchy relation.

REFERENCES

• 1: D. Aioanei, A. Malinaru. General trees persisted in relational databases. <u>http://www.codeproject.com/cs/database/persisting trees.asp?print=true</u>
• 2: Joe Celko, Joe Celko's SQL for Smarties: Trees and Hierarchies, Morgan Kaufmann Publishers Inc., San Francisco, CA, 2004
• 3: Paolo Ciaccia , Dario Maio , Paolo Tiberio, A method for hierarchy processing in relational systems, Information Systems, v.14 n.2, p.93-105, March 1989 [doi>10.1016/0306-4379(89)90038-0]
• 4: J. Conway. On Numbers and Games. New York: Academic Press, Inc.
• 5: J. Roy. 2003. Using the Node Data Type to Solve Problems with Hierarchies in DB2 Universal Database <u>http://www106.ibm.com/developerworks/db2/library/techarticle/0302roy/0302roy.html</u>
• 6: V. Tropashko. Trees in SQL: Nested Sets and Materialized Path. <u>http://www.dbazine.com/tropashko4.shtml</u>
• 7: V. Tropashko. Nested Intervals with Farey Fractions. <u>http://arxiv.org/html/cs.DB/0401014</u>
• 8: V. Tropashko. Nested Intervals Tree Encoding with Continued Fractions. <u>http://arxiv.org/pdf/cs.DB/0402051</u>
• 9: L. Vepstas. The Minkowski Question Mark and the Modular Group SL(2,Z). <u>http://www.linas.org/math/chapminkowski/chap-minkowski.html</u>

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.3 Languages
          Subjects: Query languages

Additional Classification:
  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.3 Languages

          Nouns: SQL

General Terms:
Algorithms, Design, Languages, Theory