Instant Search Based On Prefetched Dataset from Server
Abstract
The data is the collection of information and to retrieve this information using searching tool. The records are retrieved based on ranking system with massive amount. The exact information will not be retrieved and more time is taken to view each and every records. To overcome this problem, keyword based searching is used. With the help of keyword search more number of records is reduced and retrieve the exact information in short time. For each and every search session key is created using Top-k algorithm. This session key is used for getting the same records for particular keyword instead of searching. The clustering algorithm is used for grouping the records.
Keywords
Full Text:
PDFReferences
NeelamTyagi and Simple Sharma, “Weighted Page Rank Algorithm Based on Number of Visits of Links of Web Page”, International Journal of Computing and Engineering (IJSCE) July 2012
Syed thousifhussainB.N.Kanya “Extracting Images From The Web Using Data Mining Technique”,International Journal of Advanced Technology &Engineering Research , March 2012
K. Sridevi and Dr. R. Umarani; “Ontology Ranking Algorithms on Semantic Web: A Review”, International Journal of Advanced Research in Computer and Communication Engineering, vol. 2, pp: 3471-3476; September, 2013.
FlorisGeertsHeikkiMannilaEvimariaTerzi; “Relational link-based ranking”, Proceedings of the 30th VLDB ConferenceToronto, Canada, pp: 552-563; Sept 3, 2004.
Ali Mohammad ZarehBidoki, Nasser Yazdani; “DistanceRank: An intelligent ranking algorithm for web pages”, Information Processing & Management, vol.44, no. 2, pp. 877-892; June, 2007.
HemaDubey, Prof. B. N. Roy; “An Improved Page Rank Algorithm based on Optimized Normalization Technique”, International Journal of Computer Science and Information Technologies, vol. 2, no. 5, pp.2183-2188, 2011.
XiuxiaTian, Yajun Du, Wen Song, Wenjun Liu, YingminXie; “Improvements of HITS Algorithm Based on Triadic Closure”, Journal of Information & Computational Science, pp.1861-1868; April, 2014.
J. Machaj, R. Piché and P. Brida; “Rank Based Fingerprinting Algorithm for Indoor Positioning”, International Conference on Indoor Positioning and Indoor Navigation, Guimaraes, Sept 23, 2011.
NeelamTyagi, Simple Sharma; “Weighted Page Rank Algorithm Based on Number of Visits of Links of Web Page”, International Journal of Soft Computing and Engineering, vol-2, no.3, pp. 441-446; July, 2012.
Rashmi Sharma, KamaljitKaur, “Review of Web Structure Mining Techniques using Clustering and Ranking Algorithms” International Journal of Research in and Communication Technology,6 June- 2014.
Gerald J.Kowalski, mark T.Maybury; “User Search Techniques”, Information Storage and Retrieval Systems, Kluwer Academic Publisher, pp.174-175, 2000.
B. Rajdeepa and Dr. P. Sumathi, "Web Mining and Its Methods", International Journal of Scientific & Engineering Research June-2013.
Dhanalakshmi.K and Hannah Inbarani. H,“Fuzzy Soft Rough K-Means Clustering Approach for Gene Expression Data” International Journal of Scientific & Engineering Research October-2012.
G. Shrivastava, K. Sharma, V. Kumar “Web Mining Today and Tomorrow"International Conference on Electronics Computer Technology (ICECT) April 2011.
Monika Yadav and Mr. Pradeep Mittal, "Web Mining An Introduction" International Journal of Advanced Research in Computer Science and Software Engineering March 2013.
V. Hristidis and Y. Papakonstantinou. Algorithms and applicationsfor answering ranked queries using ranked views, 2004.
H. Pang, X. Ding, and B. Zheng. Efficient processing of exact top-k queries over disk-resident sorted lists, 2010.
I. Ilyas, G. Beskales, and M. Soliman. A survey of top-k query processing techniques in relational database systems, 2008.
R. Akbarinia, E. Pacitti, and P. Valduriez. Best positionalgorithms for top-k queries, 2007.
R. Fagin, R. Kumar, and D. Sivakumar. Efficient similaritysearch and classification via rank aggregation. In Proc. ACMsSIGMOD Int’l Conf. on Management of Data, SIGMOD, 2003.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.