Online Bus Pass System

S. Pradhiba, D. SathiyaPriya, P. Vasantha Kumari, R. Rajkumar


The project entitled “Online Bus Pass Registration / Renewal” is developed using Active Server Page.Net as Front end and MS SQL Server as back end. Bus pass registration is useful for passengers who are facing problems with the current manual work of bus pass registration and renewal. His/her renewal or registration can be done through credit card. In the manual system the user has to go on particular date and time if they fail then the renewal cannot be done. This online bus pass registration application will help candidates to save their time and renewal bus pass without standing in a line for hours near counters. Initially uses need to register with the application by submitting their details through online.  The administrator will verify the candidate details and if they are satisfied they will approve bus pass. The candidate can login with their username and password and renewal is performed. The renewal process is carried by paying the money using the credit card. The candidate can give their valuable feedback for further enhancement of this project.

Full Text:



. Baid.A, Rae.I, Li.J, Doan.A, and Naughton.J,(2010) “Toward Scalable Keyword Search over Relational Data,” Proc. VLDB Endowment, vol. 3, no. 1, pp. 140-149.

. Bhalotia.G, Hulgeri.A, Nakhe.C, Chakrabarti.S, and Sudarshan.S,(2002) “Keyword Searching and Browsing in Databases Using BANKS,” Proc. 18th Int‟l Conf. Data Eng. (ICDE ‟02), pp. 431-440.

. Coffman.J and Weaver.A.C,(2010)“A Framework for Evaluating Database Keyword Search Strategies,” Proc. 19th ACM Int‟l Conf.Information and Knowledge Management (CIKM ‟10), pp. 729-738.

. Chen.Y, Wang.W, Liu.Z, and Lin.X,(2009) “Keyword Search on Structured and Semi-Structured Data,” Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD ‟09), pp. 1005-1010.

. Chaudhuri.S and Das.G,(2009)“Keyword Querying and Ranking in Databases,” Proc. VLDB Endowment, vol. 2, pp. 1658-1659.

. Ding.B, Yu.J.X, Wang.S, Qin.L, Zhang.X, and Lin.X,(2007) “Finding Top-k Min-Cost Connected Trees in Databases,” Proc. 23rd Int‟l Conf. Data Eng. (ICDE ‟07), pp. 836-845.

. He.H, Wang.H, Yang.J, and Yu.P.S,(2007) “BLINKS: Ranked Keyword Searches on Graphs,” Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD ‟07), pp. 305-316.

. Hristidis.V and Papakonstantinou.Y,(2002) “DISCOVER: Keyword Search in Relational Databases,” Proc. 28th Int‟l Conf. Very Large Data Base (VLDB‟02), pp. 670-681.

. Li.G,Ooi.B.C, Feng.J, Wang.J, and Zhou.L,(2008) “EASE: An Effective 3in-1 Keyword Search Method for Unstructured, Semi-Structured and Structured Data,” Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD‟08), pp. 903-914.

. Li.G, Feng.J, Zhou.X, and Wang.J,(2011)“Providing Built-in Keyword Search Capabilities in RDBMS,” The VLDB J., vol. 20, pp. 1-19.

. Qin.L, Yu.J.X, and Chang.L, (2009) “Keyword Search in Databases: The Power of RDBMS,” Proc. ACM SIGMOD Int‟l Conf. Management of Data (SIGMOD ‟09), pp. 681-694.

. Su.Q and Widom.J,(2005) “Indexing Relational Database Content Offline for Efficient Keyword-Based Search,” Proc. Ninth Int‟l Database Eng. And Application Symp. (IDEAS ‟05), pp. 297-306.

. Voorhees.E.M,(2002)“The Philosophy of Information Retrieval Evaluation,”Proc. Second Workshop Cross-Language Evaluation Forum on Evaluation of Cross-Language Information Retrieval Systems (CLEF‟01), pp. 355-370.

. Webber.W,(2010)“Evaluating the Effectiveness of Keyword Search,” IEEE Data Eng. Bull., vol. 33, no. 1, pp. 54-59.

. Yogev.S, Roitman.H, Carmel.D, and Zwerdling.N,(2012)“Towards Expressive Exploratory Search over Entity-Relationship Data,” Proc. 21st Int‟l Conf. Companion on World Wide Web (WWW ‟12 Companion), pp. 83-92.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.