Dynamic Query Structures for Database Exploration
|
|
- Bryan Bradley
- 5 years ago
- Views:
Transcription
1 GLOBAL IMPACT FACTOR INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING IN RESEARCH TRENDS VOLUME 1, ISSUE 3, SEPTEMBER 2014, PP Dynamic Query Structures for Database Exploration Alisam Pavan Kumar 1, M.Tech Research Scholar I.S.Raghuram 2, Assistant Professor Dr.S.Prem Kumar 3, Head of the Department Department Of CSE, G.Pullaiah College of Engineering and Technology. Kurnool JNTU Anatapur, Andhra Pradesh, India Abstract:-In New exploratory databases and web databases keep up tremendous and heterogeneous information. These cement world databases incorporate over such a variety of relations and properties. Noteworthy predefined query structures are not ready to answer diverse advertisement ad-hoc query s from clients on those databases. This paper proposes Dynamic Query structures, an inquisitive database query structure interface, which has the capacity powerfully make query structures. The importance of DQS is to catch a client's decision and group inquiry structure parts, help him/her to make conclusion. The making of query structure is a monotonous methodology and is led by the clients. In every redundancy, the framework naturally makes order arrangements of structure segments and the client then includes the craved structure parts into the inquiry structure. The grouping of structure segments is focused around the caught client decision. A client might likewise top off the inquiry structure and convey query s to view the query yield at each one stage. Consequently, a query structure could be alertly refined till the client answer with the inquiry yield. A probabilistic model is produced for assessing the incredibleness of a query structure in DQS. I have examined assessment and client study ensures the adequacy and productivity of the framework. Keywords: Form creation, Query Form, User Interaction, Efficiency of the system, Dynamic Query Structures (DQS) I. INTRODUCTION: Inquiry structure is a standout amongst the most widely utilized client interfaces for querying databases to get to data. Notable inquiry structures are designed and predefined by engineers or Database Overseer in distinctive data administration frameworks. With the quick improvement of web data and exploratory databases, new databases get to be exceptionally tremendous and troublesome. In regular sciences, in the same way as genomics and illnesses, the databases have number of substances for synthetic and/or natural information assets. Distinctive sorts of web databases, in the same way as Freebase and DBPEDia, have a great many organized web substances. Thusly, it is hard to outline a set of static query structures to answer different impromptu database queries on those troublesome and complex databases. Numerous existing database administration and advancement devices, in the same way as Simple Inquiry, Chilly Combination, SAP and Microsoft Access, give different systems to let clients produce modified query s on databases. Yet, the altered inquiries era completely relies on upon IJCERT
2 clients' manual editing's. In the event that a client is not acquainted with the database blueprint ahead of time, those hundreds or a large number of information traits will befuddle him or her. Present day logical database and web database keep up huge and heterogeneous information. Web databases incorporate Freebase [5] and DBPEDia [3] have a great many organized web substances. These genuine databases contain over hundreds or even a huge number of relations and traits. Customary predefined inquiry structures are not ready to fulfill different impromptu inquiries on that complex database. Query structure is a standout amongst the most broadly utilized client interface to return clients coveted result. in this paper, here proposes Dynamic Inquiry Structure System[1], an inquiry structure interface which has the capacity progressively produce inquiry structure as indicated by client want at run time. This is completely not quite the same as record recovery; clients in database recovery perform numerous refining query conditions before recognizing the last hopefuls. Intuitive applications have changed significantly over most recent 15 years. In the late 90's, substantial web organizations manage increment in scale on numerous measurements. 1) The client rounds out the current query structure and submits an inquiry. 2) DQS will execute the query and the results are demonstrated. 3) The criticism about the inquiry results is given by client. II. FRAMEWORK STRUCTURAL PLANNING The framework is proposes to have the accompanying modules alongside utilitarian necessities. A. Query Structure Improvement B. Query Execution C. Redid Inquiry Structure D. Database Query Suggestion 1.1 Cooperation BETWEEN Clients & DQS A. Query Form Enrichment 1) Dynamic Query Structures (DQS) prescribes a positioned rundown of inquiry structure segments to the client. 2) The client needs to choose the fancied structure segments into the current query structure. B. Query Execution Fig 1 System Architecture Figure shows of dynamic query structure. An dynamic query structure framework which produces inquiry structure as indicated by the clients want at run time. The framework gives an answer for query interface in IJCERT
3 huge and complex database. Apply Measure to gauge the integrity of an inquiry structure. F-measure is an ordinary metric to assess inquiry result. The metric is additionally proper for inquiry structure on the grounds that query structures are intended to help client s inquiry the database. The decency of a query structure is dictated by the inquiry results produced from the inquiry structure. In light of this, we can rank and prescribe the potential query structure parts. Here effectiveness is critical in light of the fact that dynamic inquiry structure is an online framework where clients regularly expect speedy reaction. Each one query structure relates to SQL inquiry layout. Query structures permit clients to fill parameters to create distinctive inquiries. In this paper, we concentrate on the projection and determination segments of an inquiry structure. Impromptu join is not taken care of by our dynamic query structure on the grounds that join is not a piece of the inquiry structure and is undetectable for clients. To choose whether a query structure is sought or not, a client does not have room schedulewise to head over every information occasion in the inquiry result. Likewise, numerous database query s yield a colossal measure of information examples. With a specific end goal to maintain a strategic distance from this a lot of people answer issue, just output compressed result table to demonstrate an abnormal state perspective of the inquiry come about first. Each one example in the compacted table speaks to a group of real information cases. At that point, the client can navigate intrigued groups to view the itemized information cases. There are numerous one- pass bunching calculations for producing the layered view proficiently. In our Implementation, we pick the incremental information bunching schema, as a result of the productivity issue. Absolutely, distinctive information bunching techniques would have diverse layered perspectives for clients. Likewise, diverse bunching systems are desirable over distinctive information sorts. Here, grouping is just to give a finer perspective of the inquiry result for client. The framework engineers can choose an alternate grouping calculation if necessary. An alternate vital utilization of the packed perspective is to gather the client input. Utilizing the gathered input, we can evaluate the integrity of a query structure with the goal that we could propose suitable inquiry structure parts. In true, end clients are hesitant to give express input. Figure beneath demonstrates the client activity. A. Query Structure Upgrade 1) Dynamic Inquiry Structure supports a positioned rundown of query structure segments for the client. 2) The client needs to choose the favored structure segments into the current query structure. B. Query execution 1) The client need to rounds out the current query structure and submits the inquiry. 2) DQS performs the query and showcases the results. 3) The client offers the input on the query results. C. Altered Query Structure These give visual interfaces to engineers to produce or modify inquiry structures. The issue of those instruments is that, they are for the expert software engineer who is mindful with their databases, however not for the end-clients. It proposes a framework which allows end-clients to alter the current inquiry structure at run time. Be that as it may, the end-client may not be acquainted with the database. In the event that the database outline is exceptionally tremendous, it is hard for them to pursuit particular database substances and ascribes and to create coveted query structures. IJCERT
4 D. Database Inquiry: Proposal Flow studies acquaint imparted system to propose database query segments for database research. They consider SQL queries as components in the synergistic separating method, and propose comparable inquiries to applicable clients. III. ALGORITHM Figure shows stream diagram of dynamic query structure. An dynamic query structure framework which produces inquiry structure as indicated by the clients wish at run time. The framework gives an answer for query interface in substantial and complex database. Apply Measure to gauge the integrity of a query structure. F-measure is an ordinary metric to assess inquiry result. The metric is additionally suitable for inquiry structure in light of the fact that query structures are intended to help clients query the database. The integrity of a query structure is dictated by the inquiry results created from the inquiry structure. In view of this, we can rank and suggest the potential inquiry structure segments. Here proficiency is critical on the grounds that dynamic inquiry structure is an online framework where clients regularly expect brisk reaction. Each one inquiry structure compares to SQL query format. Inquiry structures permit clients to fill parameters to create distinctive querys. In this paper, we concentrate on the projection and determination segments of a query structure. Impromptu join is not and headed by our dynamic query structure on the grounds that join is not a piece of the inquiry structure and is undetectable for clients. To choose whether an inquiry structure is fancied or not, a client does not have sufficient energy to head over every information occasion in the query result. What's more, numerous database inquiries yield an immense measure of information cases. To keep away from this a lot of people answer issue, just yield layered result table to demonstrate an abnormal state perspective of the query come about first. Each one case in the layered table speaks to a bunch of real information occurrences. At that point, the client can navigate intrigued groups to view the natty gritty information instances. There are numerous one- pass grouping calculations for creating the layered view productively. In our usage, we pick the incremental information bunching schema, due to the productivity issue. Unqueryably, distinctive information grouping systems would have diverse packed perspectives for clients. Additionally, distinctive bunching techniques are desirable over diverse information sorts. Here, bunching is just to give a superior perspective of the inquiry result for client. The framework engineers can choose an alternate bunching calculation if necessary. An alternate imperative use of the compacted perspective is to gather the client input. Utilizing the gathered criticism, we can gauge the integrity of an inquiry structure with the goal that we could suggest proper query structure segments. In true, end clients are hesitant to give express input. Figure beneath demonstrates the client activity. Algorithm query construction IJCERT
5 Query results- To finish up if a query structure is obliged or not, a client doesn't have sufficient energy to head over every information occasion in inquiry results. Additionally, numerous database inquiries come about a lot of information occurrences. We just yield a packed yield table to show an abnormal state perspective of the inquiry results. Each occurrence in layered table connotes a gathering of real information occasions. Next, client can navigate fancied groups to view point by point information cases. Beneath figure shows client activity stream. The packed perspective of query results will be proposed. There are numerous grouping calculations for making compacted view effectively. For our execution, we choose incremental information bunching system due to productivity issue. Distinctive bunching systems are desirable over diverse information sorts. Here, grouping is just to give a superior perspective of query results for clients. The framework software engineer can pick a different grouping calculation if needed. yield table to show an abnormal state perspective of the inquiry results. Each occurrence in layered table connotes a gathering of real information occasions. Next, client can navigate fancied groups to view point by point information cases. Beneath figure shows client activity stream. The packed perspective of query results will be proposed. There are numerous grouping calculations for making compacted view effectively. For our execution, we choose incremental information bunching system due to productivity issue. Distinctive bunching systems are desirable over diverse information sorts. Here, grouping is just to give a superior perspective of query results for clients. The framework software engineer can pick a different grouping calculation if needed. IV. STATIC VS. DYNAMIC QUERY STRUCTURES At the point when a query errand is secured by one recorded inquiries, then SQF based on those authentic query s can be utilized to fill that inquiry assignment,but the expenses of utilizing SQF and DQS to satisfy those undertaking are diverse. Structure Unpredictability was proposed into evaluation expense of utilizing an inquiry structure. That is aggregate of the quantity of choice parts, projection segments, and Relations. V. USABILITY METRICS Fig 2: User Actions Ranking Metrics: To finish up if a query structure is obliged or not, a client doesn't have sufficient energy to head over every information occasion in inquiry results. Additionally, numerous database inquiries come about a lot of information occurrences. We just yield a packed For database query structures, one activity implies a mouse click or console info of a textbox. Acmin is an insignificant number of activities for a particular querying undertaking. One capacity implies a gave alternative to client to use, in the same way as an inquiry structure or a structure segment. If there should be an occurrence of site page based framework, Fnmax is aggregate number of UI parts in pages investigated by users. here each one page at most contains 5 client IJCERT
6 interface segments. The more diminutive Acmin, air conditioning, Fnmax, and FN, the better will be the ease of use. Also higher the Acratio, Fnratio, and Achievement, the better will be the convenience. There is an exchange off in the middle of Acmin and Fnmax. The compelling case will be the point at which, we make all conceivable inquiry structures in one web page, and client just needs to choose one query structure to finish their inquiry undertaking, so air conditioning min is 1. Notwithstanding, Fnmax ought to be number of all conceivable inquiry structures with their parts, which can be a huge number. On other side, when clients need to interface a great deal with a framework, that framework ought to recognize better options about client's anticipation. In such case, the framework would chop down numerous undesirable capacities, so Fnmax will be littler. At the same time Acmin will be high subsequent to there are a considerable lot of client associations. Effectiveness- Here we contrast positioning capacity of DQS and other two positioning routines: standard strategy and other is irregular system. Pattern system positions projection and determination traits in climbing request of their blueprint separation to current query structure. In the event of the query condition, it chooses the most often utilized condition within preparing set for that specific trait. Irregular technique haphazardly proposes one query structure part. Last truth of the inquiry structure part positioning is acquired from the query workloads. Here we utilize some generally utilized measurements as a part of Human-Machine Connection and Programming Quality for measuring the ease of use of a framework. These measurements are recorded in underneath Table: VI. CONCLUSION Table 1:- Usability Metric I concentrated on dynamic query structure era approach which helps clients progressively create query structures. The key thought is to utilize a probabilistic model to rank structure segments focused around client inclination. We catch client inclination utilizing both recorded exploration and run-time input, for example, navigate. Exploratory results demonstrate that the dynamic approach frequently prompts the higher achievement rate and more straightforward query structures contrasted and a static methodology. Positioning of structure parts additionally makes it less demanding for clients to alter query structure. IJCERT
7 REFERENCES [1]. M. Jayapandian and H. V. Jagadish. Automated creation of a formsbased database query interface. In proceedings of the VLDB Endowment, pages , August [2]. M. Jayapandian and H. V. Jagadish. Expressive query specification through form customization. In proceedings of International Conference on Extending Database Technology(EDBT), pages , Nantes, France, March [3]. M. Jayapandian and H. V. Jagadish. Automating the design and construction of query forms. IEEE TKDE, 21(10): ,2009. [4]. E.Chu, A. Baid, X. Chai, A. Doan and J. F. Naughton. Combaining keyword search and form for ad hoc querying of databases. In proceedings of ACM SIGMOD Conference, pages , providence, Rhode IsLand, USA, June [5] G. Chatzopoulou, M. Eirinaki and N. Polyzotis. Query recommendations for interactive database exploration. In proceedings of SSDBM, pages 3-18, New Orleans, LA, USA, June [6]. S. B. Roy, H. Wang, U. Nambiar, G. Das and M. K. Mohsnia. Dynacet: Building faceted search systems over databases. In proceedings of ICDE Conference, pages , Shanghai, China, March [7]. K. Chen, H. Chen, N. Conway, J. M. Hellerstein and T. S. Parikh. Usher: Improving data quality with dynamic forms. Im proceedings of ICDE conference, pages , Long Beach, California, USA, March [8]. GODBmanual. IJCERT
Query Result Extraction Using Dynamic Query Forms
Query Result Extraction Using Dynamic Query Forms #1 Mrs. I. Anitha Rani, #2 Y.Vijay, #3 Abdul Moseen #1 Assistant Professor, Department of Computer Science Engineering,Andhra Loyola Institute Of Engineering
More informationDaund, Pune, India I. INTRODUCTION
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES DYNAMICALLY RANKING THE DATABASE QUERY FORM Vinayak Venakt Jadhav * 1 & Prof. Amrit Priyadarshi 2 * 1 M.E Student, Dattakala Group of Institute, Faculty
More informationAN INTERACTIVE FORM APPROACH FOR DATABASE QUERIES THROUGH F-MEASURE
http:// AN INTERACTIVE FORM APPROACH FOR DATABASE QUERIES THROUGH F-MEASURE Parashurama M. 1, Doddegowda B.J 2 1 PG Scholar, 2 Associate Professor, CSE Department, AMC Engineering College, Karnataka, (India).
More informationDATA WAREHOUSING DEVELOPING OPTIMIZED ALGORITHMS TO ENHANCE THE USABILITY OF SCHEMA IN DATA MINING AND ALLIED DATA INTELLIGENCE MODELS
DATA WAREHOUSING DEVELOPING OPTIMIZED ALGORITHMS TO ENHANCE THE USABILITY OF SCHEMA IN DATA MINING AND ALLIED DATA INTELLIGENCE MODELS Harshit Yadav Student, Bal Bharati Public School, Dwarka, New Delhi
More informationInternational Journal of Advance Engineering and Research Development
Scientific Journal of Impact Factor (SJIF): 4.14 International Journal of Advance Engineering and Research Development Volume 3, Issue 3, March -2016 e-issn (O): 2348-4470 p-issn (P): 2348-6406 Identify
More informationQUERY form is one of the most widely used user interfaces
2166 IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. 9, SEPTEMBER 2014 Dynamic Query Forms for Database Queries Liang Tang, Tao Li, Yexi Jiang, and Zhiyuan Chen Abstract Modern scientific
More informationEvaluation of Keyword Search System with Ranking
Evaluation of Keyword Search System with Ranking P.Saranya, Dr.S.Babu UG Scholar, Department of CSE, Final Year, IFET College of Engineering, Villupuram, Tamil nadu, India Associate Professor, Department
More informationProgrammed Engine Locking System by Automatically Detecting Drunken Drivers
Programmed Engine Locking System by Automatically Detecting Drunken Drivers Jammula Hima Bindu 1, Gujjula Asreeth Reddy 2, Pilli Anoosha 3, Karavadi Anny Vijaya Vinolini 4 B.Tech Student, Department of
More informationBased on Distance Comparison Shortest Path Algorithm
Volume 118 No. 20 2018, 853-860 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Based on Distance Comparison Shortest Path Algorithm 1 Y. NavyaSri, 2 K. Meghana, 3 D. Nageswari and
More informationINFREQUENT WEIGHTED ITEM SET MINING USING FREQUENT PATTERN GROWTH R. Lakshmi Prasanna* 1, Dr. G.V.S.N.R.V. Prasad 2
ISSN 2277-2685 IJESR/Nov. 2015/ Vol-5/Issue-11/1434-1439 R. Lakshmi Prasanna et. al.,/ International Journal of Engineering & Science Research INFREQUENT WEIGHTED ITEM SET MINING USING FREQUENT PATTERN
More informationEfficient Approach for Query Based Search in Data Mining
International Journal of Private Cloud Computing Environment and Management Vol. 3, No. 2, (2016), pp. 1-6 http://dx.doi.org/10.21742/ijpccem.2016.3.2.01 Efficient Approach for Query Based Search in Data
More informationImplementation of Data Clustering With Meta Information Using Improved K-Means Algorithm Based On COATES Approach
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 4 Issue 3 March 2015, Page No. 10647-10651 Implementation of Clustering With Meta Information Using Improved
More informationCode Based Compression Techniques in Digital VLSI
Code Based Compression Techniques in Digital VLSI Mr.Mohammad Iliyas Assistant Professor, Dept of ECE and Research Scholar, Nawab Shah Alam Khan College of Engineering and Technology, Hyderabad, India.
More informationImproved K-Means Algorithm Based on COATES Approach. Yeola, Maharashtra, India. Yeola, Maharashtra, India.
Improved K-Means Algorithm Based on COATES Approach Mr.Nikhil Patankar 1, Prof.Prakash Rokade 2 1 Department of Computer Engineering, SND College of Engineering & Research Center, Yeola, Maharashtra, India
More informationBefore getting into the depth of anything, let s go through the checklist first
Before getting into the depth of anything, let s go through the checklist first The Feature Plan for developing an E-commerce Website Checked The Choosing of desired Technology Checked The Mode of Website
More informationOffloading Mobile Computation to Save Energy in Cloud Computing
International Journal of Computer Engineering In Research Trends (IJCERT) Volume 1, Issue 2, August 2014, PP 111-118 www.ijcert.org ISSN (Online): 2349-7084 Offloading Mobile Computation to Save Energy
More informationAuto Secured Text Monitor in Natural Scene Images
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 18, Issue 4, Ver. V (Jul.-Aug. 2016), PP 148-152 www.iosrjournals.org Auto Secured Text Monitor in Natural Scene
More informationChapter 3: Google Penguin, Panda, & Hummingbird
Chapter 3: Google Penguin, Panda, & Hummingbird Search engine algorithms are based on a simple premise: searchers want an answer to their queries. For any search, there are hundreds or thousands of sites
More informationAn Overview of various methodologies used in Data set Preparation for Data mining Analysis
An Overview of various methodologies used in Data set Preparation for Data mining Analysis Arun P Kuttappan 1, P Saranya 2 1 M. E Student, Dept. of Computer Science and Engineering, Gnanamani College of
More informationEvolution of Web Design Using Interactive Genetic Algorithm
Evolution of Web Design Using Interactive Genetic Algorithm Mr. Vishaldeep Vadher 1, Prof. Shilpa Serasiya 2 1 M.E Student, Computer Engineering Department, Kalol Institute of Technology, Gujarat, India
More informationAPPLICATION TESTING USING UFT. Department of CSE, KL University, Andhra Pradesh, India
Volume 115 No. 8 2017, 383-388 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A GUI BASED APPLICATION TESTING USING UFT Dr. Y.Prasanth 1, G.Vineeth
More information(I2OR), Publication Impact Factor: 3.785
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY PERFORMANCE OF CONTENT BASED IMAGE RETRIEVAL USING LOCAL BINARY PATTERN AND COLOR MOMENTS Hitesh Singh*, Sachin Tyagi M.Tech Scholar,
More informationSample Query Generation: Joins and Projection. Jason Ganzhorn
Sample Query Generation: Joins and Projection Jason Ganzhorn {ganzhj@cs.washington.edu} 11 March 2011 1 1 Introduction This paper presents a component in a simple query generation algorithm which is reliant
More informationOpen Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing Environments
Send Orders for Reprints to reprints@benthamscience.ae 368 The Open Automation and Control Systems Journal, 2014, 6, 368-373 Open Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing
More informationReview on Techniques and Applications Involved in Web Usage Mining
Review on Techniques and Applications Involved in Web Usage B Bhavani 1, Dr. V. Sucharita 2 & Dr. K.V.V. Satyanarana 3 1 Research scholar, Department of Computer Science and Engineering, Koneru Lakshmaiah
More informationA Tagging Approach to Ontology Mapping
A Tagging Approach to Ontology Mapping Colm Conroy 1, Declan O'Sullivan 1, Dave Lewis 1 1 Knowledge and Data Engineering Group, Trinity College Dublin {coconroy,declan.osullivan,dave.lewis}@cs.tcd.ie Abstract.
More informationOPTIMAL ONLINE SCHEDULING WITH ARBITRARY HARD DEADLINES IN MULTIHOP COMMUNICATION NETWORKS
OPTIMAL ONLINE SCHEDULING WITH ARBITRARY HARD DEADLINES IN MULTIHOP COMMUNICATION NETWORKS S.Darwin Department of computer science and engineering SRM University, Chennai. darpart19@gmail.com D.G.Ilayaraja
More informationA FRAMEWORK FOR EFFICIENT DATA SEARCH THROUGH XML TREE PATTERNS
A FRAMEWORK FOR EFFICIENT DATA SEARCH THROUGH XML TREE PATTERNS SRIVANI SARIKONDA 1 PG Scholar Department of CSE P.SANDEEP REDDY 2 Associate professor Department of CSE DR.M.V.SIVA PRASAD 3 Principal Abstract:
More informationA Content Based Image Retrieval System Based on Color Features
A Content Based Image Retrieval System Based on Features Irena Valova, University of Rousse Angel Kanchev, Department of Computer Systems and Technologies, Rousse, Bulgaria, Irena@ecs.ru.acad.bg Boris
More informationFace Recognition Using K-Means and RBFN
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationIMPROVED APPROACH FOR HUGE DATA INSERTION
e-issn: 2349-9745 p-issn: 2393-8161 Scientific Journal Impact Factor (SJIF): 1.711 International Journal of Modern Trends in Engineering and Research www.ijmter.com IMPROVED APPROACH FOR HUGE DATA INSERTION
More informationPG Student, Department of MCA, St. Ann s College of Engineering & Technology, Chirala, Andhra Pradesh, India
2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology A Novel Approach for Optimal Travel Route Search using Spatial Keyword Recommendation
More informationGRID SIMULATION FOR DYNAMIC LOAD BALANCING
GRID SIMULATION FOR DYNAMIC LOAD BALANCING Kapil B. Morey 1, Prof. A. S. Kapse 2, Prof. Y. B. Jadhao 3 1 Research Scholar, Computer Engineering Dept., Padm. Dr. V. B. Kolte College of Engineering, Malkapur,
More informationImproving Code Efficiency by Code Optimising Techniques
Improving Code Efficiency by Code Optimising Techniques Neeraj Kumar 1, Prof. Dr. Saroj Hiranwal 2 1 M.Tech Scholar, Dept. of Computer Science & Engineering, Rajasthan Institute of Engineering and Technology,
More informationNETWORK STRUCTURE OR TOPOLOGY
NETWORK STRUCTURE OR TOPOLOGY Amit Kumar,Adnan Sherwani,Akash Singh Electronics and Communication Engineering. Dronacharya College of Engineering, Gurgaon. Abstract: - The geometrical arrangement of pc
More informationSurvey Paper on Traditional Hadoop and Pipelined Map Reduce
International Journal of Computational Engineering Research Vol, 03 Issue, 12 Survey Paper on Traditional Hadoop and Pipelined Map Reduce Dhole Poonam B 1, Gunjal Baisa L 2 1 M.E.ComputerAVCOE, Sangamner,
More informationQUERY RECOMMENDATION SYSTEM USING USERS QUERYING BEHAVIOR
International Journal of Emerging Technology and Innovative Engineering QUERY RECOMMENDATION SYSTEM USING USERS QUERYING BEHAVIOR V.Megha Dept of Computer science and Engineering College Of Engineering
More informationHorizontal Aggregations in SQL to Prepare Data Sets Using PIVOT Operator
Horizontal Aggregations in SQL to Prepare Data Sets Using PIVOT Operator R.Saravanan 1, J.Sivapriya 2, M.Shahidha 3 1 Assisstant Professor, Department of IT,SMVEC, Puducherry, India 2,3 UG student, Department
More informationCNC Milling Machines Advanced Cutting Strategies for Forging Die Manufacturing
CNC Milling Machines Advanced Cutting Strategies for Forging Die Manufacturing Bansuwada Prashanth Reddy (AMS ) Department of Mechanical Engineering, Malla Reddy Engineering College-Autonomous, Maisammaguda,
More informationIntroduction to Databases and SQL
Introduction to Databases and SQL Files vs Databases In the last chapter you learned how your PHP scripts can use external files to store and retrieve data. Although files do a great job in many circumstances,
More informationAn Adaptive and Optimal Distributed Clustering for Wireless Sensor
An Adaptive and Optimal Distributed Clustering for Wireless Sensor M. Senthil Kumaran, R. Haripriya 2, R.Nithya 3, Vijitha ananthi 4 Asst. Professor, Faculty of CSE, SCSVMV University, Kanchipuram. 2,
More informationSupporting Fuzzy Keyword Search in Databases
I J C T A, 9(24), 2016, pp. 385-391 International Science Press Supporting Fuzzy Keyword Search in Databases Jayavarthini C.* and Priya S. ABSTRACT An efficient keyword search system computes answers as
More informationVolume1, Issue 2 October ISSN: Title. The importance of Computer Visualization in technical education. Anshu Singhal
Title The importance of Computer Visualization in technical education Anshu Singhal Student, Department of Computer Engineering BMN college of Engineering and Technology, India ABSTRACT Computer 3D displaying
More informationWEB USAGE MINING BASED ON REQUEST DEPENDENCY GRAPH
WEB USAGE MINING BASED ON REQUEST DEPENDENCY GRAPH S.Gayathri ME - Computer Science and Engineering Department of Computer Science and Engineering Prathyusha Engineering College Tiruvallur, Tamilnadu,
More informationText Data Compression and Decompression Using Modified Deflate Algorithm
Text Data Compression and Decompression Using Modified Deflate Algorithm R. Karthik, V. Ramesh, M. Siva B.E. Department of Computer Science and Engineering, SBM COLLEGE OF ENGINEERING AND TECHNOLOGY, Dindigul-624005.
More informationERCIM Alain Bensoussan Fellowship Scientific Report
ERCIM Alain Bensoussan Fellowship Scientific Report Fellow: Christos Doulkeridis Visited Location : NTNU Duration of Visit: March 01, 2009 February 28, 2010 I - Scientific activity The research conducted
More informationENHANCING DATA MINING EFFICIENCY:-- EMPLOYABILITY OF APRIORI ALGORITHM IN REDUCING MEMORY CONSUMPTION TO IMPACT MINING OUTCOMES
ENHANCING DATA MINING EFFICIENCY:-- EMPLOYABILITY OF APRIORI ALGORITHM IN REDUCING MEMORY CONSUMPTION TO IMPACT MINING OUTCOMES Karan Gupta Deenbandhu Chhotu Ram University of Science and Technology, Murthal,
More informationInternational Journal of Advance Engineering and Research Development. An Efficient Image Retrieval by Using Low Rank Mechanism
Scientific Journal of Impact Factor (SJIF): 5.71 International Journal of Advance Engineering and Research Development Volume 5, Issue 02, February -2018 e-issn (O): 2348-4470 p-issn (P): 2348-6406 An
More informationManagement of Heterogeneous Data Storage Using Deduplication in Cloud Computing
Management of Heterogeneous Data Storage Using Deduplication in Cloud Computing 1 Naveen Kumar.B 2 Mr.Praveen Babu.G 1 M.Tech Student, Software Engineering, School of Information Technology JNTUH, Village
More informationDESIGN, IMPLEMENTATION AND EVALUATION OF A KNOWLEDGE BASED AUTHENTICATION SCHEME UPON COMPELLING PLAIT CLICKS
http:// DESIGN, IMPLEMENTATION AND EVALUATION OF A KNOWLEDGE BASED AUTHENTICATION SCHEME UPON COMPELLING PLAIT CLICKS Chalichima Harshitha 1, Devika Rani 2 1 Pursuing M.tech (CSE), 2 Assistant professor
More informationCLIENT DATA NODE NAME NODE
Volume 6, Issue 12, December 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Efficiency
More informationAn Algorithm for user Identification for Web Usage Mining
An Algorithm for user Identification for Web Usage Mining Jayanti Mehra 1, R S Thakur 2 1,2 Department of Master of Computer Application, Maulana Azad National Institute of Technology, Bhopal, MP, India
More informationMethod to Study and Analyze Fraud Ranking In Mobile Apps
Method to Study and Analyze Fraud Ranking In Mobile Apps Ms. Priyanka R. Patil M.Tech student Marri Laxman Reddy Institute of Technology & Management Hyderabad. Abstract: Ranking fraud in the mobile App
More informationABSTRACT I. INTRODUCTION
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 1 ISSN : 2456-3307 A Proximity-Aware Interest-Clustered P2P File Sharing
More informationPRIVACY PRESERVING CONTENT BASED SEARCH OVER OUTSOURCED IMAGE DATA
PRIVACY PRESERVING CONTENT BASED SEARCH OVER OUTSOURCED IMAGE DATA Supriya Pentewad 1, Siddhivinayak Kulkarni 2 1 Department of Computer Engineering. MIT College of Engineering, Pune, India 2 Department
More informationManaging the Database
Slide 1 Managing the Database Objectives of the Lecture : To consider the roles of the Database Administrator. To consider the involvmentof the DBMS in the storage and handling of physical data. To appreciate
More informationBuilt for Speed: Comparing Panoply and Amazon Redshift Rendering Performance Utilizing Tableau Visualizations
Built for Speed: Comparing Panoply and Amazon Redshift Rendering Performance Utilizing Tableau Visualizations Table of contents Faster Visualizations from Data Warehouses 3 The Plan 4 The Criteria 4 Learning
More informationANALYSIS OF SaaS MULTI-TENANT DATABASE IN A CLOUD ENVIRONMENT
ANALYSIS OF SaaS MULTI-TENANT DATABASE IN A CLOUD ENVIRONMENT Maram Hassan AlAlwan Alalwan.maram@gmail.com Soha S. Zaghloul smekki@ksu.edu.sa College of Computer and Information Science Department of Computer
More informationSorted out POR Protocol for MANETS with Destination Driven Strategies
International Journal of Research Studies in Computer Science and Engineering (IJRSCSE) Volume 1, Issue 8, December 2014, PP 1-7 ISSN 2349-4840 (Print) & ISSN 2349-4859 (Online) www.arcjournals.org Sorted
More informationHyderabad, Telangana, India
GLOBAL JOURNAL OF ENGINEERING SCIENCE AND RESEARCHES IMPLEMENTING AN ENHANCED HADOOP ARCHITECTURE TOREDUCE THE COMPUTATION COST ASSOCIATED WITH BIGDATAANALYSIS M. Praveen *1 & Ch. Prashanth 2 *1&2 M.Tech,
More informationPrediction Using Regression Analysis
Prediction Using Regression Analysis Shantanu Sarkar 1, Anuj Vaijapurkar 2, VimalKumar Bhardwaj 3,Swarnalatha P 4 1,2,3 School of Computer Science, VIT University, Vellore 4 Assistant Professor, School
More informationAn Efficient Clustered Based P2P File Sharing System Using Bloom Filters
An Efficient Clustered Based P2P File Sharing System Using Bloom Filters B. Bhavya M.Tech Student, Department of IT, SNIST, Telangana, India. ABSTRACT: Effective file query is imperative to the general
More informationInternational Journal of Computer Engineering and Applications, Volume IX, Issue X, Oct. 15 ISSN
DIVERSIFIED DATASET EXPLORATION BASED ON USEFULNESS SCORE Geetanjali Mohite 1, Prof. Gauri Rao 2 1 Student, Department of Computer Engineering, B.V.D.U.C.O.E, Pune, Maharashtra, India 2 Associate Professor,
More informationOPTIMIZED SENSOR NODES OF WIRELESS SENSOR NETWORK BY FAULT NODE RECOVERY ALGORITHM
OPTIMIZED SENSOR NODES OF WIRELESS SENSOR NETWORK BY FAULT NODE RECOVERY ALGORITHM Chauhan Ajitkumar 1, Asst. Prof. Jignesh V. Patel 2 1PG Scholar, EC Dept., SPCE, Visnagar, Gujarat, India. 2Assistant
More informationIJESRT. Scientific Journal Impact Factor: (ISRA), Impact Factor: 2.114
[Saranya, 4(3): March, 2015] ISSN: 2277-9655 IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY A SURVEY ON KEYWORD QUERY ROUTING IN DATABASES N.Saranya*, R.Rajeshkumar, S.Saranya
More informationBest Practices. Deploying Optim Performance Manager in large scale environments. IBM Optim Performance Manager Extended Edition V4.1.0.
IBM Optim Performance Manager Extended Edition V4.1.0.1 Best Practices Deploying Optim Performance Manager in large scale environments Ute Baumbach (bmb@de.ibm.com) Optim Performance Manager Development
More informationARP, ITS CHALLENGES & SOLUTIONS: Study
ARP, ITS CHALLENGES & SOLUTIONS: Study Mohit Jani Ad hoc Lecturer, Bhavnagar University Abstract: Address Resolution Protocol (ARP) lives in the Network layer. In a LAN, each PC has a real (IP) address
More informationAn Effective method for Web Log Preprocessing and Page Access Frequency using Web Usage Mining
An Effective method for Web Log Preprocessing and Page Access Frequency using Web Usage Mining Jayanti Mehra 1 Research Scholar, Department of computer Application, Maulana Azad National Institute of Technology
More informationInformation Retrieval Using Keyword Search Technique
Information Retrieval Using Keyword Search Technique Dhananjay A. Gholap, Dr.Gumaste S. V Department of Computer Engineering, Sharadchandra Pawar College of Engineering, Dumbarwadi, Otur, Pune, India ABSTRACT:
More informationRouting Scheme in Energy efficient based Protocols for Wireless Sensor Networks
Routing Scheme in Energy efficient based Protocols for Wireless Sensor Networks 1 Chiranjeevi Rampilla, 2 Pallikonda Anil Kumar, 1 Student, DEPT.OF CSE, PVPSIT, KANURU, VIJAYAWADA. 2 Asst.Professor, DEPT.OF
More informationA Comparison of Memory Usage and CPU Utilization in Column-Based Database Architecture vs. Row-Based Database Architecture
A Comparison of Memory Usage and CPU Utilization in Column-Based Database Architecture vs. Row-Based Database Architecture By Gaurav Sheoran 9-Dec-08 Abstract Most of the current enterprise data-warehouses
More informationInternational Journal of Computer Engineering and Applications, Volume XII, Issue I, Jan. 18, ISSN
International Journal of Computer Engineering and Applications, Volume XII, Issue I, Jan. 18, www.ijcea.com ISSN 2321-3469 ENHANCED SECURED LOAD BALANCING METHODOLOGY IN CLUSTER BASED SERVERS 1 G.SRILAKSHMI,
More informationKeyword search in relational databases. By SO Tsz Yan Amanda & HON Ka Lam Ethan
Keyword search in relational databases By SO Tsz Yan Amanda & HON Ka Lam Ethan 1 Introduction Ubiquitous relational databases Need to know SQL and database structure Hard to define an object 2 Query representation
More informationData Migration From SQL To Mongodb *Nuzhat F. Shaikh 1,Aditya Jadhav 2,Chetan Raina 3,Gaurav Nagoshe 4, Suraj Kale 5
International Journal Of Engineering Research And Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 13, Issue 11 (November 2017), PP.32-36 Data Migration From SQL To Mongodb *Nuzhat
More informationAn Ameliorated Methodology to Eliminate Redundancy in Databases Using SQL
An Ameliorated Methodology to Eliminate Redundancy in Databases Using SQL Praveena M V 1, Dr. Ajeet A. Chikkamannur 2 1 Department of CSE, Dr Ambedkar Institute of Technology, VTU, Karnataka, India 2 Department
More informationProtected and Effective Transmission of Data in Peer-To-Peer Network Using SGA
Protected and Effective Transmission of Data in Peer-To-Peer Network Using SGA Sushma T Shanbhogue 1, Poonguzhali E 2 P.G. Student, Department of Computer Engineering, AMC Engineering College, Bangalore,
More informationKeywords Data alignment, Data annotation, Web database, Search Result Record
Volume 5, Issue 8, August 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Annotating Web
More informationA Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods
A Study on Reverse Top-K Queries Using Monochromatic and Bichromatic Methods S.Anusuya 1, M.Balaganesh 2 P.G. Student, Department of Computer Science and Engineering, Sembodai Rukmani Varatharajan Engineering
More informationMetadata Architectures
Metadata Architectures Evaluating Metadata Architectures Introduction The IT world has practiced metadata management in one form or another for more than twenty years. IT has developed three models for
More informationIMPLEMENTATION OF SMART CRAWLER FOR EFFICIENTLY HARVESTING DEEP WEB INTERFACE
IMPLEMENTATION OF SMART CRAWLER FOR EFFICIENTLY HARVESTING DEEP WEB INTERFACE Rizwan k Shaikh 1, Deepali pagare 2, Dhumne Pooja 3, Baviskar Ashutosh 4 Department of Computer Engineering, Sanghavi College
More informationDATABASE MANAGEMENT SYSTEMS
CHAPTER DATABASE MANAGEMENT SYSTEMS This chapter reintroduces the term database in a more technical sense than it has been used up to now. Data is one of the most valuable assets held by most organizations.
More informationFrom Scratch to the Web: Terminological Theses at the University of Innsbruck
Peter Sandrini University of Innsbruck From Scratch to the Web: Terminological Theses at the University of Innsbruck Terminology Diploma Theses (TDT) have been well established in the training of translators
More informationA Technical Analysis of Market Basket by using Association Rule Mining and Apriori Algorithm
A Technical Analysis of Market Basket by using Association Rule Mining and Apriori Algorithm S.Pradeepkumar*, Mrs.C.Grace Padma** M.Phil Research Scholar, Department of Computer Science, RVS College of
More informationHybrid Approach To Web Service Recommendation Based On Qos-Aware Rating And Ranking
International Refereed Journal of Engineering and Science (IRJES) ISSN (Online) 2319-183X, (Print) 2319-1821 Volume 4, Issue 6 (June 2015), PP.180-185 Hybrid Approach To Web Service Recommendation Based
More informationA Novel Approach of Data Warehouse OLTP and OLAP Technology for Supporting Management prospective
A Novel Approach of Data Warehouse OLTP and OLAP Technology for Supporting Management prospective B.Manivannan Research Scholar, Dept. Computer Science, Dravidian University, Kuppam, Andhra Pradesh, India
More informationDevelopment of a Modeling Tool for Collaborative Finite Element Analysis
Development of a Modeling Tool for Collaborative Finite Element Analysis Åke Burman and Martin Eriksson Division of Machine Design, Department of Design Sciences, Lund Institute of Technology at Lund Unversity,
More informationDistributed Databases: SQL vs NoSQL
Distributed Databases: SQL vs NoSQL Seda Unal, Yuchen Zheng April 23, 2017 1 Introduction Distributed databases have become increasingly popular in the era of big data because of their advantages over
More informationA Comparative Analysis of Cache Replacement Policy
A Comparative Analysis of Cache Replacement Policy Komal Agrahari 1, Muzammil Hassan (Asst. Prof CSED) 2, Manish Kumar Verma 3 1,2,3 Dept. of Computer Science and Engg, MMM University of Technology, (India)
More informationIJMIE Volume 2, Issue 9 ISSN:
WEB USAGE MINING: LEARNER CENTRIC APPROACH FOR E-BUSINESS APPLICATIONS B. NAVEENA DEVI* Abstract Emerging of web has put forward a great deal of challenges to web researchers for web based information
More informationMovicon NExT Pro.Lean Ver.3.2. Print Doc Movicon
Movicon NExT Pro.Lean Ver.3.2 Print Doc Movicon Table of Contents 1. PRO.LEAN... 1 1.1. WHAT IS PRO.LEAN?... 1 1.2. THE ADVANTAGES OF MEASURING PRODUCTION PERFORMANCES... 3 1.3. GETTING STARTED: CONFIGURING
More informationEnhanced Performance of Database by Automated Self-Tuned Systems
22 Enhanced Performance of Database by Automated Self-Tuned Systems Ankit Verma Department of Computer Science & Engineering, I.T.M. University, Gurgaon (122017) ankit.verma.aquarius@gmail.com Abstract
More informationEnhanced Performance of Search Engine with Multitype Feature Co-Selection of Db-scan Clustering Algorithm
Enhanced Performance of Search Engine with Multitype Feature Co-Selection of Db-scan Clustering Algorithm K.Parimala, Assistant Professor, MCA Department, NMS.S.Vellaichamy Nadar College, Madurai, Dr.V.Palanisamy,
More informationComparative Study of CPU Scheduling Algorithms based on Markov Chain
Comparative Study of CPU Scheduling Algorithms based on Pradeep K. Jatav, Research Scholar, Faculty of Computer Science, Pacific Academy of Higher Education and Research University, Udaipur, INDIA Rahul
More informationDecentralized Anonymous Authentication of Data Stored in Clouds Praveen.N, Krishna Kumar.P.R, Vinitha V Yadav
Decentralized Anonymous Authentication of Data Stored in Clouds Praveen.N, Krishna Kumar.P.R, Vinitha V Yadav Abstract: Distributed computing is area that permits clients to store the information. Distributed
More informationInternational Journal of Advance Engineering and Research Development. Performance Enhancement of Search System
Scientific Journal of Impact Factor(SJIF): 3.134 International Journal of Advance Engineering and Research Development Volume 2,Issue 7, July -2015 Performance Enhancement of Search System Ms. Uma P Nalawade
More informationJAVA NETWORK PROGRAMMING USING SOCKET
JAVA NETWORK PROGRAMMING USING SOCKET Gourav Rathor, Devankv. Rathore Abstract- This paper depicts about Network programming utilizing java. The Network writing computer programs is like attachment programming
More informationInternational Journal of Advance Foundation and Research in Science & Engineering (IJAFRSE) Volume 1, Issue 2, July 2014.
A B S T R A C T International Journal of Advance Foundation and Research in Science & Engineering (IJAFRSE) Information Retrieval Models and Searching Methodologies: Survey Balwinder Saini*,Vikram Singh,Satish
More informationBig Data Greenplum DBA Online Training
About The Greenplum DBA Course Big Data Greenplum DBA Online Training Greenplum on-line coaching course is intended to create you skilled in operating with Greenplum database. Throughout this interactive
More informationCHAPTER 3 A FAST K-MODES CLUSTERING ALGORITHM TO WAREHOUSE VERY LARGE HETEROGENEOUS MEDICAL DATABASES
70 CHAPTER 3 A FAST K-MODES CLUSTERING ALGORITHM TO WAREHOUSE VERY LARGE HETEROGENEOUS MEDICAL DATABASES 3.1 INTRODUCTION In medical science, effective tools are essential to categorize and systematically
More informationINSPIRE and SPIRES Log File Analysis
INSPIRE and SPIRES Log File Analysis Cole Adams Science Undergraduate Laboratory Internship Program Wheaton College SLAC National Accelerator Laboratory August 5, 2011 Prepared in partial fulfillment of
More information