Museum Management System

Authors(2) :-T. Vijayamma , P. Lakshmipathi

The information concerning the exhibits in a very deposit are often digitalized to extend the quantity of tourists. The statement concerning the exhibits are often recorded which may be integrated into a mobile application. Since the usage of sensible phones is being augmented apace, a wise phone will act as a right away channel between the deposit and its guests. To digitalize deposit information we have a tendency to propose to develop Associate in Nursing mechanical man application that gives statement on the exhibits in leading museums. this is able to come back handy in drawing guests to museums. the appliance provides matter and statement info concerning the museums and their exhibits

Authors and Affiliations

T. Vijayamma
Atudent, Department of Computer Science , S.G.S Arts College, Tirupati, India
P. Lakshmipathi
Associate Professor, Department of Computer Science , S.G.S Arts College, Tirupati, India

Admin,User, Latitude And Great Circle.

  1. Tsql2 and sql3 interactions. rts/sql3.html.
  2. VisTrails.
  3. WebArchive Project. cho/research/ archive.html.
  4. A Balmin, V. Hristidis, and Y. Papakonstantinou. ObjectRank: Authority-Based Keyword Search in Databases. In VLDB, pages 564–575, 2004.
  5. G Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword Searching and Browsing in Databases using BANKS. In ICDE, pages 431–440, 2002.
  6. R Bin-Thalab and N. El-Tazi. TOIX: Temporal Object Indexing for XML Documents. In DEXA, pages 235–249, 2015.
  7. R Bin-Thalab, N. El-Tazi, and M. E. El-Sharkawi. TMIX: Temporal Model for Indexing XML Documents. In AICCSA, pages 1–8, 2013.
  8. J Coffman and A. C. Weaver. A Framework for Evaluating Database Keyword Search Strategies. In CIKM, 2010.
  9. B Ding, J. X. Yu, and L. Qin. Finding Time-Dependent Shortest Paths over Large Graphs. In EDBT, pages 205–216, 2008.
  10. B. Ding, J. X. Yu, S. Wang, L. Qin, X. Zhang, and X. Lin. Finding Top-k Min-Cost Connected Trees in Databases. In ICDE, pages 836–845, 2007.
  11. A. Fard, A. Abdolrashidi, L. Ramaswamy, and J. A. Miller. Towards Efficient Query Processing on Massive Time-evolving Graphs. In CollaborateCom, pages 567–574, 2012.
  12. K. Golenberg, B. Kimelfeld, and Y. Sagiv. Keyword Proximity Search in Complex Data Graphs. In SIGMOD Conference, pages 927–940, 2008.
  13. H. He, H. Wang, J. Yang, and P. S. Yu. BLINKS: Ranked Keyword Searches on Graphs. In SIGMOD Conference, pages 305–316, 2007.
  14. V. Hristidis, L. Gravano, and Y. Papakonstantinou. Efficient IRStyle Keyword Search over Relational Databases. In VLDB, pages 850–861, 2003.
  15. W. Huo and V. J. Tsotras. Efficient Temporal Shortest Path Queries on Evolving Social Graphs. In SSDBM, pages 38:1–38:4, 2014.
  16. C. S. Jensen, R. T. Snodgrass, and M. D. Soo. The TSQL2 Data Model. In The TSQL2 Temporal Query Language. 1995.
  17. V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional Expansion For Keyword Search on Graph Databases. In VLDB, pages 505–516, 2005.
  18. D. Kempe, J. Kleinberg, and A. Kumar. Connectivity and inference problems for temporal networks. In Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, STOC ’00, pages 504–513, New York, NY, USA, 2000. ACM.
  19. B. Kimelfeld and Y. Sagiv. Finding and Approximating Top-k Answers in Keyword Proximity Search. In PODS, 2006.
  20. G. Koloniari, D. Souravlias, and E. Pitoura. On Graph Deltas for Historical Queries. CoRR, abs/1302.5549, 2013.

Publication Details

Published in : Volume 4 | Issue 2 | March-April 2018
Date of Publication : 2018-03-31
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 517-522
Manuscript Number : CSEIT184191
Publisher : Technoscience Academy

ISSN : 2456-3307

Cite This Article :

T. Vijayamma , P. Lakshmipathi, "Museum Management System", International Journal of Scientific Research in Computer Science, Engineering and Information Technology (IJSRCSEIT), ISSN : 2456-3307, Volume 4, Issue 2, pp.517-522, March-April-2018.
Journal URL :

Article Preview

Follow Us

Contact Us