Top-k denotes to the method which only returns the top K most important objects according to a given ranking function. To tackle the limitations of the existing Top-k query, we proposed a modified Top-k query algorithm. In this algorithm, we select the data elements which have higher ranking scores on each attribute, and then run a threshold controlling scheme on these data elements.This system reduces the manual and paper work. This proposed system will help the user to know the exact information and details of the facility that they are finding. This system is very much useful for all users. In the proposed system, the user can see the information’s of the facilities that are available in the various areas. The user can also see the top ten facilities that are available. And it is used to book travels ticket. And it’s contain the search button and corresponding textbox to search the particular information when the user click the search button it will be redirect to the related pages. The admin can add the additional information about the indexes of Kumbakonam. This system provides the addresses and information of the various facilities.

Massive data retrieval, Top-k query, I/O debugging, Accuracy

[1] Vega J., Murari A., Pereira A., Portas A., Ratta G. A., Castro R., Overview of intelligent data retrieval methods for waveforms and images in massive fusion databases, Fusion Engineering and Design, 2009, 84(7-11): 1916-1919.
[2] Vega J., Pereira, A., Portas A., et al., Data mining technique for fast retrieval of similar waveforms in Fusion massive databases, Fusion Engineering and Design, 2008, 83(1): 132-139.
[3] Czyzewski A., Bratoszewski P., Ciarkowski A., et al., Massive surveillance data processing with supercomputing cluster, Information Sciences, 2015, 296: 322-344.
[4] Neff Lucas P., Cannon Jeremy W., Morrison Jonathan J., Edwards Mary J., Spinella Philip C., Borgman Matthew A., Clearly defining pediatric massive transfusion: Cutting through the fog and friction with combat data, Journal of Trauma and Acute Care Surgery, 2015, 78(1): 22-28.
[5] Khan Mukhtaj, Ashton Phillip M., Li Maozhen, Taylor, Gareth A., PisicaIoana, Liu Junyong, Parallel Detrended Fluctuation Analysis for Fast Event Detection on Massive PMU Data, IEEE Transactions on Smart Grid, 2015, 6(1): 360-368.
[6] Wang Debby D., Zhou Weiqiang, Yan Hong, Mining of proteinprotein interfacial residues from massive protein sequential and spatial data, Fuzzy Sets and Systems, 2015, 258: 101-116.
[7] Fang Cheng, Liu Jun, Lei Zhenming, Parallelized User Clicks Recognition from Massive HTTP Data Based on Dependency Graph Model, China Communications, 2014, 11(12): 13-25.
[8] Yu Ce, Wang Runtao, Xiao Jian, Sun Jizhou, High Performance Indexing for Massive Audio Fingerprint Data, IEEE Transactions on Consumer Electronics, 2014, 6(4): 690-695.
[9] Gog Simon, Petri Matthias, Optimized succinct data structures for massive data, Software-practice & Experience, 2014, 44(11): 1287-1314.
[10] Liu Dexi, Novel Semantics of the Top-k Queries on Uncertainly Fused Multi-Sensory, Journal of Information Science and Engineering, 2015, 31(1): 179-205.
[11] Guo Long, Shao Jie, AungHtooHtet, Tan Kian-Lee, Efficient continuous top-k spatial keyword queries on road networks, GEOINFORMATICA, 2015, 19(1): 29-60.
[12] DimitriouAggeliki, Theodoratos Dimitri, Sellis, Timos, Top-k-size keyword search on tree structured data, Information Systems, 2015, 47: 178-193.
[13] Rahul Saladi, Janardan Ravi, A General Technique for Top-k Geometric Intersection Query Problems, IEEE Transactions on Knowledge and Data Engineering, 2014, 26(12): 2859-2871.
[14] Zou Lei Chen Lei, Pareto-based dominant graph: An efficient indexing structure to answer top-K queries, IEEE Transactions on Knowledge and Data Engineering, 2011, 23(5): 727-741.
[15] DeNavas-Walt Carmen, Proctor Bernadette D, Smith Jessica C, US Census Bureau, current population reports, Income, poverty, and health insurance coverage in the United States, 2008, 60-236.