| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Ratko Orlandic Jinho Lee , David A. Grossman , Ratko Orlandic: An evaluation of the incorporation of a semantic network into a multidimensional retrieval engine. CIKM 2003 : 572-575 Ratko Orlandic: Effective Management of Hierarchical Storage Using Two Levels of Data Clustering. IEEE Symposium on Mass Storage Systems 2003 : 270-279 Jinho Lee , David A. Grossman , Ratko Orlandic: Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine. IKE 2003 : 7-10 Byunggu Yu , Ratko Orlandic, Thomas Bailey , Jothi Somavaram : KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data. ITCC 2003 : 676-680 Yves Lépouchard , John L. Pfaltz , Ratko Orlandic: Performance of KDB-Trees with Query-Based Splitting. ITCC 2002 : 218-223 Jinho Lee , David Grossman , Ratko Orlandic: MIRE: A Multidimensional Information Retrieval Engine for Structured Data and Text. ITCC 2002 : 224-229 Ratko Orlandic, Byunggu Yu : A retrieval technique for high-dimensional data and partially specified queries. Data Knowl. Eng. 42 (1): 1-21 (2002) Ratko Orlandic, Jack Lukaszuk , Craig Swietlik : The Design of a Retrieval Technique for High-Dimensional Data on Tertiary Storage. SIGMOD Record 31 (2): 15-21 (2002) Ratko Orlandic, Byunggu Yu : Implementing KDB-Trees to Support High-Dimensional Data. IDEAS 2001 : 58-67 Ratko Orlandic, Byunggu Yu : Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality. ITCC 2001 : 616-621 Ratko Orlandic, John L. Pfaltz : Preventing Mismatch of Homogeneous Components in the Design of Software Architecture. International Journal of Software Engineering and Knowledge Engineering 11 (6): 731-759 (2001) Ratko Orlandic, Byunggu Yu : Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse. CIKM 2000 : 141-149 Ratko Orlandic, Byunggu Yu : A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces. IDEAS 2000 : 306-318 Byunggu Yu , Ratko Orlandic, Martha W. Evens : Simple QSF-Trees: An Efficient and Scalable Spatial Access Method. CIKM 1999 : 5-14 John L. Pfaltz , Ratko Orlandic: A Scalable DBMS for Large Scientific Simulations. DANTE 1999 : 271- Ratko Orlandic: Foundations of a Methodology of DBMS Decoupling for Evolutionary Component DBMS Design. IDEAS 1998 : 178-187 Ratko Orlandic, Hosam M. Mahmoud : Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. Int. J. Found. Comput. Sci. 7 (3): 209-226 (1996) Ratko Orlandic, John L. Pfaltz : Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. FCT 1989 : 362-371 Ratko Orlandic, John L. Pfaltz : Compact 0-Complete Trees. VLDB 1988 : 372-381 1 [ 16 ] 2 [ 6 ] 3 [ 14 ] 4 [ 17 ] [ 19 ] 5 [ 14 ] [ 17 ] [ 19 ] 6 [ 15 ] 7 [ 12 ] 8 [ 3 ] 9 [ 1 ] [ 2 ] [ 5 ] [ 9 ] [ 15 ] 10 [ 16 ] 11 [ 12 ] 12 [ 6 ] [ 7 ] [ 8 ] [ 10 ] [ 11 ] [ 13 ] [ 16 ]  ©2004 Association for Computing Machinery |
