Fast Query Retrieval using High Utility Item sets from Transactional Database

	International Journal of P2P Network Trends and Technology (IJPTT)
	© 2016 by IJPTT Journal
	Volume - 6 Issue - 5
	Year of Publication : 2016
	Authors : Ms.M.Usharani, Mrs.V.Annapoorani, Mrs. M. Ranjani

Citation

Ms.M.Usharani, Mrs.V.Annapoorani, Mrs. M. Ranjani "Fast Query Retrieval using High Utility Item sets from Transactional Database". International Journal of P2P Network Trends and Technology (IJPTT), V6(5):8-10 Sep -Oct 2016, ISSN:2249-2615, www.ijpttjournal.org, Published by Seventh Sense Research Group.

Abstract

Now-a-days the large amount of data is stored in the databases. A spatial database is used to access multidimensional objects like points, rectangles, etc. Spatial predicate, and a predicate on their associated texts are need to be satisfied for finding the required objects with fast access. For example, instead of finding all the restaurants, object grouping method is used to find the restaurants that are closest among those whose menus contain the specified keywords. IR2-tree is used in the existing system for providing best solution for finding nearest neighbour. This method has few deficiencies. So we implement the new method called spatial inverted index with object grouping to improve the space and query efficiency. And priority level search is used to search the objects based on the users priority. Thus the proposed algorithm is scalable to find the required objects using object grouping.

References

1. Yufei Tao and Cheng Sheng (2013) ?Fast NearestNeighbour Search with Keywords „, In Proc. Of IEEE Transactions On Knowledge And Data Engineering.
2. Agrawal, S. and Chaudhuri, S. and Das, G. (2002) „Dbxplorer: A system for keyword-based search over relational databases? , In Proc. of International Conference on Data Engineering (ICDE), pages 5–16.
3. Anandhi R J andNatarajan and Subramanyam (2009) „ Efficient Consensus Function for Spatial Cluster Ensembles: An Heuristic Layered Approach?, International Symposium on Computing, Communication, and Control (ISCCC).
4. Bhalotia, G. and Hulgeri, A. Nakhe, C. and Chakrabarti, S. andSudarshan, S. (2002) „Keyword searching and browsing in databases using banks?, In Proc. of International Conference on Data Engineering (ICDE), pages 431–440.
5. Cao, X. and Chen, L.and Cong, G. and Jensen, C. S. andQu, Q. and Skovsgaard, A. and Wu, D. andYiu, M. L (2012) „Spatial keyword querying?, In ER, pages 16–29.
6. Cao, X. and Cong, G. and Jensen, C. S. (2010) „Retrieving top-k prestige-based relevant spatial web objects?, PVLDB, 3(1):373– 384.
7. Cao, X. and Cong, G. and Jensen, C. S. and Ooi, B. C. (2011) „Collective spatial keyword querying?, In Proc. of ACM Management of Data (SIGMOD), pages 373–384.
8. Chazelle, B. and Kilian, J. and Rubinfeld, R. and Tal, A.(2004) „The bloomier filter: an efficient data structure for static support lookup tables?, In Proc. of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 30–39.
9. Chen, Y. and Suel, T. and Markowetz, A.( 2006) „Efficient query processing in geographic web search engines?, In Proc. of ACM Management of Data (SIGMOD), pages 277–288.
10. Chu, E. and Baid, A. and Chai, X. and Doan, A. andNaughton, J.(2009) „Combining keyword search and forms for ad hoc querying of databases?, In Proc. of ACM Management of Data (SIGMOD).
11. Cong, G. and Jensen, C. S. and Wu, D.(2009) „Efficient retrieval of the top-k most relevant spatial web objects? , PVLDB, 2(1):337–348.
12. Debing Zhang and Genmao Yang and Yao Hu and Zhongming Jin and Deng Cai and Xiaofei He (2013), „A Unified Approximate Nearest Neighbor Search Scheme by Combining Data Structure and Hashing? , Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence.
13. Hariharan, R. and Hore, B. and Li, C. and Mehrotra, S.(2007) „Processing spatial keyword.(SK) queries in geographic information retrieval (GIR) systems?, In Proc. of Scientific and Statistical Database Management (SSDBM).
14. Hjaltason, G. R. and Samet, H.(1999) „Distance browsing in spatial databases? ,In proc. of ACM Transactions on Database Systems (TODS), 24(2):265–318.
15. Haibo Hu, DikLun Lee1, and JianliangXu(2006) „Fast Nearest Neighbor Search on Road Networks? , Research Grants Council, Hong Kong SAR under grant HKUST6277/04E.
16. Kamel, I. and Faloutsos, C. (1994) „Hilbert R-tree: An improved rtree using fractals?, In Proc. of Very Large Data Bases (VLDB), pages 500–509.
17. Wei Wang and JiongYangand and Richard Muntz (2000), „An Approach To Active Spatial Data mining Based on Statistical Information?, IEEE Transactions on Knowledge and Data Engineering, vol. 12, no. 5.
18. Yufei Tao, Jun Zhang, DimitrisPapadias, and Nikos Mamoulis (2004) „An Efficient Cost Model for Optimization of Nearest Neighbor Search in Low and Medium Dimensional Spaces? In Proc. Of IEEE Transactions on Knowledge and Data Engineering, vol. 16, no. 10.
19. Yoonho Hwang and Bohyung Han and Hee-KapAhn (2012) „A Fast Nearest Neighbor search algorithm by nonlinearEmbedding?, www.postech.ac.kr/ bhhan/papers/ cvpr2012_fnn.pdf Online.

Keywords
Thus the proposed algorithm is scalable to find the required objects using object grouping.