The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ratko Orlandic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ratko Orlandic, John L. Pfaltz
    Compact 0-Complete Trees. [Citation Graph (3, 11)][DBLP]
    VLDB, 1988, pp:372-381 [Conf]
  2. Ratko Orlandic, John L. Pfaltz
    Analysis of Compact 0-Complete Trees: A New Access Method to Large Databases. [Citation Graph (2, 0)][DBLP]
    FCT, 1989, pp:362-371 [Conf]
  3. Jinho Lee, David A. Grossman, Ratko Orlandic
    An evaluation of the incorporation of a semantic network into a multidimensional retrieval engine. [Citation Graph (0, 0)][DBLP]
    CIKM, 2003, pp:572-575 [Conf]
  4. Ratko Orlandic, Ying Lai, Wai Gen Yee
    Clustering high-dimensional data using an efficient and effective data space reduction. [Citation Graph (0, 0)][DBLP]
    CIKM, 2005, pp:201-208 [Conf]
  5. Ratko Orlandic, Byunggu Yu
    Object and Query Transformation: Supporting Multi-Dimensional Queries through Code Reuse. [Citation Graph (0, 0)][DBLP]
    CIKM, 2000, pp:141-149 [Conf]
  6. Byunggu Yu, Ratko Orlandic, Martha W. Evens
    Simple QSF-Trees: An Efficient and Scalable Spatial Access Method. [Citation Graph (0, 0)][DBLP]
    CIKM, 1999, pp:5-14 [Conf]
  7. John L. Pfaltz, Ratko Orlandic
    A Scalable DBMS for Large Scientific Simulations. [Citation Graph (0, 0)][DBLP]
    DANTE, 1999, pp:271-0 [Conf]
  8. Sachin Kulkarni, Ratko Orlandic
    High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning. [Citation Graph (0, 0)][DBLP]
    DEXA, 2006, pp:738-750 [Conf]
  9. Ratko Orlandic
    Foundations of a Methodology of DBMS Decoupling for Evolutionary Component DBMS Design. [Citation Graph (0, 0)][DBLP]
    IDEAS, 1998, pp:178-187 [Conf]
  10. Ratko Orlandic, Byunggu Yu
    A Study of MBR-Based Spatial Access Methods: How Well They Perform in High-Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2000, pp:306-318 [Conf]
  11. Ratko Orlandic, Byunggu Yu
    Implementing KDB-Trees to Support High-Dimensional Data. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2001, pp:58-67 [Conf]
  12. Jack Lukaszuk, Ratko Orlandic
    Efficient High-Dimensional Indexing by Superimposing Space-Partitioning Schemes. [Citation Graph (0, 0)][DBLP]
    IDEAS, 2004, pp:257-264 [Conf]
  13. Jinho Lee, David A. Grossman, Ratko Orlandic
    Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine. [Citation Graph (0, 0)][DBLP]
    IKE, 2003, pp:7-10 [Conf]
  14. Sachin Kulkarni, Ratko Orlandic
    The Architecture of a New Storage and Retrieval System for Scientific Studies. [Citation Graph (0, 0)][DBLP]
    IKE, 2006, pp:35-41 [Conf]
  15. Jinho Lee, David A. Grossman, Ratko Orlandic
    MIRE: A Multidimensional Information Retrieval Engine for Structured Data and Text. [Citation Graph (0, 0)][DBLP]
    ITCC, 2002, pp:224-229 [Conf]
  16. Yves Lépouchard, John L. Pfaltz, Ratko Orlandic
    Performance of KDB-Trees with Query-Based Splitting. [Citation Graph (0, 0)][DBLP]
    ITCC, 2002, pp:218-223 [Conf]
  17. Ratko Orlandic, Byunggu Yu
    Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality. [Citation Graph (0, 0)][DBLP]
    ITCC, 2001, pp:616-621 [Conf]
  18. Byunggu Yu, Ratko Orlandic, Thomas Bailey, Jothi Somavaram
    KDBKD-Tree: A Compact KDB-Tree Structure for Indexing Multidimensional Data. [Citation Graph (0, 0)][DBLP]
    ITCC, 2003, pp:676-680 [Conf]
  19. Ratko Orlandic
    Effective Management of Hierarchical Storage Using Two Levels of Data Clustering. [Citation Graph (0, 0)][DBLP]
    IEEE Symposium on Mass Storage Systems, 2003, pp:270-279 [Conf]
  20. Ratko Orlandic, Byunggu Yu
    A retrieval technique for high-dimensional data and partially specified queries. [Citation Graph (0, 0)][DBLP]
    Data Knowl. Eng., 2002, v:42, n:1, pp:1-21 [Journal]
  21. Ratko Orlandic, Hosam M. Mahmoud
    Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:3, pp:209-226 [Journal]
  22. Ratko Orlandic, John L. Pfaltz
    Preventing Mismatch of Homogeneous Components in the Design of Software Architecture. [Citation Graph (0, 0)][DBLP]
    International Journal of Software Engineering and Knowledge Engineering, 2001, v:11, n:6, pp:731-759 [Journal]
  23. Ratko Orlandic, Byunggu Yu
    Scalable QSF-Trees: Retrieving Regional Objects in High-Dimensional Spaces. [Citation Graph (0, 0)][DBLP]
    J. Database Manag., 2004, v:15, n:3, pp:45-59 [Journal]
  24. Jack Lukaszuk, Ratko Orlandic
    On accessing data in high-dimensional spaces: A comparative study of three space partitioning strategies. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2004, v:73, n:, pp:147-157 [Journal]
  25. Ratko Orlandic, Jack Lukaszuk, Craig Swietlik
    The Design of a Retrieval Technique for High-Dimensional Data on Tertiary Storage. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2002, v:31, n:2, pp:15-21 [Journal]
  26. Ying Lai, Ratko Orlandic, Wai Gen Yee, Sachin Kulkarni
    Scalable Clustering for Large High-Dimensional Data Based on Data Summarization. [Citation Graph (0, 0)][DBLP]
    CIDM, 2007, pp:456-461 [Conf]

Search in 0.002secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002