- CSB - MetaPress - Google - Bing - Yahoo
 | 2007 | |
|---|---|---|
| j7 |      | Byunggu Yu, Thomas Bailey, Ratko Orlandic: Estimating the performance of multidimensional access methods based on nonoverlapping regions. Int. J. Intell. Syst. 22(3): 259-277 (2007) |
| c20 | | Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulkarni: Scalable Clustering for Large High-Dimensional Data Based on Data Summarization. CIDM 2007: 456-461 |
| 2006 | ||
| c19 | | Sachin Kulkarni, Ratko Orlandic: High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning. DEXA 2006: 738-750 |
| c18 |  | Sachin Kulkarni, Ratko Orlandic: The Architecture of a New Storage and Retrieval System for Scientific Studies. IKE 2006: 35-41 |
| 2005 | ||
| c17 | | Ratko Orlandic, Ying Lai, Wai Gen Yee: Clustering high-dimensional data using an efficient and effective data space reduction. CIKM 2005: 201-208 |
| 2004 | ||
| j6 | | Ratko Orlandic, Byunggu Yu: Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces. J. Database Manag. 15(3): 45-59 (2004) |
| j5 | | Jack Lukaszuk, Ratko Orlandic: On accessing data in high-dimensional spaces: A comparative study of three space partitioning strategies. Journal of Systems and Software 73: 147-157 (2004) |
| c16 | | Jack Lukaszuk, Ratko Orlandic: Efficient High-Dimensional Indexing by Superimposing Space-Partitioning Schemes. IDEAS 2004: 257-264 |
| 2003 | ||
| c15 | | 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 |
| c14 | | Jinho Lee, David A. Grossman, Ratko Orlandic: Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine. IKE 2003: 7-10 |
| c13 | | Byunggu Yu, Ratko Orlandic, Thomas Bailey, Jothi Somavaram: KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data. ITCC 2003: 676-680 |
| c12 | | Ratko Orlandic: Effective Management of Hierarchical Storage Using Two Levels of Data Clustering. IEEE Symposium on Mass Storage Systems 2003: 270-279 |
| 2002 | ||
| j4 | | Ratko Orlandic, Byunggu Yu: A retrieval technique for high-dimensional data and partially specified queries. Data Knowl. Eng. 42(1): 1-21 (2002) |
| j3 | | 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) |
| c11 | | Yves Lépouchard, John L. Pfaltz, Ratko Orlandic: Performance of KDB-Trees with Query-Based Splitting. ITCC 2002: 218-223 |
| c10 | | Jinho Lee, David A. Grossman, Ratko Orlandic: MIRE: A Multidimensional Information Retrieval Engine for Structured Data and Text. ITCC 2002: 224-229 |
| 2001 | ||
| j2 | | 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) |
| c9 | | Ratko Orlandic, Byunggu Yu: Implementing KDB-Trees to Support High-Dimensional Data. IDEAS 2001: 58-67 |
| c8 | | Ratko Orlandic, Byunggu Yu: Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality. ITCC 2001: 616-621 |
| 2000 | ||
| c7 | | Ratko Orlandic, Byunggu Yu: Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse. CIKM 2000: 141-149 |
| c6 | | Ratko Orlandic, Byunggu Yu: A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces. IDEAS 2000: 306-318 |
| 1999 | ||
| c5 | | Byunggu Yu, Ratko Orlandic, Martha W. Evens: Simple QSF-Trees: An Efficient and Scalable Spatial Access Method. CIKM 1999: 5-14 |
| c4 | | |
| 1998 | ||
| c3 | | Ratko Orlandic: Foundations of a Methodology of DBMS Decoupling for Evolutionary Component DBMS Design. IDEAS 1998: 178-187 |
| 1996 | ||
| j1 | | 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) |
| 1989 | ||
| c2 | | Ratko Orlandic, John L. Pfaltz: Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. FCT 1989: 362-371 |
| 1988 | ||
| c1 | | |
Colors in the list of coauthors
Last update Sun May 19 14:31:56 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page