GLIP: A CONCURRENCY CONTROL PROTOCOL FOR CLIPPING INDEXING
Published In: INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING, COMMUNICATION AND NETWORKS
Author(s): P.V.RAVI KANTH , M.RAVI KANTH , N.SWATHI
Abstract: The project Concurrency Control Protocol for Clipping Indexing deals with the multidimensional databases. In multidimensional indexing trees, the overlapping of nodes will tend to degrade query performance, as one single point query may need to traverse multiple branches of the tree if the query point is in an overlapped area. Multidimensional databases are beginning to be used in a wide range of applications. To meet this fast-growing demand, the R-tree family is being applied to support fast a
- Publication Date: 03-Jun-2011
- DOI: 10.15224/978-981-07-1847-3-1027
- Views: 0
- Downloads: 0
AN APPROACH TO DEVELOP A SIMPLE ALGORITHM: RETRIEVAL OF TOP K OBJECTS FROM AN UNSORTED MULTIMEDIA DATABASE
Published In: INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING, COMMUNICATION AND NETWORKS
Author(s): FALGUNI CHAKRABORTY , RITA GANGULY
Abstract: During the last decade, multimedia has emerged as a major research and development area. With the advent of the information superhighway, a vast amount of data is currently available on the Internet. Previously Prof. Ronald Fagin developed an algorithm for finding of top k objects [1]. But there were some drawbacks; to improving these drawbacks Threshold Algorithm was introduced. But both of these algorithms required sorted order data. Here we are tried to introduce an algorithm in MDBMS in whic
- Publication Date: 03-Jun-2011
- DOI: 10.15224/978-981-07-1847-3-1027
- Views: 0
- Downloads: 0