Ratko Orlandic

28 papers A* 1A 4B 1C 6Misc 3Journal 7Unranked 6
YearRankTypeTitle / Venue / Authors
2014 Misc conf
A Functional Database Representation of Large Sets of Objects.
ADC
Ratko Orlandic, John L. Pfaltz, Christopher M. Taylor
2007 J jnl
Estimating the performance of multidimensional access methods based on nonoverlapping regions.
Int. J. Intell. Syst.
Byunggu Yu, Thomas Bailey, Ratko Orlandic
2007 C conf
Scalable Clustering for Large High-Dimensional Data Based on Data Summarization.
CIDM
Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulkarni
2006 C conf
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning.
DEXA
Sachin Kulkarni, Ratko Orlandic
2006 Misc conf
The Architecture of a New Storage and Retrieval System for Scientific Studies.
IKE
Sachin Kulkarni, Ratko Orlandic
2005 A conf
Clustering high-dimensional data using an efficient and effective data space reduction.
CIKM
Ratko Orlandic, Ying Lai, Wai Gen Yee
2004 C conf
Efficient High-Dimensional Indexing by Superimposing Space-Partitioning Schemes.
IDEAS
Jack Lukaszuk, Ratko Orlandic
2004 J jnl
On accessing data in high-dimensional spaces: A comparative study of three space partitioning strategies.
J. Syst. Softw.
Jack Lukaszuk, Ratko Orlandic
2004 J jnl
Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces.
J. Database Manag.
Ratko Orlandic, Byunggu Yu
2003 Misc conf
Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine.
IKE
Jinho Lee, David A. Grossman, Ratko Orlandic
2003 A conf
An evaluation of the incorporation of a semantic network into a multidimensional retrieval engine.
CIKM
Jinho Lee, David A. Grossman, Ratko Orlandic
2003 — conf
Effective Management of Hierarchical Storage Using Two Levels of Data Clustering.
IEEE Symposium on Mass Storage Systems
Ratko Orlandic
2003 — conf
KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data.
ITCC
Byunggu Yu, Ratko Orlandic, Thomas Bailey, Jothi Somavaram
2002 J jnl
A retrieval technique for high-dimensional data and partially specified queries.
Data Knowl. Eng.
Ratko Orlandic, Byunggu Yu
2002 — conf
MIRE: A Multidimensional Information Retrieval Engine for Structured Data and Text.
ITCC
Jinho Lee, David A. Grossman, Ratko Orlandic
2002 — conf
Performance of KDB-Trees with Query-Based Splitting.
ITCC
Yves Lépouchard, John L. Pfaltz, Ratko Orlandic
2002 J jnl
The Design of a Retrieval Technique for High-Dimensional Data on Tertiary Storage.
SIGMOD Rec.
Ratko Orlandic, Jack Lukaszuk, Craig Swietlik
2001 C conf
Implementing KDB-Trees to Support High-Dimensional Data.
IDEAS
Ratko Orlandic, Byunggu Yu
2001 — conf
Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality.
ITCC
Ratko Orlandic, Byunggu Yu
2001 J jnl
Preventing Mismatch of Homogeneous Components in the Design of Software Architecture.
Int. J. Softw. Eng. Knowl. Eng.
Ratko Orlandic, John L. Pfaltz
2000 C conf
A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces.
IDEAS
Ratko Orlandic, Byunggu Yu
2000 A conf
Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse.
CIKM
Ratko Orlandic, Byunggu Yu
1999 — conf
A Scalable DBMS for Large Scientific Simulations.
DANTE
John L. Pfaltz, Ratko Orlandic
1999 A conf
Simple QSF-Trees: An Efficient and Scalable Spatial Access Method.
CIKM
Byunggu Yu, Ratko Orlandic, Martha W. Evens
1998 C conf
Foundations of a Methodology of DBMS Decoupling for Evolutionary Component DBMS Design.
IDEAS
Ratko Orlandic
1996 J jnl
Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis.
Int. J. Found. Comput. Sci.
Ratko Orlandic, Hosam M. Mahmoud
1989 B conf
Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases.
FCT
Ratko Orlandic, John L. Pfaltz
1988 A* conf
Compact 0-Complete Trees.
VLDB
Ratko Orlandic, John L. Pfaltz