An In-Depth Study of The Keyword Search ‘Algorithmic Tools and Techniques’ in Cloud Data
Rishit Garkhel
Vandana International Sr. Sec School, Dwarka, New Delhi
Download PDFAbstract
The owner of data likes to rethink archives in an encoded structure for protection safeguarding. Accordingly, it is fundamental to create productive and dependable ciphertext search methods. This paper proposes a progressive clustering strategy to help more semanticists meet the order for quick ciphertext search in a major data environment. The proposed progressive methodology clusters the reports based on the base importance edge. The outcomes show a sharp increment of reports in the informational collection. The query time of the proposed technique increments dramatically. Moreover, the proposed technique enjoys an upper hand over the traditional strategy in the work protection and importance of recovered statements.
- DBLP computer science bibliography. http://dblp.uni-trier.de/.
- IMDB movie database. http://www.imdb.com
- Query templates. http://tinyurl.com/8zs3e77
- G. Adomavicius and A. Tuzhilin. Toward the next generation of recommender systems: A survey of the stateof-the-art and possible extensions. TKDE, 17(6):734–749, 2005.
- R. Agrawal, R. Rantzau, and E. Terzi. Context-sensitive ranking. In SIGMOD, pages 383–394, 2006.
- R. Agrawal and E. L. Wimmers. A framework for expressing and combining preferences. In SIGMOD, pages 297–306, 2000.
- A. Arvanitis and G. Koutrika. PrefDB: Bringing preferences closer to the DBMS. In SIGMOD, pages 665– 668, 2012.
- A. Arvanitis and G. Koutrika. Towards preference-aware relational databases. In ICDE, pages 426–437, 2012.
- S. Borzs ¨ onyi, D. Kossmann, and K. Stocker. The skyline operator. ¨ In ICDE, pages 421–430, 2001.
- J. Chomicki. Preference formulas in relational queries. TODS, 28(4):427–466, 2003.
- V. Christophides, D. Plexousakis, M. Scholl, and S. Tourtounis. On labeling schemes for the semantic web. In WWW, pages 544–555, 2003.
- W. W. Cohen, R. E. Schapire, and Y. Singer. Learning to order things. J. Artif. Intell. Res. (JAIR), 10:243– 270, 1999.
- R. Fagin, A. Lotem, and M. Naor. Optimal aggregation algorithms for middleware. In PODS, pages 102– 113, 2001.
- P. Georgiadis, I. Kapantaidakis, V. Christophides, E. M. Nguer, and N. Spyratos. Efficient rewriting algorithms for preference queries. In ICDE, pages 1101–1110, 2008.
- S. Holland, M. Ester, and W. Kießling. Preference mining: A novel approach on mining user preferences for personalized applications. In PKDD, pages 204–216, 2003.
- I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, pages 754–765, 2003.
- T. Joachims. Optimizing search engines using clickthrough data. In KDD, pages 133–142, 2002
- W. Kießling. Foundations of preferences in database systems. In VLDB, pages 311–322, 2002.
- W. Kießling and G. Kostler. Preference SQL - design, implementation, experiences. In VLDB, pages 990– 1001, 2002.
- G. Koutrika and Y. E. Ioannidis. Personalization of queries in database systems. In ICDE, pages 597–608, 2004
- M. Lacroix and P. Lavency. Preferences: Putting more knowledge into queries. In VLDB, pages 217–225, 1987.
- J. Levandoski, M. Mokbel, and M. Khalefa. FlexPref: A framework for extensible preference evaluation in database systems. In ICDE, pages 828–839, 2010.
- C. Li, K. C.-C. Chang, I. F. Ilyas, and S. Song. RankSQL: Query algebra and optimization for relational topk queries. In SIGMOD, pages 131–142, 2005.
- C. Mishra and N. Koudas. Stretch 'n' shrink: Resizing queries to user preferences. In SIGMOD, pages 1227– 1230, 2008.
- P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price. Access path selection in a relational database management system. In SIGMOD, pages 23–34, 1979.
- K. Stefanidis, E. Pitoura, and P. Vassiliadis. Adding context to preferences. In ICDE, pages 846–855, 2007.