CINXE.COM

<!DOCTYPE html> <html lang="en" dir="ltr"> <head>  <script async src="https://www.googletagmanager.com/gtag/js?id=G-P63WKM1TM1"></script> <script> window.dataLayer = window.dataLayer || []; function gtag(){dataLayer.push(arguments);} gtag('js', new Date()); gtag('config', 'G-P63WKM1TM1'); </script>  <script type="text/javascript" > (function(m,e,t,r,i,k,a){m[i]=m[i]||function(){(m[i].a=m[i].a||[]).push(arguments)}; m[i].l=1*new Date(); for (var j = 0; j < document.scripts.length; j++) {if (document.scripts[j].src === r) { return; }} k=e.createElement(t),a=e.getElementsByTagName(t)[0],k.async=1,k.src=r,a.parentNode.insertBefore(k,a)}) (window, document, "script", "https://mc.yandex.ru/metrika/tag.js", "ym"); ym(55165297, "init", { clickmap:false, trackLinks:true, accurateTrackBounce:true, webvisor:false }); </script> <noscript><div><img src="https://mc.yandex.ru/watch/55165297" style="position:absolute; left:-9999px;" alt="" /></div></noscript>    <title>Search results for: query</title> <meta name="description" content="Search results for: query"> <meta name="keywords" content="query"> <meta name="viewport" content="width=device-width, initial-scale=1, minimum-scale=1, maximum-scale=1, user-scalable=no"> <meta charset="utf-8"> <link href="https://cdn.waset.org/favicon.ico" type="image/x-icon" rel="shortcut icon"> <link href="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/css/bootstrap.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/plugins/fontawesome/css/all.min.css" rel="stylesheet"> <link href="https://cdn.waset.org/static/css/site.css?v=150220211555" rel="stylesheet"> </head> <body> <header> <div class="container"> <nav class="navbar navbar-expand-lg navbar-light"> <a class="navbar-brand" href="https://waset.org"> <img src="https://cdn.waset.org/static/images/wasetc.png" alt="Open Science Research Excellence" title="Open Science Research Excellence" /> </a> <button class="d-block d-lg-none navbar-toggler ml-auto" type="button" data-toggle="collapse" data-target="#navbarMenu" aria-controls="navbarMenu" aria-expanded="false" aria-label="Toggle navigation"> <span class="navbar-toggler-icon"></span> </button> <div class="w-100"> <div class="d-none d-lg-flex flex-row-reverse"> <form method="get" action="https://waset.org/search" class="form-inline my-2 my-lg-0"> <input class="form-control mr-sm-2" type="search" placeholder="Search Conferences" value="query" name="q" aria-label="Search"> <button class="btn btn-light my-2 my-sm-0" type="submit"><i class="fas fa-search"></i></button> </form> </div> <div class="collapse navbar-collapse mt-1" id="navbarMenu"> <ul class="navbar-nav ml-auto align-items-center" id="mainNavMenu"> <li class="nav-item"> <a class="nav-link" href="https://waset.org/conferences" title="Conferences in 2024/2025/2026">Conferences</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/disciplines" title="Disciplines">Disciplines</a> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/committees" rel="nofollow">Committees</a> </li> <li class="nav-item dropdown"> <a class="nav-link dropdown-toggle" href="#" id="navbarDropdownPublications" role="button" data-toggle="dropdown" aria-haspopup="true" aria-expanded="false"> Publications </a> <div class="dropdown-menu" aria-labelledby="navbarDropdownPublications"> <a class="dropdown-item" href="https://publications.waset.org/abstracts">Abstracts</a> <a class="dropdown-item" href="https://publications.waset.org">Periodicals</a> <a class="dropdown-item" href="https://publications.waset.org/archive">Archive</a> </div> </li> <li class="nav-item"> <a class="nav-link" href="https://waset.org/page/support" title="Support">Support</a> </li> </ul> </div> </div> </nav> </div> </header> <main> <div class="container mt-4"> <div class="row"> <div class="col-md-9 mx-auto"> <form method="get" action="https://publications.waset.org/abstracts/search"> <div id="custom-search-input"> <div class="input-group"> <i class="fas fa-search"></i> <input type="text" class="search-query" name="q" placeholder="Author, Title, Abstract, Keywords" value="query"> <input type="submit" class="btn_search" value="Search"> </div> </div> </form> </div> </div> <div class="row mt-3"> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Commenced</strong> in January 2007</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Frequency:</strong> Monthly</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Edition:</strong> International</div> </div> </div> <div class="col-sm-3"> <div class="card"> <div class="card-body"><strong>Paper Count:</strong> 197</div> </div> </div> </div> <h1 class="mt-3 mb-3 text-center" style="font-size:1.6rem;">Search results for: query</h1> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">197</span> Materialized View Effect on Query Performance</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Yusuf%20Ziya%20Ay%C4%B1k">Yusuf Ziya Ayık</a>, <a href="https://publications.waset.org/abstracts/search?q=Ferhat%20Kahveci"> Ferhat Kahveci</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Currently, database management systems have various tools such as backup and maintenance, and also provide statistical information such as resource usage and security. In terms of query performance, this paper covers query optimization, views, indexed tables, pre-computation materialized view, query performance analysis in which query plan alternatives can be created and the least costly one selected to optimize a query. Indexes and views can be created for related table columns. The literature review of this study showed that, in the course of time, despite the growing capabilities of the database management system, only database administrators are aware of the need for dealing with archival and transactional data types differently. These data may be constantly changing data used in everyday life, and also may be from the completed questionnaire whose data input was completed. For both types of data, the database uses its capabilities; but as shown in the findings section, instead of repeating similar heavy calculations which are carrying out same results with the same query over a survey results, using materialized view results can be in a more simple way. In this study, this performance difference was observed quantitatively considering the cost of the query. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=cost%20of%20query" title="cost of query">cost of query</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20management%20systems" title=" database management systems"> database management systems</a>, <a href="https://publications.waset.org/abstracts/search?q=materialized%20view" title=" materialized view"> materialized view</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20performance" title=" query performance"> query performance</a> </p> <a href="https://publications.waset.org/abstracts/62730/materialized-view-effect-on-query-performance" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62730.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">280</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">196</span> Optimization Query Image Using Search Relevance Re-Ranking Process</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=T.%20G.%20Asmitha%20Chandini">T. G. Asmitha Chandini</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Web-based image search re-ranking, as an successful method to get better the results. In a query keyword, the first stair is store the images is first retrieve based on the text-based information. The user to select a query keywordimage, by using this query keyword other images are re-ranked based on their visual properties with images.Now a day to day, people projected to match images in a semantic space which is used attributes or reference classes closely related to the basis of semantic image. though, understanding a worldwide visual semantic space to demonstrate highly different images from the web is difficult and inefficient. The re-ranking images, which automatically offline part learns dissimilar semantic spaces for different query keywords. The features of images are projected into their related semantic spaces to get particular images. At the online stage, images are re-ranked by compare their semantic signatures obtained the semantic précised by the query keyword image. The query-specific semantic signatures extensively improve both the proper and efficiency of image re-ranking. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Query" title="Query">Query</a>, <a href="https://publications.waset.org/abstracts/search?q=keyword" title=" keyword"> keyword</a>, <a href="https://publications.waset.org/abstracts/search?q=image" title=" image"> image</a>, <a href="https://publications.waset.org/abstracts/search?q=re-ranking" title=" re-ranking"> re-ranking</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic" title=" semantic"> semantic</a>, <a href="https://publications.waset.org/abstracts/search?q=signature" title=" signature"> signature</a> </p> <a href="https://publications.waset.org/abstracts/28398/optimization-query-image-using-search-relevance-re-ranking-process" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28398.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">549</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">195</span> Smart Online Library Catalog System with Query Expansion for the University of the Cordilleras</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Vincent%20Ballola">Vincent Ballola</a>, <a href="https://publications.waset.org/abstracts/search?q=Raymund%20Dilan"> Raymund Dilan</a>, <a href="https://publications.waset.org/abstracts/search?q=Thelma%20Palaoag"> Thelma Palaoag</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The Smart Online Library Catalog System with Query Expansion seeks to address the low usage of the library because of the emergence of the Internet. Library users are not accustomed to catalog systems that need a query to have the exact words without any mistakes for decent results to appear. The graphical user interface of the current system has a rather skewed learning curve for users to adapt with. With a simple graphical user interface inspired by Google, users can search quickly just by inputting their query and hitting the search button. Because of the query expansion techniques incorporated into the new system such as stemming, thesaurus search, and weighted search, users can have more efficient results from their query. The system will be adding the root words of the user's query to the query itself which will then be cross-referenced to a thesaurus database to search for any synonyms that will be added to the query. The results will then be arranged by the number of times the word has been searched. Online queries will also be added to the results for additional references. Users showed notable increases in efficiency and usability due to the familiar interface and query expansion techniques incorporated in the system. The simple yet familiar design led to a better user experience. Users also said that they would be more inclined in using the library because of the new system. The incorporation of query expansion techniques gives a notable increase of results to users that in turn gives them a wider range of resources found in the library. Used books mean more knowledge imparted to the users. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=query%20expansion" title="query expansion">query expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=catalog%20system" title=" catalog system"> catalog system</a>, <a href="https://publications.waset.org/abstracts/search?q=stemming" title=" stemming"> stemming</a>, <a href="https://publications.waset.org/abstracts/search?q=weighted%20search" title=" weighted search"> weighted search</a>, <a href="https://publications.waset.org/abstracts/search?q=usability" title=" usability"> usability</a>, <a href="https://publications.waset.org/abstracts/search?q=thesaurus%20search" title=" thesaurus search"> thesaurus search</a> </p> <a href="https://publications.waset.org/abstracts/62358/smart-online-library-catalog-system-with-query-expansion-for-the-university-of-the-cordilleras" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/62358.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">388</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">194</span> A Query Optimization Strategy for Autonomous Distributed Database Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Dina%20K.%20Badawy">Dina K. Badawy</a>, <a href="https://publications.waset.org/abstracts/search?q=Dina%20M.%20Ibrahim"> Dina M. Ibrahim</a>, <a href="https://publications.waset.org/abstracts/search?q=Alsayed%20A.%20Sallam"> Alsayed A. Sallam</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Distributed database is a collection of logically related databases that cooperate in a transparent manner. Query processing uses a communication network for transmitting data between sites. It refers to one of the challenges in the database world. The development of sophisticated query optimization technology is the reason for the commercial success of database systems, which complexity and cost increase with increasing number of relations in the query. Mariposa, query trading and query trading with processing task-trading strategies developed for autonomous distributed database systems, but they cause high optimization cost because of involvement of all nodes in generating an optimal plan. In this paper, we proposed a modification on the autonomous strategy K-QTPT that make the seller’s nodes with the lowest cost have gradually high priorities to reduce the optimization time. We implement our proposed strategy and present the results and analysis based on those results. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=autonomous%20strategies" title="autonomous strategies">autonomous strategies</a>, <a href="https://publications.waset.org/abstracts/search?q=distributed%20database%20systems" title=" distributed database systems"> distributed database systems</a>, <a href="https://publications.waset.org/abstracts/search?q=high%20priority" title=" high priority"> high priority</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20optimization" title=" query optimization"> query optimization</a> </p> <a href="https://publications.waset.org/abstracts/81476/a-query-optimization-strategy-for-autonomous-distributed-database-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/81476.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">523</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">193</span> Dynamic Store Procedures in Database</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Muhammet%20Dursun%20Kaya">Muhammet Dursun Kaya</a>, <a href="https://publications.waset.org/abstracts/search?q=Hasan%20Asil"> Hasan Asil</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years, different methods have been proposed to optimize question processing in database. Although different methods have been proposed to optimize the query, but the problem which exists here is that most of these methods destroy the query execution plan after executing the query. This research attempts to solve the above problem by using a combination of methods of communicating with the database (the present questions in the programming code and using store procedures) and making query processing adaptive in database, and proposing a new approach for optimization of query processing by introducing the idea of dynamic store procedures. This research creates dynamic store procedures in the database according to the proposed algorithm. This method has been tested on applied software and results shows a significant improvement in reducing the query processing time and also reducing the workload of DBMS. Other advantages of this algorithm include: making the programming environment a single environment, eliminating the parametric limitations of the stored procedures in the database, making the stored procedures in the database dynamic, etc. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title="relational database">relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=agent" title=" agent"> agent</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20processing" title=" query processing"> query processing</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptable" title=" adaptable"> adaptable</a>, <a href="https://publications.waset.org/abstracts/search?q=communication%20with%20the%20database" title=" communication with the database"> communication with the database</a> </p> <a href="https://publications.waset.org/abstracts/35023/dynamic-store-procedures-in-database" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/35023.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">371</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">192</span> Searching k-Nearest Neighbors to be Appropriate under Gaming Environments</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Jae%20Moon%20Lee">Jae Moon Lee</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In general, algorithms to find continuous k-nearest neighbors have been researched on the location based services, monitoring periodically the moving objects such as vehicles and mobile phone. Those researches assume the environment that the number of query points is much less than that of moving objects and the query points are not moved but fixed. In gaming environments, this problem is when computing the next movement considering the neighbors such as flocking, crowd and robot simulations. In this case, every moving object becomes a query point so that the number of query point is same to that of moving objects and the query points are also moving. In this paper, we analyze the performance of the existing algorithms focused on location based services how they operate under gaming environments. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=flocking%20behavior" title="flocking behavior">flocking behavior</a>, <a href="https://publications.waset.org/abstracts/search?q=heterogeneous%20agents" title=" heterogeneous agents"> heterogeneous agents</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity" title=" similarity"> similarity</a>, <a href="https://publications.waset.org/abstracts/search?q=simulation" title=" simulation"> simulation</a> </p> <a href="https://publications.waset.org/abstracts/8228/searching-k-nearest-neighbors-to-be-appropriate-under-gaming-environments" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/8228.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">302</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">191</span> Comparison of Crossover Types to Obtain Optimal Queries Using Adaptive Genetic Algorithm</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Wafa%E2%80%99%20Alma%27Aitah">Wafa’ Alma'Aitah</a>, <a href="https://publications.waset.org/abstracts/search?q=Khaled%20Almakadmeh"> Khaled Almakadmeh</a> </p> <p class="card-text"><strong>Abstract:</strong></p> this study presents an information retrieval system of using genetic algorithm to increase information retrieval efficiency. Using vector space model, information retrieval is based on the similarity measurement between query and documents. Documents with high similarity to query are judge more relevant to the query and should be retrieved first. Using genetic algorithms, each query is represented by a chromosome; these chromosomes are fed into genetic operator process: selection, crossover, and mutation until an optimized query chromosome is obtained for document retrieval. Results show that information retrieval with adaptive crossover probability and single point type crossover and roulette wheel as selection type give the highest recall. The proposed approach is verified using (242) proceedings abstracts collected from the Saudi Arabian national conference. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=genetic%20algorithm" title="genetic algorithm">genetic algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title=" information retrieval"> information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20queries" title=" optimal queries"> optimal queries</a>, <a href="https://publications.waset.org/abstracts/search?q=crossover" title=" crossover"> crossover</a> </p> <a href="https://publications.waset.org/abstracts/59109/comparison-of-crossover-types-to-obtain-optimal-queries-using-adaptive-genetic-algorithm" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/59109.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">292</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">190</span> On Privacy-Preserving Search in the Encrypted Domain</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chun-Shien%20Lu">Chun-Shien Lu</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Privacy-preserving query has recently received considerable attention in the signal processing and multimedia community. It is also a critical step in wireless sensor network for retrieval of sensitive data. The purposes of privacy-preserving query in both the areas of signal processing and sensor network are the same, but the similarity and difference of the adopted technologies are not fully explored. In this paper, we first review the recently developed methods of privacy-preserving query, and then describe in a comprehensive manner what we can learn from the mutual of both areas. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=encryption" title="encryption">encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy-preserving" title=" privacy-preserving"> privacy-preserving</a>, <a href="https://publications.waset.org/abstracts/search?q=search" title=" search"> search</a>, <a href="https://publications.waset.org/abstracts/search?q=security" title=" security"> security</a> </p> <a href="https://publications.waset.org/abstracts/55834/on-privacy-preserving-search-in-the-encrypted-domain" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/55834.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">256</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">189</span> User Guidance for Effective Query Interpretation in Natural Language Interfaces to Ontologies</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aliyu%20Isah%20Agaie">Aliyu Isah Agaie</a>, <a href="https://publications.waset.org/abstracts/search?q=Masrah%20Azrifah%20Azmi%20Murad"> Masrah Azrifah Azmi Murad</a>, <a href="https://publications.waset.org/abstracts/search?q=Nurfadhlina%20Mohd%20Sharef"> Nurfadhlina Mohd Sharef</a>, <a href="https://publications.waset.org/abstracts/search?q=Aida%20Mustapha"> Aida Mustapha </a> </p> <p class="card-text"><strong>Abstract:</strong></p> Natural Language Interfaces typically support a restricted language and also have scopes and limitations that naïve users are unaware of, resulting in errors when the users attempt to retrieve information from ontologies. To overcome this challenge, an auto-suggest feature is introduced into the querying process where users are guided through the querying process using interactive query construction system. Guiding users to formulate their queries, while providing them with an unconstrained (or almost unconstrained) way to query the ontology results in better interpretation of the query and ultimately lead to an effective search. The approach described in this paper is unobtrusive and subtly guides the users, so that they have a choice of either selecting from the suggestion list or typing in full. The user is not coerced into accepting system suggestions and can express himself using fragments or full sentences. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=auto-suggest" title="auto-suggest">auto-suggest</a>, <a href="https://publications.waset.org/abstracts/search?q=expressiveness" title=" expressiveness"> expressiveness</a>, <a href="https://publications.waset.org/abstracts/search?q=habitability" title=" habitability"> habitability</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20interface" title=" natural language interface"> natural language interface</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20interpretation" title=" query interpretation"> query interpretation</a>, <a href="https://publications.waset.org/abstracts/search?q=user%20guidance" title=" user guidance"> user guidance</a> </p> <a href="https://publications.waset.org/abstracts/42815/user-guidance-for-effective-query-interpretation-in-natural-language-interfaces-to-ontologies" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/42815.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">474</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">188</span> Multiple Query Optimization in Wireless Sensor Networks Using Data Correlation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Elaheh%20Vaezpour">Elaheh Vaezpour</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Data sensing in wireless sensor networks is done by query deceleration the network by the users. In many applications of the wireless sensor networks, many users send queries to the network simultaneously. If the queries are processed separately, the network’s energy consumption will increase significantly. Therefore, it is very important to aggregate the queries before sending them to the network. In this paper, we propose a multiple query optimization framework based on sensors physical and temporal correlation. In the proposed method, queries are merged and sent to network by considering correlation among the sensors in order to reduce the communication cost between the sensors and the base station. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=wireless%20sensor%20networks" title="wireless sensor networks">wireless sensor networks</a>, <a href="https://publications.waset.org/abstracts/search?q=multiple%20query%20optimization" title=" multiple query optimization"> multiple query optimization</a>, <a href="https://publications.waset.org/abstracts/search?q=data%20correlation" title=" data correlation"> data correlation</a>, <a href="https://publications.waset.org/abstracts/search?q=reducing%20energy%20consumption" title=" reducing energy consumption"> reducing energy consumption</a> </p> <a href="https://publications.waset.org/abstracts/73399/multiple-query-optimization-in-wireless-sensor-networks-using-data-correlation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/73399.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">334</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">187</span> Semantic Search Engine Based on Query Expansion with Google Ranking and Similarity Measures</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahmad%20Shahin">Ahmad Shahin</a>, <a href="https://publications.waset.org/abstracts/search?q=Fadi%20Chakik"> Fadi Chakik</a>, <a href="https://publications.waset.org/abstracts/search?q=Walid%20Moudani"> Walid Moudani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Our study is about elaborating a potential solution for a search engine that involves semantic technology to retrieve information and display it significantly. Semantic search engines are not used widely over the web as the majorities are still in Beta stage or under construction. Many problems face the current applications in semantic search, the major problem is to analyze and calculate the meaning of query in order to retrieve relevant information. Another problem is the ontology based index and its updates. Ranking results according to concept meaning and its relation with query is another challenge. In this paper, we are offering a light meta-engine (QESM) which uses Google search, and therefore Google’s index, with some adaptations to its returned results by adding multi-query expansion. The mission was to find a reliable ranking algorithm that involves semantics and uses concepts and meanings to rank results. At the beginning, the engine finds synonyms of each query term entered by the user based on a lexical database. Then, query expansion is applied to generate different semantically analogous sentences. These are generated randomly by combining the found synonyms and the original query terms. Our model suggests the use of semantic similarity measures between two sentences. Practically, we used this method to calculate semantic similarity between each query and the description of each page’s content generated by Google. The generated sentences are sent to Google engine one by one, and ranked again all together with the adapted ranking method (QESM). Finally, our system will place Google pages with higher similarities on the top of the results. We have conducted experimentations with 6 different queries. We have observed that most ranked results with QESM were altered with Google’s original generated pages. With our experimented queries, QESM generates frequently better accuracy than Google. In some worst cases, it behaves like Google. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=semantic%20search%20engine" title="semantic search engine">semantic search engine</a>, <a href="https://publications.waset.org/abstracts/search?q=Google%20indexing" title=" Google indexing"> Google indexing</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20expansion" title=" query expansion"> query expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=similarity%20measures" title=" similarity measures"> similarity measures</a> </p> <a href="https://publications.waset.org/abstracts/10857/semantic-search-engine-based-on-query-expansion-with-google-ranking-and-similarity-measures" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/10857.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">425</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">186</span> Unsupervised Domain Adaptive Text Retrieval with Query Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rui%20Yin">Rui Yin</a>, <a href="https://publications.waset.org/abstracts/search?q=Haojie%20Wang"> Haojie Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xun%20Li"> Xun Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, mainstream dense retrieval methods have obtained state-of-the-art results on some datasets and tasks. However, they require large amounts of training data, which is not available in most domains. The severe performance degradation of dense retrievers on new data domains has limited the use of dense retrieval methods to only a few domains with large training datasets. In this paper, we propose an unsupervised domain-adaptive approach based on query generation. First, a generative model is used to generate relevant queries for each passage in the target corpus, and then the generated queries are used for mining negative passages. Finally, the query-passage pairs are labeled with a cross-encoder and used to train a domain-adapted dense retriever. Experiments show that our approach is more robust than previous methods in target domains that require less unlabeled data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dense%20retrieval" title="dense retrieval">dense retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20generation" title=" query generation"> query generation</a>, <a href="https://publications.waset.org/abstracts/search?q=unsupervised%20training" title=" unsupervised training"> unsupervised training</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20retrieval" title=" text retrieval"> text retrieval</a> </p> <a href="https://publications.waset.org/abstracts/173903/unsupervised-domain-adaptive-text-retrieval-with-query-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/173903.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">73</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">185</span> Distributed Real-Time Range Query Approximation in a Streaming Environment</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Simon%20Keller">Simon Keller</a>, <a href="https://publications.waset.org/abstracts/search?q=Rainer%20Mueller"> Rainer Mueller</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Continuous range queries are a common means to handle mobile clients in high-density areas. Most existing approaches focus on settings in which the range queries for location-based services are more or less static, whereas the mobile clients in the ranges move. We focus on a category called dynamic real-time range queries (DRRQ), assuming that both, clients requested by the query and the inquirers, are mobile. In consequence, the query parameters and the query results continuously change. This leads to two requirements: the ability to deal with an arbitrarily high number of mobile nodes (scalability) and the real-time delivery of range query results. In this paper, we present the highly decentralized solution adaptive quad streaming (AQS) for the requirements of DRRQs. AQS approximates the query results in favor of a controlled real-time delivery and guaranteed scalability. While prior works commonly optimize data structures on the involved servers, we use AQS to focus on a highly distributed cell structure without data structures automatically adapting to changing client distributions. Instead of the commonly used request-response approach, we apply a lightweight streaming method in which no bidirectional communication and no storage or maintenance of queries are required at all. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=approximation%20of%20client%20distributions" title="approximation of client distributions">approximation of client distributions</a>, <a href="https://publications.waset.org/abstracts/search?q=continuous%20spatial%20range%20queries" title=" continuous spatial range queries"> continuous spatial range queries</a>, <a href="https://publications.waset.org/abstracts/search?q=mobile%20objects" title=" mobile objects"> mobile objects</a>, <a href="https://publications.waset.org/abstracts/search?q=streaming-based%20decentralization%20in%20spatial%20mobile%20environments" title=" streaming-based decentralization in spatial mobile environments"> streaming-based decentralization in spatial mobile environments</a> </p> <a href="https://publications.waset.org/abstracts/129023/distributed-real-time-range-query-approximation-in-a-streaming-environment" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/129023.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">144</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">184</span> Representativity Based Wasserstein Active Regression</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Benjamin%20Bobbia">Benjamin Bobbia</a>, <a href="https://publications.waset.org/abstracts/search?q=Matthias%20Picard"> Matthias Picard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In recent years active learning methodologies based on the representativity of the data seems more promising to limit overfitting. The presented query methodology for regression using the Wasserstein distance measuring the representativity of our labelled dataset compared to the global distribution. In this work a crucial use of GroupSort Neural Networks is made therewith to draw a double advantage. The Wasserstein distance can be exactly expressed in terms of such neural networks. Moreover, one can provide explicit bounds for their size and depth together with rates of convergence. However, heterogeneity of the dataset is also considered by weighting the Wasserstein distance with the error of approximation at the previous step of active learning. Such an approach leads to a reduction of overfitting and high prediction performance after few steps of query. After having detailed the methodology and algorithm, an empirical study is presented in order to investigate the range of our hyperparameters. The performances of this method are compared, in terms of numbers of query needed, with other classical and recent query methods on several UCI datasets. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=active%20learning" title="active learning">active learning</a>, <a href="https://publications.waset.org/abstracts/search?q=Lipschitz%20regularization" title=" Lipschitz regularization"> Lipschitz regularization</a>, <a href="https://publications.waset.org/abstracts/search?q=neural%20networks" title=" neural networks"> neural networks</a>, <a href="https://publications.waset.org/abstracts/search?q=optimal%20transport" title=" optimal transport"> optimal transport</a>, <a href="https://publications.waset.org/abstracts/search?q=regression" title=" regression"> regression</a> </p> <a href="https://publications.waset.org/abstracts/163461/representativity-based-wasserstein-active-regression" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/163461.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">80</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">183</span> Towards Learning Query Expansion</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ahlem%20Bouziri">Ahlem Bouziri</a>, <a href="https://publications.waset.org/abstracts/search?q=Chiraz%20Latiri"> Chiraz Latiri</a>, <a href="https://publications.waset.org/abstracts/search?q=Eric%20Gaussier"> Eric Gaussier</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The steady growth in the size of textual document collections is a key progress-driver for modern information retrieval techniques whose effectiveness and efficiency are constantly challenged. Given a user query, the number of retrieved documents can be overwhelmingly large, hampering their efficient exploitation by the user. In addition, retaining only relevant documents in a query answer is of paramount importance for an effective meeting of the user needs. In this situation, the query expansion technique offers an interesting solution for obtaining a complete answer while preserving the quality of retained documents. This mainly relies on an accurate choice of the added terms to an initial query. Interestingly enough, query expansion takes advantage of large text volumes by extracting statistical information about index terms co-occurrences and using it to make user queries better fit the real information needs. In this respect, a promising track consists in the application of data mining methods to extract dependencies between terms, namely a generic basis of association rules between terms. The key feature of our approach is a better trade off between the size of the mining result and the conveyed knowledge. Thus, face to the huge number of derived association rules and in order to select the optimal combination of query terms from the generic basis, we propose to model the problem as a classification problem and solve it using a supervised learning algorithm such as SVM or k-means. For this purpose, we first generate a training set using a genetic algorithm based approach that explores the association rules space in order to find an optimal set of expansion terms, improving the MAP of the search results. The experiments were performed on SDA 95 collection, a data collection for information retrieval. It was found that the results were better in both terms of MAP and NDCG. The main observation is that the hybridization of text mining techniques and query expansion in an intelligent way allows us to incorporate the good features of all of them. As this is a preliminary attempt in this direction, there is a large scope for enhancing the proposed method. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=supervised%20leaning" title="supervised leaning">supervised leaning</a>, <a href="https://publications.waset.org/abstracts/search?q=classification" title=" classification"> classification</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20expansion" title=" query expansion"> query expansion</a>, <a href="https://publications.waset.org/abstracts/search?q=association%20rules" title=" association rules"> association rules</a> </p> <a href="https://publications.waset.org/abstracts/27524/towards-learning-query-expansion" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/27524.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">324</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">182</span> Domain Adaptive Dense Retrieval with Query Generation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rui%20Yin">Rui Yin</a>, <a href="https://publications.waset.org/abstracts/search?q=Haojie%20Wang"> Haojie Wang</a>, <a href="https://publications.waset.org/abstracts/search?q=Xun%20Li"> Xun Li</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Recently, mainstream dense retrieval methods have obtained state-of-the-art results on some datasets and tasks. However, they require large amounts of training data, which is not available in most domains. The severe performance degradation of dense retrievers on new data domains has limited the use of dense retrieval methods to only a few domains with large training datasets. In this paper, we propose an unsupervised domain-adaptive approach based on query generation. First, a generative model is used to generate relevant queries for each passage in the target corpus, and then, the generated queries are used for mining negative passages. Finally, the query-passage pairs are labeled with a cross-encoder and used to train a domain-adapted dense retriever. We also explore contrastive learning as a method for training domain-adapted dense retrievers and show that it leads to strong performance in various retrieval settings. Experiments show that our approach is more robust than previous methods in target domains that require less unlabeled data. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=dense%20retrieval" title="dense retrieval">dense retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20generation" title=" query generation"> query generation</a>, <a href="https://publications.waset.org/abstracts/search?q=contrastive%20learning" title=" contrastive learning"> contrastive learning</a>, <a href="https://publications.waset.org/abstracts/search?q=unsupervised%20training" title=" unsupervised training"> unsupervised training</a> </p> <a href="https://publications.waset.org/abstracts/168338/domain-adaptive-dense-retrieval-with-query-generation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/168338.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">103</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">181</span> Programming Language Extension Using Structured Query Language for Database Access</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chapman%20Eze%20Nnadozie">Chapman Eze Nnadozie</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Relational databases constitute a very vital tool for the effective management and administration of both personal and organizational data. Data access ranges from a single user database management software to a more complex distributed server system. This paper intends to appraise the use a programming language extension like structured query language (SQL) to establish links to a relational database (Microsoft Access 2013) using Visual C++ 9 programming language environment. The methodology used involves the creation of tables to form a database using Microsoft Access 2013, which is Object Linking and Embedding (OLE) database compliant. The SQL command is used to query the tables in the database for easy extraction of expected records inside the visual C++ environment. The findings of this paper reveal that records can easily be accessed and manipulated to filter exactly what the user wants, such as retrieval of records with specified criteria, updating of records, and deletion of part or the whole records in a table. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=data%20access" title="data access">data access</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a>, <a href="https://publications.waset.org/abstracts/search?q=database%20management%20system" title=" database management system"> database management system</a>, <a href="https://publications.waset.org/abstracts/search?q=OLE" title=" OLE"> OLE</a>, <a href="https://publications.waset.org/abstracts/search?q=programming%20language" title=" programming language"> programming language</a>, <a href="https://publications.waset.org/abstracts/search?q=records" title=" records"> records</a>, <a href="https://publications.waset.org/abstracts/search?q=relational%20database" title=" relational database"> relational database</a>, <a href="https://publications.waset.org/abstracts/search?q=software" title=" software"> software</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL" title=" SQL"> SQL</a>, <a href="https://publications.waset.org/abstracts/search?q=table" title=" table"> table</a> </p> <a href="https://publications.waset.org/abstracts/83796/programming-language-extension-using-structured-query-language-for-database-access" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/83796.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">187</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">180</span> Graph-Oriented Summary for Optimized Resource Description Framework Graphs Streams Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Amadou%20Fall%20Dia">Amadou Fall Dia</a>, <a href="https://publications.waset.org/abstracts/search?q=Maurras%20Ulbricht%20Togbe"> Maurras Ulbricht Togbe</a>, <a href="https://publications.waset.org/abstracts/search?q=Aliou%20Boly"> Aliou Boly</a>, <a href="https://publications.waset.org/abstracts/search?q=Zakia%20Kazi%20Aoul"> Zakia Kazi Aoul</a>, <a href="https://publications.waset.org/abstracts/search?q=Elisabeth%20Metais"> Elisabeth Metais</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Existing RDF (Resource Description Framework) Stream Processing (RSP) systems allow continuous processing of RDF data issued from different application domains such as weather station measuring phenomena, geolocation, IoT applications, drinking water distribution management, and so on. However, processing window phase often expires before finishing the entire session and RSP systems immediately delete data streams after each processed window. Such mechanism does not allow optimized exploitation of the RDF data streams as the most relevant and pertinent information of the data is often not used in a due time and almost impossible to be exploited for further analyzes. It should be better to keep the most informative part of data within streams while minimizing the memory storage space. In this work, we propose an RDF graph summarization system based on an explicit and implicit expressed needs through three main approaches: (1) an approach for user queries (SPARQL) in order to extract their needs and group them into a more global query, (2) an extension of the closeness centrality measure issued from Social Network Analysis (SNA) to determine the most informative parts of the graph and (3) an RDF graph summarization technique combining extracted user query needs and the extended centrality measure. Experiments and evaluations show efficient results in terms of memory space storage and the most expected approximate query results on summarized graphs compared to the source ones. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=centrality%20measures" title="centrality measures">centrality measures</a>, <a href="https://publications.waset.org/abstracts/search?q=RDF%20graphs%20summary" title=" RDF graphs summary"> RDF graphs summary</a>, <a href="https://publications.waset.org/abstracts/search?q=RDF%20graphs%20stream" title=" RDF graphs stream"> RDF graphs stream</a>, <a href="https://publications.waset.org/abstracts/search?q=SPARQL%20query" title=" SPARQL query"> SPARQL query</a> </p> <a href="https://publications.waset.org/abstracts/88106/graph-oriented-summary-for-optimized-resource-description-framework-graphs-streams-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/88106.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">203</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">179</span> Resource Creation Using Natural Language Processing Techniques for Malay Translated Qur'an</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Nor%20Diana%20Ahmad">Nor Diana Ahmad</a>, <a href="https://publications.waset.org/abstracts/search?q=Eric%20Atwell"> Eric Atwell</a>, <a href="https://publications.waset.org/abstracts/search?q=Brandon%20Bennett"> Brandon Bennett</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Text processing techniques for English have been developed for several decades. But for the Malay language, text processing methods are still far behind. Moreover, there are limited resources, tools for computational linguistic analysis available for the Malay language. Therefore, this research presents the use of natural language processing (NLP) in processing Malay translated Qur’an text. As the result, a new language resource for Malay translated Qur’an was created. This resource will help other researchers to build the necessary processing tools for the Malay language. This research also develops a simple question-answer prototype to demonstrate the use of the Malay Qur’an resource for text processing. This prototype has been developed using Python. The prototype pre-processes the Malay Qur’an and an input query using a stemming algorithm and then searches for occurrences of the query word stem. The result produced shows improved matching likelihood between user query and its answer. A POS-tagging algorithm has also been produced. The stemming and tagging algorithms can be used as tools for research related to other Malay texts and can be used to support applications such as information retrieval, question answering systems, ontology-based search and other text analysis tasks. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=language%20resource" title="language resource">language resource</a>, <a href="https://publications.waset.org/abstracts/search?q=Malay%20translated%20Qur%27an" title=" Malay translated Qur'an"> Malay translated Qur'an</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20processing%20%28NLP%29" title=" natural language processing (NLP)"> natural language processing (NLP)</a>, <a href="https://publications.waset.org/abstracts/search?q=text%20processing" title=" text processing"> text processing</a> </p> <a href="https://publications.waset.org/abstracts/92441/resource-creation-using-natural-language-processing-techniques-for-malay-translated-quran" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/92441.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">318</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">178</span> Query Task Modulator: A Computerized Experimentation System to Study Media-Multitasking Behavior</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Premjit%20K.%20Sanjram">Premjit K. Sanjram</a>, <a href="https://publications.waset.org/abstracts/search?q=Gagan%20Jakhotiya"> Gagan Jakhotiya</a>, <a href="https://publications.waset.org/abstracts/search?q=Apoorv%20Goyal"> Apoorv Goyal</a>, <a href="https://publications.waset.org/abstracts/search?q=Shanu%20Shukla"> Shanu Shukla</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In psychological research, laboratory experiments often face the trade-off issue between experimental control and mundane realism. With the advent of Immersive Virtual Environment Technology (IVET), this issue seems to be at bay. However there is a growing challenge within the IVET itself to design and develop system or software that captures the psychological phenomenon of everyday lives. One such phenomena that is of growing interest is ‘media-multitasking’ To aid laboratory researches in media-multitasking this paper introduces Query Task Modulator (QTM), a computerized experimentation system to study media-multitasking behavior in a controlled laboratory environment. The system provides a computerized platform in conducting an experiment for experimenters to study media-multitasking in which participants will be involved in a query task. The system has Instant Messaging, E-mail, and Voice Call features. The answers to queries are provided on the left hand side information panel where participants have to search for it and feed the information in the respective communication media blocks as fast as possible. On the whole the system will collect multitasking behavioral data. To analyze performance there is a separate output table that records the reaction times and responses of the participants individually. Information panel and all the media blocks will appear on a single window in order to ensure multi-modality feature in media-multitasking and equal emphasis on all the tasks (thus avoiding prioritization to a particular task). The paper discusses the development of QTM in the light of current techniques of studying media-multitasking. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=experimentation%20system" title="experimentation system">experimentation system</a>, <a href="https://publications.waset.org/abstracts/search?q=human%20performance" title=" human performance"> human performance</a>, <a href="https://publications.waset.org/abstracts/search?q=media-multitasking" title=" media-multitasking"> media-multitasking</a>, <a href="https://publications.waset.org/abstracts/search?q=query-task" title=" query-task"> query-task</a> </p> <a href="https://publications.waset.org/abstracts/17481/query-task-modulator-a-computerized-experimentation-system-to-study-media-multitasking-behavior" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/17481.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">557</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">177</span> Perusing the Influence of a Visual Editor in Enabling PostgreSQL Query Learn-Ability</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Manuela%20Nayantara%20Jeyaraj">Manuela Nayantara Jeyaraj</a> </p> <p class="card-text"><strong>Abstract:</strong></p> PostgreSQL is an Object-Relational Database Management System (ORDBMS) with an architecture that ensures optimal quality data management. But due to the shading growth of similar ORDBMS, PostgreSQL has not been renowned among the database user community. Despite having its features and in-built functionalities shadowed, PostgreSQL renders a vast range of utilities for data manipulation and hence calling for it to be upheld more among users. But introducing PostgreSQL in order to stimulate its advantageous features among users, mandates endorsing learn-ability as an add-on as the target groups considered consist of both amateur as well as professional PostgreSQL users. The scope of this paper deliberates providing easy contemplation of query formulations and flows through a visual editor designed according to user interface principles that standby to support every aspect of making PostgreSQL learn-able by self-operation and creation of queries within the visual editor. This paper tends to scrutinize the importance of choosing PostgreSQL as the working database environment, the visual perspectives that influence human behaviour and ultimately learning, the modes in which learn-ability can be provided via visualization and the advantages reaped by the implementation of the proposed system features. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=database" title="database">database</a>, <a href="https://publications.waset.org/abstracts/search?q=learn-ability" title=" learn-ability"> learn-ability</a>, <a href="https://publications.waset.org/abstracts/search?q=PostgreSQL" title=" PostgreSQL"> PostgreSQL</a>, <a href="https://publications.waset.org/abstracts/search?q=query" title=" query"> query</a>, <a href="https://publications.waset.org/abstracts/search?q=visual-editor" title=" visual-editor"> visual-editor</a> </p> <a href="https://publications.waset.org/abstracts/86174/perusing-the-influence-of-a-visual-editor-in-enabling-postgresql-query-learn-ability" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/86174.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">174</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">176</span> Book Recommendation Using Query Expansion and Information Retrieval Methods</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Ritesh%20Kumar">Ritesh Kumar</a>, <a href="https://publications.waset.org/abstracts/search?q=Rajendra%20Pamula"> Rajendra Pamula</a> </p> <p class="card-text"><strong>Abstract:</strong></p> In this paper, we present our contribution for book recommendation. In our experiment, we combine the results of Sequential Dependence Model (SDM) and exploitation of book information such as reviews, tags and ratings. This social information is assigned by users. For this, we used CLEF-2016 Social Book Search Track Suggestion task. Finally, our proposed method extensively evaluated on CLEF -2015 Social Book Search datasets, and has better performance (nDCG@10) compared to other state-of-the-art systems. Recently we got the good performance in CLEF-2016. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=sequential%20dependence%20model" title="sequential dependence model">sequential dependence model</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20information" title=" social information"> social information</a>, <a href="https://publications.waset.org/abstracts/search?q=social%20book%20search" title=" social book search"> social book search</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20expansion" title=" query expansion"> query expansion</a> </p> <a href="https://publications.waset.org/abstracts/68130/book-recommendation-using-query-expansion-and-information-retrieval-methods" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/68130.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">175</span> A Framework for SQL Learning: Linking Learning Taxonomy, Cognitive Model and Cross Cutting Factors</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Huda%20Al%20Shuaily">Huda Al Shuaily</a>, <a href="https://publications.waset.org/abstracts/search?q=Karen%20Renaud"> Karen Renaud</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Databases comprise the foundation of most software systems. System developers inevitably write code to query these databases. The de facto language for querying is SQL and this, consequently, is the default language taught by higher education institutions. There is evidence that learners find it hard to master SQL, harder than mastering other programming languages such as Java. Educators do not agree about explanations for this seeming anomaly. Further investigation may well reveal the reasons. In this paper, we report on our investigations into how novices learn SQL, the actual problems they experience when writing SQL, as well as the differences between expert and novice SQL query writers. We conclude by presenting a model of SQL learning that should inform the instructional material design process better to support the SQL learning process. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=pattern" title="pattern">pattern</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL" title=" SQL"> SQL</a>, <a href="https://publications.waset.org/abstracts/search?q=learning" title=" learning"> learning</a>, <a href="https://publications.waset.org/abstracts/search?q=model" title=" model"> model</a> </p> <a href="https://publications.waset.org/abstracts/53944/a-framework-for-sql-learning-linking-learning-taxonomy-cognitive-model-and-cross-cutting-factors" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/53944.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">254</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">174</span> Interactive, Topic-Oriented Search Support by a Centroid-Based Text Categorisation</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mario%20Kubek">Mario Kubek</a>, <a href="https://publications.waset.org/abstracts/search?q=Herwig%20Unger"> Herwig Unger</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Centroid terms are single words that semantically and topically characterise text documents and so may serve as their very compact representation in automatic text processing. In the present paper, centroids are used to measure the relevance of text documents with respect to a given search query. Thus, a new graphbased paradigm for searching texts in large corpora is proposed and evaluated against keyword-based methods. The first, promising experimental results demonstrate the usefulness of the centroid-based search procedure. It is shown that especially the routing of search queries in interactive and decentralised search systems can be greatly improved by applying this approach. A detailed discussion on further fields of its application completes this contribution. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=search%20algorithm" title="search algorithm">search algorithm</a>, <a href="https://publications.waset.org/abstracts/search?q=centroid" title=" centroid"> centroid</a>, <a href="https://publications.waset.org/abstracts/search?q=query" title=" query"> query</a>, <a href="https://publications.waset.org/abstracts/search?q=keyword" title=" keyword"> keyword</a>, <a href="https://publications.waset.org/abstracts/search?q=co-occurrence" title=" co-occurrence"> co-occurrence</a>, <a href="https://publications.waset.org/abstracts/search?q=categorisation" title=" categorisation"> categorisation</a> </p> <a href="https://publications.waset.org/abstracts/82581/interactive-topic-oriented-search-support-by-a-centroid-based-text-categorisation" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/82581.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">282</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">173</span> Relevance Feedback within CBIR Systems</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Mawloud%20Mosbah">Mawloud Mosbah</a>, <a href="https://publications.waset.org/abstracts/search?q=Bachir%20Boucheham"> Bachir Boucheham</a> </p> <p class="card-text"><strong>Abstract:</strong></p> We present here the results for a comparative study of some techniques, available in the literature, related to the relevance feedback mechanism in the case of a short-term learning. Only one method among those considered here is belonging to the data mining field which is the K-Nearest Neighbours Algorithm (KNN) while the rest of the methods is related purely to the information retrieval field and they fall under the purview of the following three major axes: Shifting query, Feature Weighting and the optimization of the parameters of similarity metric. As a contribution, and in addition to the comparative purpose, we propose a new version of the KNN algorithm referred to as an incremental KNN which is distinct from the original version in the sense that besides the influence of the seeds, the rate of the actual target image is influenced also by the images already rated. The results presented here have been obtained after experiments conducted on the Wang database for one iteration and utilizing colour moments on the RGB space. This compact descriptor, Colour Moments, is adequate for the efficiency purposes needed in the case of interactive systems. The results obtained allow us to claim that the proposed algorithm proves good results; it even outperforms a wide range of techniques available in the literature. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=CBIR" title="CBIR">CBIR</a>, <a href="https://publications.waset.org/abstracts/search?q=category%20search" title=" category search"> category search</a>, <a href="https://publications.waset.org/abstracts/search?q=relevance%20feedback" title=" relevance feedback"> relevance feedback</a>, <a href="https://publications.waset.org/abstracts/search?q=query%20point%20movement" title=" query point movement"> query point movement</a>, <a href="https://publications.waset.org/abstracts/search?q=standard%20Rocchio%E2%80%99s%20formula" title=" standard Rocchio’s formula"> standard Rocchio’s formula</a>, <a href="https://publications.waset.org/abstracts/search?q=adaptive%20shifting%20query" title=" adaptive shifting query"> adaptive shifting query</a>, <a href="https://publications.waset.org/abstracts/search?q=feature%20weighting" title=" feature weighting"> feature weighting</a>, <a href="https://publications.waset.org/abstracts/search?q=original%20KNN" title=" original KNN"> original KNN</a>, <a href="https://publications.waset.org/abstracts/search?q=incremental%20KNN" title=" incremental KNN"> incremental KNN</a> </p> <a href="https://publications.waset.org/abstracts/7872/relevance-feedback-within-cbir-systems" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/7872.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">280</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">172</span> Parallel Querying of Distributed Ontologies with Shared Vocabulary</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Sharjeel%20Aslam">Sharjeel Aslam</a>, <a href="https://publications.waset.org/abstracts/search?q=Vassil%20Vassilev"> Vassil Vassilev</a>, <a href="https://publications.waset.org/abstracts/search?q=Karim%20Ouazzane"> Karim Ouazzane</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Ontologies and various semantic repositories became a convenient approach for implementing model-driven architectures of distributed systems on the Web. SPARQL is the standard query language for querying such. However, although SPARQL is well-established standard for querying semantic repositories in RDF and OWL format and there are commonly used APIs which supports it, like Jena for Java, its parallel option is not incorporated in them. This article presents a complete framework consisting of an object algebra for parallel RDF and an index-based implementation of the parallel query engine capable of dealing with the distributed RDF ontologies which share common vocabulary. It has been implemented in Java, and for validation of the algorithms has been applied to the problem of organizing virtual exhibitions on the Web. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=distributed%20ontologies" title="distributed ontologies">distributed ontologies</a>, <a href="https://publications.waset.org/abstracts/search?q=parallel%20querying" title=" parallel querying"> parallel querying</a>, <a href="https://publications.waset.org/abstracts/search?q=semantic%20indexing" title=" semantic indexing"> semantic indexing</a>, <a href="https://publications.waset.org/abstracts/search?q=shared%20vocabulary" title=" shared vocabulary"> shared vocabulary</a>, <a href="https://publications.waset.org/abstracts/search?q=SPARQL" title=" SPARQL"> SPARQL</a> </p> <a href="https://publications.waset.org/abstracts/105046/parallel-querying-of-distributed-ontologies-with-shared-vocabulary" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/105046.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">204</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">171</span> A Privacy Protection Scheme Supporting Fuzzy Search for NDN Routing Cache Data Name</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Feng%20Tao">Feng Tao</a>, <a href="https://publications.waset.org/abstracts/search?q=Ma%20Jing"> Ma Jing</a>, <a href="https://publications.waset.org/abstracts/search?q=Guo%20Xian"> Guo Xian</a>, <a href="https://publications.waset.org/abstracts/search?q=Wang%20Jing"> Wang Jing</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Named Data Networking (NDN) replaces IP address of traditional network with data name, and adopts dynamic cache mechanism. In the existing mechanism, however, only one-to-one search can be achieved because every data has a unique name corresponding to it. There is a certain mapping relationship between data content and data name, so if the data name is intercepted by an adversary, the privacy of the data content and user’s interest can hardly be guaranteed. In order to solve this problem, this paper proposes a one-to-many fuzzy search scheme based on order-preserving encryption to reduce the query overhead by optimizing the caching strategy. In this scheme, we use hash value to ensure the user’s query safe from each node in the process of search, so does the privacy of the requiring data content. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=NDN" title="NDN">NDN</a>, <a href="https://publications.waset.org/abstracts/search?q=order-preserving%20encryption" title=" order-preserving encryption"> order-preserving encryption</a>, <a href="https://publications.waset.org/abstracts/search?q=fuzzy%20search" title=" fuzzy search"> fuzzy search</a>, <a href="https://publications.waset.org/abstracts/search?q=privacy" title=" privacy"> privacy</a> </p> <a href="https://publications.waset.org/abstracts/28847/a-privacy-protection-scheme-supporting-fuzzy-search-for-ndn-routing-cache-data-name" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/28847.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">484</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">170</span> Intelligent Chatbot Generating Dynamic Responses Through Natural Language Processing</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Aarnav%20Singh">Aarnav Singh</a>, <a href="https://publications.waset.org/abstracts/search?q=Jatin%20Moolchandani"> Jatin Moolchandani</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The proposed research work aims to build a query-based AI chatbot that can answer any question related to any topic. A chatbot is software that converses with users via text messages. In the proposed system, we aim to build a chatbot that generates a response based on the user’s query. For this, we use natural language processing to analyze the query and some set of texts to form a concise answer. The texts are obtained through web-scrapping and filtering all the credible sources from a web search. The objective of this project is to provide a chatbot that is able to provide simple and accurate answers without the user having to read through a large number of articles and websites. Creating an AI chatbot that can answer a variety of user questions on a variety of topics is the goal of the proposed research project. This chatbot uses natural language processing to comprehend user inquiries and provides succinct responses by examining a collection of writings that were scraped from the internet. The texts are carefully selected from reliable websites that are found via internet searches. This project aims to provide users with a chatbot that provides clear and precise responses, removing the need to go through several articles and web pages in great detail. In addition to exploring the reasons for their broad acceptance and their usefulness across many industries, this article offers an overview of the interest in chatbots throughout the world. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=Chatbot" title="Chatbot">Chatbot</a>, <a href="https://publications.waset.org/abstracts/search?q=Artificial%20Intelligence" title=" Artificial Intelligence"> Artificial Intelligence</a>, <a href="https://publications.waset.org/abstracts/search?q=natural%20language%20processing" title=" natural language processing"> natural language processing</a>, <a href="https://publications.waset.org/abstracts/search?q=web%20scrapping" title=" web scrapping"> web scrapping</a> </p> <a href="https://publications.waset.org/abstracts/176712/intelligent-chatbot-generating-dynamic-responses-through-natural-language-processing" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/176712.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">66</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">169</span> Nearest Neighbor Investigate Using R+ Tree</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Rutuja%20Desai">Rutuja Desai</a> </p> <p class="card-text"><strong>Abstract:</strong></p> Search engine is fundamentally a framework used to search the data which is pertinent to the client via WWW. Looking close-by spot identified with the keywords is an imperative concept in developing web advances. For such kind of searching, extent pursuit or closest neighbor is utilized. In range search the forecast is made whether the objects meet to query object. Nearest neighbor is the forecast of the focuses close to the query set by the client. Here, the nearest neighbor methodology is utilized where Data recovery R+ tree is utilized rather than IR2 tree. The disadvantages of IR2 tree is: The false hit number can surpass the limit and the mark in Information Retrieval R-tree must have Voice over IP bit for each one of a kind word in W set is recouped by Data recovery R+ tree. The inquiry is fundamentally subordinate upon the key words and the geometric directions. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=information%20retrieval" title="information retrieval">information retrieval</a>, <a href="https://publications.waset.org/abstracts/search?q=nearest%20neighbor%20search" title=" nearest neighbor search"> nearest neighbor search</a>, <a href="https://publications.waset.org/abstracts/search?q=keyword%20search" title=" keyword search"> keyword search</a>, <a href="https://publications.waset.org/abstracts/search?q=R%2B%20tree" title=" R+ tree"> R+ tree</a> </p> <a href="https://publications.waset.org/abstracts/33680/nearest-neighbor-investigate-using-r-tree" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/33680.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">289</span> </span> </div> </div> <div class="card paper-listing mb-3 mt-3"> <h5 class="card-header" style="font-size:.9rem"><span class="badge badge-info">168</span> Evaluation of NoSQL in the Energy Marketplace with GraphQL Optimization</h5> <div class="card-body"> <p class="card-text"><strong>Authors:</strong> <a href="https://publications.waset.org/abstracts/search?q=Michael%20Howard">Michael Howard</a> </p> <p class="card-text"><strong>Abstract:</strong></p> The growing popularity of electric vehicles in the United States requires an ever-expanding infrastructure of commercial DC fast charging stations. The U.S. Department of Energy estimates 33,355 publicly available DC fast charging stations as of September 2023. In 2017, 115,370 gasoline stations were operating in the United States, much more ubiquitous than DC fast chargers. Range anxiety is an important impediment to the adoption of electric vehicles and is even more relevant in underserved regions in the country. The peer-to-peer energy marketplace helps fill the demand by allowing private home and small business owners to rent their 240 Volt, level-2 charging facilities. The existing, publicly accessible outlets are wrapped with a Cloud-connected microcontroller managing security and charging sessions. These microcontrollers act as Edge devices communicating with a Cloud message broker, while both buyer and seller users interact with the framework via a web-based user interface. The database storage used by the marketplace framework is a key component in both the cost of development and the performance that contributes to the user experience. A traditional storage solution is the SQL database. The architecture and query language have been in existence since the 1970s and are well understood and documented. The Structured Query Language supported by the query engine provides fine granularity with user query conditions. However, difficulty in scaling across multiple nodes and cost of its server-based compute have resulted in a trend in the last 20 years towards other NoSQL, serverless approaches. In this study, we evaluate the NoSQL vs. SQL solutions through a comparison of Google Cloud Firestore and Cloud SQL MySQL offerings. The comparison pits Google's serverless, document-model, non-relational, NoSQL against the server-base, table-model, relational, SQL service. The evaluation is based on query latency, flexibility/scalability, and cost criteria. Through benchmarking and analysis of the architecture, we determine whether Firestore can support the energy marketplace storage needs and if the introduction of a GraphQL middleware layer can overcome its deficiencies. <p class="card-text"><strong>Keywords:</strong> <a href="https://publications.waset.org/abstracts/search?q=non-relational" title="non-relational">non-relational</a>, <a href="https://publications.waset.org/abstracts/search?q=relational" title=" relational"> relational</a>, <a href="https://publications.waset.org/abstracts/search?q=MySQL" title=" MySQL"> MySQL</a>, <a href="https://publications.waset.org/abstracts/search?q=mitigate" title=" mitigate"> mitigate</a>, <a href="https://publications.waset.org/abstracts/search?q=Firestore" title=" Firestore"> Firestore</a>, <a href="https://publications.waset.org/abstracts/search?q=SQL" title=" SQL"> SQL</a>, <a href="https://publications.waset.org/abstracts/search?q=NoSQL" title=" NoSQL"> NoSQL</a>, <a href="https://publications.waset.org/abstracts/search?q=serverless" title=" serverless"> serverless</a>, <a href="https://publications.waset.org/abstracts/search?q=database" title=" database"> database</a>, <a href="https://publications.waset.org/abstracts/search?q=GraphQL" title=" GraphQL"> GraphQL</a> </p> <a href="https://publications.waset.org/abstracts/183740/evaluation-of-nosql-in-the-energy-marketplace-with-graphql-optimization" class="btn btn-primary btn-sm">Procedia</a> <a href="https://publications.waset.org/abstracts/183740.pdf" target="_blank" class="btn btn-primary btn-sm">PDF</a> <span class="bg-info text-light px-1 py-1 float-right rounded"> Downloads <span class="badge badge-light">62</span> </span> </div> </div> <ul class="pagination"> <li class="page-item disabled"><span class="page-link">&lsaquo;</span></li> <li class="page-item active"><span class="page-link">1</span></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=2">2</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=3">3</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=4">4</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=5">5</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=6">6</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=7">7</a></li> <li class="page-item"><a class="page-link" href="https://publications.waset.org/abstracts/search?q=query&page=2" rel="next">&rsaquo;</a></li> </ul> </div> </main> <footer> <div id="infolinks" class="pt-3 pb-2"> <div class="container"> <div style="background-color:#f5f5f5;" class="p-3"> <div class="row"> <div class="col-md-2"> <ul class="list-unstyled"> About <li><a href="https://waset.org/page/support">About Us</a></li> <li><a href="https://waset.org/page/support#legal-information">Legal</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/WASET-16th-foundational-anniversary.pdf">WASET celebrates its 16th foundational anniversary</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Account <li><a href="https://waset.org/profile">My Account</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Explore <li><a href="https://waset.org/disciplines">Disciplines</a></li> <li><a href="https://waset.org/conferences">Conferences</a></li> <li><a href="https://waset.org/conference-programs">Conference Program</a></li> <li><a href="https://waset.org/committees">Committees</a></li> <li><a href="https://publications.waset.org">Publications</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Research <li><a href="https://publications.waset.org/abstracts">Abstracts</a></li> <li><a href="https://publications.waset.org">Periodicals</a></li> <li><a href="https://publications.waset.org/archive">Archive</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Open Science <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Philosophy.pdf">Open Science Philosophy</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Science-Award.pdf">Open Science Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Open-Society-Open-Science-and-Open-Innovation.pdf">Open Innovation</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Postdoctoral-Fellowship-Award.pdf">Postdoctoral Fellowship Award</a></li> <li><a target="_blank" rel="nofollow" href="https://publications.waset.org/static/files/Scholarly-Research-Review.pdf">Scholarly Research Review</a></li> </ul> </div> <div class="col-md-2"> <ul class="list-unstyled"> Support <li><a href="https://waset.org/page/support">Support</a></li> <li><a href="https://waset.org/profile/messages/create">Contact Us</a></li> <li><a href="https://waset.org/profile/messages/create">Report Abuse</a></li> </ul> </div> </div> </div> </div> </div> <div class="container text-center"> <hr style="margin-top:0;margin-bottom:.3rem;"> <a href="https://creativecommons.org/licenses/by/4.0/" target="_blank" class="text-muted small">Creative Commons Attribution 4.0 International License</a> <div id="copy" class="mt-2">© 2024 World Academy of Science, Engineering and Technology</div> </div> </footer> <a href="javascript:" id="return-to-top"><i class="fas fa-arrow-up"></i></a> <div class="modal" id="modal-template"> <div class="modal-dialog"> <div class="modal-content"> <div class="row m-0 mt-1"> <div class="col-md-12"> <button type="button" class="close" data-dismiss="modal" aria-label="Close"><span aria-hidden="true">×</span></button> </div> </div> <div class="modal-body"></div> </div> </div> </div> <script src="https://cdn.waset.org/static/plugins/jquery-3.3.1.min.js"></script> <script src="https://cdn.waset.org/static/plugins/bootstrap-4.2.1/js/bootstrap.bundle.min.js"></script> <script src="https://cdn.waset.org/static/js/site.js?v=150220211556"></script> <script> jQuery(document).ready(function() { /*jQuery.get("https://publications.waset.org/xhr/user-menu", function (response) { jQuery('#mainNavMenu').append(response); });*/ jQuery.get({ url: "https://publications.waset.org/xhr/user-menu", cache: false }).then(function(response){ jQuery('#mainNavMenu').append(response); }); }); </script> </body> </html>