Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(autocompletion). Showing records 1 – 3 of 3 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of New South Wales

1. Qin, Jianbin. Efficient String Similarity Search with an Edit Distance Threshold.

Degree: Computer Science & Engineering, 2013, University of New South Wales

In this thesis, we study efficient exact query processing algorithms for edit similarity queries and their variants. An edit similarity query finds database strings within edit distance threshold t from the query string. It plays an important role in many application areas, such as deduplication, data integration and cleansing, query suggestion, bioinformatics, and pattern recognition. Consequently, there has been much interest in developing efficient algorithms for this problem.We study three specific problems in this thesis. The first problem is efficient algorithms for similarity joins with an edit distance constraint. Currently, the most prevalent approach is based on extracting overlapping grams from strings and considering only strings that share a certain number of grams as candidates. Unlike these existing approaches, we propose a novel approach to edit similarity join based on extracting non-overlapping substrings, or chunks, from strings. We propose a class of chunking schemes based on the notion of tail-restricted chunk boundary dictionary. A new algorithm, VChunkJoin, is designed by integrating existing filtering methods and several new filters unique to our chunk-based method. We also design a greedy algorithm to automatically select a good chunking scheme for a given dataset. We demonstrate experimentally that the new algorithm is faster than alternative methods yet occupies less space.The second problem we study is efficient algorithms for similarity search with an edit distance constraint. We define a general signature-based framework and show that the minimum signature size is t + 1. In order to achieve this bound, we propose asymmetric signature schemes, i.e., extracting different number of signatures for the data and query strings. We first propose a basic asymmetric scheme based on matching q-chunks and q-grams between two strings. Two efficient query processing algorithms (IndexGram and IndexChunk) are developed on top of this scheme. We also propose novel candidate pruning methods to further improve the efficiency. We then generalize the basic scheme by incorporating novel ideas of floating qchunks, optimal selection of q-chunks, and reducing the number of signatures using global ordering. As a result, we develop the Super and Turbo families of schemes together with their corresponding query processing algorithms. We have conducted a comprehensive experimental study using the six asymmetric algorithms and nine previous state-of-the-art algorithms. The experiment results clearly showcase the efficiency of our methods and demonstrate space and time characteristics of our proposed algorithms.The last problem we study is the problem of query autocompletion that tolerates errors in user’s inputs modeled by an edit distance constraint. Previous approaches index data strings in a trie, and continuously maintain all the prefixes of data strings whose edit distance with the query are within the threshold. The major inherent problem is that the number of such prefixes is huge for the first few characters… Advisors/Committee Members: Wang, Wei, Computer Science & Engineering, Faculty of Engineering, UNSW.

Subjects/Keywords: edit distance; similarity joins; similarity search; autocompletion; type-ahead; inverted index

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Qin, J. (2013). Efficient String Similarity Search with an Edit Distance Threshold. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/52648 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11321/SOURCE01?view=true

Chicago Manual of Style (16th Edition):

Qin, Jianbin. “Efficient String Similarity Search with an Edit Distance Threshold.” 2013. Doctoral Dissertation, University of New South Wales. Accessed July 21, 2019. http://handle.unsw.edu.au/1959.4/52648 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11321/SOURCE01?view=true.

MLA Handbook (7th Edition):

Qin, Jianbin. “Efficient String Similarity Search with an Edit Distance Threshold.” 2013. Web. 21 Jul 2019.

Vancouver:

Qin J. Efficient String Similarity Search with an Edit Distance Threshold. [Internet] [Doctoral dissertation]. University of New South Wales; 2013. [cited 2019 Jul 21]. Available from: http://handle.unsw.edu.au/1959.4/52648 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11321/SOURCE01?view=true.

Council of Science Editors:

Qin J. Efficient String Similarity Search with an Edit Distance Threshold. [Doctoral Dissertation]. University of New South Wales; 2013. Available from: http://handle.unsw.edu.au/1959.4/52648 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:11321/SOURCE01?view=true


University of Waterloo

2. Lee, Hon Man. Model-guided Code Assistance for Framework Application Development.

Degree: 2009, University of Waterloo

Object-oriented frameworks are currently widely used in software application development. Unfortunately, they are known to be generally difficult to use because of the difficulty in understanding the concepts and constraints in different frameworks. With the formalization of framework concepts and constraints in domain-specific modeling languages called framework-specific modeling languages (FSMLs), previous works have shown that round-trip engineering between models of applications using frameworks and the application code is possible to aid framework application development. Framework-specific modeling languages only capture, however, framework concepts and constraints and hence, lack the expressiveness of general-purpose modeling languages. For this reason, the complete code for an entire framework application cannot be generated from the model in the model editor using round-trip engineering, and the user would need to switch to the code editor to program the application logic code. Also, since models are only abstractions of code, implementation details in code may be missing in models. Although default implementation details can be used when generating code from a model, the generated code might require further customization by the user, which would also require switching to the code editor. To reduce the need for the user to switch between the model editor and the code editor and to reduce the need to customize the generated code, this thesis presents a model-guided approach to providing code assistance for framework application development directly in the code editor, where additional implementation details can also be obtained. An approach to building a context-sensitive code assistant that aids the user in the implementation of framework concepts with the consideration of framework constraints is described. A prototype has further been implemented and applied on two widely popular frameworks. The evaluation in this thesis analyzes and characterizes framework concepts and shows that the framework-based code assistant can reduce the need to customize the generated code in the code editor when compared to code generation from the model editor.

