1. P. Brigger. Morphological shape representation using the skeleton decomposition: application to image coding. PhD thesis, Ecole Polytechnique Fédérale de Lausanne (Suisse) - Signal Processing Laboratory, 1995. (http://ltswww.epfl.ch/pub_files/brigger/thesis_html/Phd_html.html ) (bibtex entry)

1. H. Samet and W. G. Aref. Modern Database Systems: The Object Model, Interoperability, and Beyond, chapter Spatial data models and query processing, pages 338--360. Addison-Wesley/ACM Press, 1995. (http://www.cs.umd.edu/~hjs/pubs.html ) (bibtex entry)

2. G.M. Landau, J.P. Schmidt, and V.J. Tsotras. Historical Queries Along Multiple Lines of Time Evolution. VLDB Journal, 4:703--726 , 1995. (bibtex entry)

3. J-P. Peloux, G. Reynal de St Michel, and M. Scholl. Evaluation of Spatial Indices Implemented with the O$_2$. Ingénierie des Systèmes d'Information, 3(4), 1995. (ftp://sikkim.cnam.fr/pub/Reports/VersoReport-069.ps.gz ) (bibtex entry)

4. V.J. Tsotras, B. Gopinath, and G.W. Hart. Efficient Management of Time-Evolving Databases. IEEE Transactions on Knowledge and Data Engineering, 7(4):591--608 , Aou 1995. (bibtex entry)

5. M. Vassilakopoulos and Y. Manolopoulos. Dynamic Inverted Quadtrees - a Structure for Pictorial Databases. Information Systems, Special Issue on Multimedia Information Systems, 20(6):483--500 , 1995. (bibtex entry)

6. M. Vassilakopoulos and Y. Manolopoulos. A random model for analysing region quadtrees. Pattern Recognition Letters, 16:1137--1145 , 1995. (bibtex entry)

7. M. Vassilakopoulos, Y. Manolopoulos, and B. Kroell. Efficiency Analysis of Overlapped Quadtrees. Nordic Journal on Computing, 2(1):70--84 , 1995. (bibtex entry)

1. P.A. Broncz and M.L. Kersten. Monet: An impressionnist sketch of an advanced database system. In IEEE BIWIT Workshop, San Sebastien (Spain), juillet 1995. (bibtex entry)

2. A. Eickler, C.A. Gerholf, and D. Kossmann. A Performance Evaluation of OID Mapping Techniques. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 18--29 , 1995. (bibtex entry)

3. G. Evangelidis, D. Lomet, and B. Salzberg. The hB$^II$-tree: A Modified hB-tree Supportong Concurrency, Recovery and Node Consolidation. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 551--561 , 1995. (bibtex entry)

4. J.M. Hellerstein, J.F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. In Proc. 21st Int. Conf. on Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 562--573 , 1995. (bibtex entry)

5. J.M. Hellerstein, J.F. Naughton, and A. Pfeffer. Generalized Search Trees for Database Systems. In Proc. 21st Int. Conf. on Very Large Data Bases (VLDB'95), Zürich, pages 562--573, 1995. (http://db.cs.berkeley.edu/papers/vldb95-gist.pdf ) (bibtex entry)

6. M. Kornacker and D. Banks. High-Concurrency Locking in R-Trees. In Proc. of the 21st Int. Conf. On Very Large DataBases (VLDB'95), Zurich (Switzerland), pages 134--145 , 1995. (bibtex entry)

7. N. Roussopoulos, S. Kelly, and F. Vincent. Nearest Neighbor Queries. In Proc. of ACM SIGMOD Int. Conf. on Management of Data - SIGMOD Record 24(2), pages 71--79 , 1995. (bibtex entry)

1. S.S Chawathe and H. Garcia-Molina. Meaningful Change Detection in Structured Data. Technical report, Standford University, DB group, 1995. (http://www-db.stanford.edu/pub/papers/bbdifftr.ps ) (bibtex entry)

2. S.S. Chawathe, A. Rajaraman, H. Garcia-Molina, and J. Widom. Change Detection in Hierarchically Structured Information. Technical report, Standford University, DB group, 1995. (http://www-db.stanford.edu/pub/papers/tdiff3-2.ps ) (bibtex entry)

BACK TO INDEX