New Linear Node Splitting Algorithm for R-trees.

@inproceedings{DBLP:conf/ssd/AngT97,
  author    = {Chuan-Heng Ang and
               T. C. Tan},
  editor    = {Michel Scholl and
               Agn{\`e}s Voisard},
  title     = {New Linear Node Splitting Algorithm for R-trees},
  booktitle = {Advances in Spatial Databases, 5th International Symposium, SSD'97,
               Berlin, Germany, July 15-18, 1997, Proceedings},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1262},
  year      = {1997},
  isbn      = {3-540-63238-7},
  pages     = {339-349},
  ee        = {db/conf/ssd/AngT97.html},
  crossref  = {DBLP:conf/ssd/97},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/An5-1 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD1 or /dvd

Referenced by

1. Joseph K. P. Kuan, Paul H. Lewis: A Study on Data Point Search for HG-Trees. SIGMOD Record 28(1): 90-96(1999)
2. Volker Gaede, Oliver Günther: Multidimensional Access Methods. ACM Comput. Surv. 30(2): 170-231(1998)