Subjects/Keywords: forward engineering; round-trip engineering; code generation; framework instantiation; autocompletion; code assistants; Framework-Specific Modeling Languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lee, H. M. (2009). Model-guided Code Assistance for Framework Application Development. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4356

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lee, Hon Man. “Model-guided Code Assistance for Framework Application Development.” 2009. Thesis, University of Waterloo. Accessed July 21, 2019. http://hdl.handle.net/10012/4356.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lee, Hon Man. “Model-guided Code Assistance for Framework Application Development.” 2009. Web. 21 Jul 2019.

Vancouver:

Lee HM. Model-guided Code Assistance for Framework Application Development. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10012/4356.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lee HM. Model-guided Code Assistance for Framework Application Development. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4356

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

3. Rafes, Karima. Le Linked Data à l'université : la plateforme LinkedWiki : Linked Data at university : the LinkedWiki platform.

Degree: Docteur es, Réseaux, information et communications, 2019, Paris Saclay

Le Center for Data Science de l’Université Paris-Saclay a déployé une plateforme compatible avec le Linked Data en 2016. Or, les chercheurs rencontrent face à ces technologies de nombreuses difficultés. Pour surmonter celles-ci, une approche et une plateforme appelée LinkedWiki, ont été conçues et expérimentées au-dessus du cloud de l’université (IAAS) pour permettre la création d’environnements virtuels de recherche (VRE) modulaires et compatibles avec le Linked Data. Nous avons ainsi pu proposer aux chercheurs une solution pour découvrir, produire et réutiliser les données de la recherche disponibles au sein du Linked Open Data, c’est-à-dire du système global d’information en train d’émerger à l’échelle du Web. Cette expérience nous a permis de montrer que l’utilisation opérationnelle du Linked Data au sein d’une université est parfaitement envisageable avec cette approche. Cependant, certains problèmes persistent, comme (i) le respect des protocoles du Linked Data et (ii) le manque d’outils adaptés pour interroger le Linked Open Data avec SPARQL. Nous proposons des solutions à ces deux problèmes. Afin de pouvoir vérifier le respect d’un protocole SPARQL au sein du Linked Data d’une université, nous avons créé l’indicateur SPARQL Score qui évalue la conformité des services SPARQL avant leur déploiement dans le système d’information de l’université. De plus, pour aider les chercheurs à interroger le LOD, nous avons implémenté le démonstrateur SPARQLets-Finder qui démontre qu’il est possible de faciliter la conception de requêtes SPARQL à l’aide d’outils d’autocomplétion sans connaissance préalable des schémas RDF au sein du LOD.

The Center for Data Science of the University of Paris-Saclay deployed a platform compatible with Linked Data in 2016. Because researchers face many difficulties utilizing these technologies, an approach and then a platform we call LinkedWiki were designed and tested over the university’s cloud (IAAS) to enable the creation of modular virtual search environments (VREs) compatible with Linked Data. We are thus able to offer researchers a means to discover, produce and reuse the research data available within the Linked Open Data, i.e., the global information system emerging at the scale of the internet. This experience enabled us to demonstrate that the operational use of Linked Data within a university is perfectly possible with this approach. However, some problems persist, such as (i) the respect of protocols and (ii) the lack of adapted tools to interrogate the Linked Open Data with SPARQL. We propose solutions to both these problems. In order to be able to verify the respect of a SPARQL protocol within the Linked Data of a university, we have created the SPARQL Score indicator which evaluates the compliance of the SPARQL services before their deployments in a university’s information system. In addition, to help researchers interrogate the LOD, we implemented a SPARQLets-Finder, a demonstrator which shows that it is possible to facilitate the design of SPARQL queries using…

Advisors/Committee Members: Cohen-Boulakia, Sarah (thesis director), Abiteboul, Serge (thesis director).

Subjects/Keywords: Linked Data; LOD - Linked Open Data; SPARQL; VRE - Environnement Virtuel de Recherche; Cloud; Autocomplétion; Apprentissage non supervisé; Linked Data; LOD - Linked Open Data; SPARQL; VRE - Virtual Research Environment; Cloud; Autocompletion; Unsupervised learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rafes, K. (2019). Le Linked Data à l'université : la plateforme LinkedWiki : Linked Data at university : the LinkedWiki platform. (Doctoral Dissertation). Paris Saclay. Retrieved from http://www.theses.fr/2019SACLS032

Chicago Manual of Style (16th Edition):

Rafes, Karima. “Le Linked Data à l'université : la plateforme LinkedWiki : Linked Data at university : the LinkedWiki platform.” 2019. Doctoral Dissertation, Paris Saclay. Accessed July 21, 2019. http://www.theses.fr/2019SACLS032.

MLA Handbook (7th Edition):

Rafes, Karima. “Le Linked Data à l'université : la plateforme LinkedWiki : Linked Data at university : the LinkedWiki platform.” 2019. Web. 21 Jul 2019.

Vancouver:

Rafes K. Le Linked Data à l'université : la plateforme LinkedWiki : Linked Data at university : the LinkedWiki platform. [Internet] [Doctoral dissertation]. Paris Saclay; 2019. [cited 2019 Jul 21]. Available from: http://www.theses.fr/2019SACLS032.

Council of Science Editors:

Rafes K. Le Linked Data à l'université : la plateforme LinkedWiki : Linked Data at university : the LinkedWiki platform. [Doctoral Dissertation]. Paris Saclay; 2019. Available from: http://www.theses.fr/2019SACLS032

.