Ratko Orlandic

发表

A Theory of Implementation Independence: Architectural Speci city vs. Architectural Mismatch

Ratko Orlandic, R. Orlandic, 2013 .

Clustering high-dimensional data using an efficient and effective data space reduction

Ratko Orlandic, Wai Gen Yee, Ying Lai, 2005, CIKM '05.

Indexing Regional Objects in High-Dimensional Spaces

Byunggu Yu, Ratko Orlandic, Byunggu Yu, 2006 .

Performance of KDB-trees with query-based splitting

John L. Pfaltz, Ratko Orlandic, Yves Lépouchard, 2002, Proceedings. International Conference on Information Technology: Coding and Computing.

A study of MBR-based spatial access methods: how well they perform in high-dimensional spaces

Byunggu Yu, Ratko Orlandic, Byunggu Yu, 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

A Functional Database Representation of Large Sets of Objects

John L. Pfaltz, Ratko Orlandic, Christopher M. Taylor, 2014, ADC.

Scalable Clustering for Large High-Dimensional Data Based on Data Summarization

Ratko Orlandic, Sachin Kulkarni, Wai Gen Yee, 2007, 2007 IEEE Symposium on Computational Intelligence and Data Mining.

Inverted-space storage organization for persistent data of very high dimensionality

Byunggu Yu, Ratko Orlandic, Byunggu Yu, 2001, Proceedings International Conference on Information Technology: Coding and Computing.

KDB/sub KD/-tree: a compact KDB-tree structure for indexing multidimensional data

Byunggu Yu, Ratko Orlandic, Thomas Bailey, 2003, Proceedings ITCC 2003. International Conference on Information Technology: Coding and Computing.

The design of a retrieval technique for high-dimensional data on tertiary storage

Ratko Orlandic, Jack Lukaszuk, Craig Swietlik, 2002, SGMD.

Compact 0-Complete Trees

John L. Pfaltz, Ratko Orlandic, J. Pfaltz, 1988, VLDB.

Q0-trees: A Dynamic Structure for Accessing Spatial Objects with Arbitrary Shapes

John L. Pfaltz, Ratko Orlandic, 1991 .

Efficient high-dimensional indexing by superimposing space-partitioning schemes

Ratko Orlandic, Jack Lukaszuk, R. Orlandic, 2004, Proceedings. International Database Engineering and Applications Symposium, 2004. IDEAS '04..

A scalable DBMS for large scientific simulations

John L. Pfaltz, Ratko Orlandic, J. Pfaltz, 1999, Proceedings 1999 International Symposium on Database Applications in Non-Traditional Environments (DANTE'99) (Cat. No.PR00496).

Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces

Byunggu Yu, Ratko Orlandic, Byunggu Yu, 2004, J. Database Manag..

New high-dimensional access methods based on superimposed space-partitioning schemes

Ratko Orlandic, Jack Lukaszuk, 2005 .

Simple QSF-trees: an efficient and scalable spatial access method

Byunggu Yu, Ratko Orlandic, Martha W. Evens, 1999, CIKM '99.

A family of scalable spatial access methods for high-dimensional data

Byunggu Yu, Ratko Orlandic, 2000 .

Preventing Mismatch of Homogeneous Components in the Design of Software Architecture

John L. Pfaltz, Ratko Orlandic, J. Pfaltz, 2001, Int. J. Softw. Eng. Knowl. Eng..

Estimating the performance of multidimensional access methods based on nonoverlapping regions: Research Articles

Byunggu Yu, Ratko Orlandic, Thomas Bailey, 2007 .

Foundations of a methodology of DBMS decoupling for evolutionary component DBMS design

Ratko Orlandic, R. Orlandic, 1998, Proceedings. IDEAS'98. International Database Engineering and Applications Symposium (Cat. No.98EX156).

The Architecture of a New Storage and Retrieval System for Scientific Studies

Ratko Orlandic, Sachin Kulkarni, 2006, IKE.

Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis

Hosam M. Mahmoud, Ratko Orlandic, H. Mahmoud, 1996, Int. J. Found. Comput. Sci..

High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning

Ratko Orlandic, Sachin Kulkarni, 2006, DEXA.

Compact O-Complete Trees: A New Method for Searching Large Files

John L. Pfaltz, Ratko Orlandic, 1988 .

Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases

John L. Pfaltz, Ratko Orlandic, 1989, FCT.

An evaluation of the incorporation of a semantic network into a multidimensional retrieval engine

Jinho Lee, Ratko Orlandic, David A. Grossman, 2003, CIKM '03.

MIRE: a multidimensional information retrieval engine for structured data and text

Jinho Lee, Ratko Orlandic, David A. Grossman, 2002, Proceedings. International Conference on Information Technology: Coding and Computing.

Object and query transformation: supporting multi-dimensional queries through code reuse

Byunggu Yu, Ratko Orlandic, Byunggu Yu, 2000, CIKM '00.

Estimating the performance of multidimensional access methods based on nonoverlapping regions

Byunggu Yu, Ratko Orlandic, Thomas Bailey, 2007, Int. J. Intell. Syst..

Effective, Privacy-First Display Advertising: Ambient Intelligence for Online Ambient Environments

Ratko Orlandic, 2015 .

A retrieval technique for high-dimensional data and partially specified queries

Byunggu Yu, Ratko Orlandic, Byunggu Yu, 2002, Data Knowl. Eng..

Effective management of hierarchical storage using two levels of data clustering

Ratko Orlandic, R. Orlandic, 2003, 20th IEEE/11th NASA Goddard Conference on Mass Storage Systems and Technologies, 2003. (MSST 2003). Proceedings..

Implementation of Distributed ADAMS Over Legion Using a Component DBMS Design. Final Report

John L. Pfaltz, Ratko Orlandic, 2002 .

Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine

Jinho Lee, Ratko Orlandic, David A. Grossman, 2003, IKE.

On accessing data in high-dimensional spaces: A comparative study of three space partitioning strategies

Ratko Orlandic, Jack Lukaszuk, R. Orlandic, 2004, J. Syst. Softw..

A Class of Region-preserving Space Transformations for Indexing High-dimensional Data

Ratko Orlandic, Jack Lukaszuk, R. Orlandic, 2005 .

Introducing MESSIA : A Methodology of Developing Software Architectures Supporting Implementation Independence

Ratko Orlandic, 1998 .