Welcome to D
SIGMOD 2005
PODS 2005
SIGMOD-RECOR
CIDR 2005
CIKM 2005
COMAD 2005
CVDB 2005
DaMoN 2005
Data Enginee
DEBS05
DMSN 2005
DOLAP 2005
GIR 2005
GIS 2005
Hypertext 20
ICDE 2005
ICDM 2005
IHIS 2005
IQIS 2005
JCDL 2005
KRAS 2005
MDM 2005
MIR 2005
MobiDE 2005
P2PIR 2005
RIDE 2005
SBBD 2005
SIGIR 2005
SIGIR-FORUM
SIGKDD 2005
SIGKDD-EXP
SSDBM 2005
TIME 2005
TKDE 2005
TODS 2005
VLDB 2005
VLDBJ 2005
WebDB 2005
WIDM 2005
About DiSC 2
Editorial Bo
Acknowledgem
DiSC'06 Site
Search DiSC'
<<<Author Index>>>
Copyright No

Ratko Orlandic

Papers on DiSC'06


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

Publications


Note: Links lead to the DBLP on the Web.

Ratko Orlandic

Ratko Orlandic, Ying Lai , Wai Gen Yee : Clustering high-dimensional data using an efficient and effective data space reduction. CIKM 2005 : 201-208

Jack Lukaszuk , Ratko Orlandic: Efficient High-Dimensional Indexing by Superimposing Space-Partitioning Schemes. IDEAS 2004 : 257-264

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

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)

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

Ratko Orlandic: Effective Management of Hierarchical Storage Using Two Levels of Data Clustering. IEEE Symposium on Mass Storage Systems 2003 : 270-279

Jinho Lee , David A. Grossman , Ratko Orlandic: Adopting Hierarchical Category Dimension into A Multidimensional Information Retrieval Engine. IKE 2003 : 7-10

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

Yves Lépouchard , John L. Pfaltz , Ratko Orlandic: Performance of KDB-Trees with Query-Based Splitting. ITCC 2002 : 218-223

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

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

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)

Ratko Orlandic, Byunggu Yu : Implementing KDB-Trees to Support High-Dimensional Data. IDEAS 2001 : 58-67

Ratko Orlandic, Byunggu Yu : Inverted-Space Storage Organization for Persistent Data of Very High Dimensionality. ITCC 2001 : 616-621

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)

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

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

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

John L. Pfaltz , Ratko Orlandic: A Scalable DBMS for Large Scientific Simulations. DANTE 1999 : 271-

Ratko Orlandic: Foundations of a Methodology of DBMS Decoupling for Evolutionary Component DBMS Design. IDEAS 1998 : 178-187

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)

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

Ratko Orlandic, John L. Pfaltz : Compact 0-Complete Trees. VLDB 1988 : 372-381

1 [ 16 ]

2 [ 6 ]

3 [ 14 ] [ 17 ] [ 19 ]

4 [ 23 ]

5 [ 14 ] [ 17 ] [ 19 ]

6 [ 15 ]

7 [ 12 ] [ 20 ] [ 22 ]

8 [ 3 ]

9 [ 1 ] [ 2 ] [ 5 ] [ 9 ] [ 15 ]

10 [ 16 ]

11 [ 12 ]

12 [ 23 ]

13 [ 6 ] [ 7 ] [ 8 ] [ 10 ] [ 11 ] [ 13 ] [ 16 ] [ 21 ]




©2006 Association for Computing Machinery