Clustering techniques for adaptive horizontal fragmentation in object oriented databases.
Câmpan, Alina, Darabant, Adrian Sergiu, Şerban, gabriela (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Câmpan, Alina, Darabant, Adrian Sergiu, Şerban, gabriela (2005)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Sergeja Vogrinčič, Zoran Bosnić (2011)
Computer Science and Information Systems
Similarity:
Dejan Lavbič, Iztok Lajovic, Marjan Krisper (2010)
Computer Science and Information Systems
Similarity:
Mile Jovanov, Marjan Kindalov, Nikolche Mihajlovski, Goran Kolevski, Pece Miloshev (2006)
Review of the National Center for Digitization
Similarity:
Miha Grčar, Dunja Mladenič, Marko Grobelnik (2006)
Computer Science and Information Systems
Similarity:
Zestas, Nikos C., Paraschakis, Ioannis G., Styliadis, Athanasios D. (2003)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity:
Xinghao Jiang, Tanfeng Sun, GuangLei Fu (2011)
Computer Science and Information Systems
Similarity:
Nataša Dakić, Jelena Andonovski (2013)
Review of the National Center for Digitization
Similarity:
Jotov, Vladimir (2013)
Serdica Journal of Computing
Similarity:
ACM Computing Classification System (1998): F.4.1. For the last 30 years there has been a lot of research of versioned software products, but challenges remain nevertheless. This article focuses on a model of versioned objects and hierarchically composed workspaces. The presented model of versioned object aims to solve the issue of granulation of versioned data. The model of hierarchically composed workspaces provides methods and rules for versioning, which complete the first...
Shihn-Yuarn Chen, Chia-Ning Chang, Yi-Hsiang Nien, Hao-Ren Ke (2012)
Computer Science and Information Systems
Similarity:
Goran Gavrilović (2007)
Review of the National Center for Digitization
Similarity:
Ohn San, Van-Nam Huynh, Yoshiteru Nakamori (2004)
International Journal of Applied Mathematics and Computer Science
Similarity:
Most of the earlier work on clustering has mainly been focused on numerical data whose inherent geometric properties can be exploited to naturally define distance functions between data points. Recently, the problem of clustering categorical data has started drawing interest. However, the computational cost makes most of the previous algorithms unacceptable for clustering very large databases. The -means algorithm is well known for its efficiency in this respect. At the same time, working...