Compact 0-Complete Trees. - Ratko Orlandic; John L. Pfaltz (VLDB, 1988)

Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. - Ratko Orlandic; John L. Pfaltz (FCT, 1989)

Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. - Ratko Orlandic; Hosam M. Mahmoud (Int. J. Found. Comput. Sci., 1996)

Foundations of a Methodology of DBMS Decoupling for Evolutionary Component DBMS Design. - Ratko Orlandic (IDEAS, 1998)

Simple QSF-Trees: An Efficient and Scalable Spatial Access Method. - Byunggu Yu; Ratko Orlandic; Martha W. Evens (CIKM, 1999)

A Scalable DBMS for Large Scientific Simulations. - John L. Pfaltz; Ratko Orlandic (DANTE, 1999)

Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse. - Ratko Orlandic; Byunggu Yu (CIKM, 2000)

A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces. - Ratko Orlandic; Byunggu Yu (IDEAS, 2000)

Implementing KDB-Trees to Support High-Dimensional Data. - Ratko Orlandic; Byunggu Yu (IDEAS, 2001)

Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality. - Ratko Orlandic; Byunggu Yu (ITCC, 2001)

Preventing Mismatch of Homogeneous Components in the Design of Software Architecture. - Ratko Orlandic; John L. Pfaltz (Int. J. Softw. Eng. Knowl. Eng., 2001)

MIRE: A Multidimensional Information Retrieval Engine for Structured Data and Text. - Jinho Lee; David A. Grossman; Ratko Orlandic (ITCC, 2002)

Performance of KDB-Trees with Query-Based Splitting. - Yves Lépouchard; John L. Pfaltz; Ratko Orlandic (ITCC, 2002)

A retrieval technique for high-dimensional data and partially specified queries. - Ratko Orlandic; Byunggu Yu (Data Knowl. Eng., 2002)

The Design of a Retrieval Technique for High-Dimensional Data on Tertiary Storage. - Ratko Orlandic; Jack Lukaszuk; Craig Swietlik (SIGMOD Rec., 2002)

An evaluation of the incorporation of a semantic network into a multidimensional retrieval engine. - Jinho Lee; David A. Grossman; Ratko Orlandic (CIKM, 2003)

Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine. - Jinho Lee; David A. Grossman; Ratko Orlandic (IKE, 2003)

KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data. - Byunggu Yu; Ratko Orlandic; Thomas Bailey; Jothi Somavaram (ITCC, 2003)

Effective Management of Hierarchical Storage Using Two Levels of Data Clustering. - Ratko Orlandic (IEEE Symposium on Mass Storage Systems, 2003)

Efficient High-Dimensional Indexing by Superimposing Space-Partitioning Schemes. - Jack Lukaszuk; Ratko Orlandic (IDEAS, 2004)

Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces. - Ratko Orlandic; Byunggu Yu (J. Database Manag., 2004)

On accessing data in high-dimensional spaces: A comparative study of three space partitioning strategies. - Jack Lukaszuk; Ratko Orlandic (J. Syst. Softw., 2004)

Clustering high-dimensional data using an efficient and effective data space reduction. - Ratko Orlandic; Ying Lai; Wai Gen Yee (CIKM, 2005)

High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning. - Sachin Kulkarni; Ratko Orlandic (DEXA, 2006)

The Architecture of a New Storage and Retrieval System for Scientific Studies. - Sachin Kulkarni; Ratko Orlandic (IKE, 2006)

Scalable Clustering for Large High-Dimensional Data Based on Data Summarization. - Ying Lai; Ratko Orlandic; Wai Gen Yee; Sachin Kulkarni (CIDM, 2007)

Estimating the performance of multidimensional access methods based on nonoverlapping regions. - Byunggu Yu; Thomas Bailey; Ratko Orlandic (Int. J. Intell. Syst., 2007)

A Functional Database Representation of Large Sets of Objects. - Ratko Orlandic; John L. Pfaltz; Christopher M. Taylor (ADC, 2014)