Rozprawy doktorskie na temat „Querying (Computer science)”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Querying (Computer science)”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Yang, Lei. "Querying Graph Structured Data". Case Western Reserve University School of Graduate Studies / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=case1410434109.
Pełny tekst źródłaChavda, Manoj. "Visually querying object-oriented databases". Master's thesis, University of Cape Town, 1997. http://hdl.handle.net/11427/17516.
Pełny tekst źródłaAs database requirements increase, the ability to construct database queries efficiently becomes more important. The traditional means of querying a database is to write a textual query, such as writing in SQL to query a relational database. Visual query languages are an alternative means of querying a database; a visual query language can embody powerful query abstraction and user feedback techniques, thereby making them potentially easier to use. In this thesis, we develop a visual query system for ODMG-compliant object-oriented databases, called QUIVER. QUIVER has a comprehensive expressive power; apart from supporting data types such as sets, bags, arrays, lists, tuples, objects and relationships, it supports aggregate functions, methods and sub-queries. The language is also consistent, as constructs with similar functionality have similar visual representations. QUIVER uses the DOT layout engine to automatically layout a query; QUIVER queries are easily constructed, as the system does not constrain the spatial arrangement of query items. QUIVER also supports a query library, allowing queries to be saved, retrieved and shared among users. A substantial part of the design has been implemented using the ODMG-compliant database system O₂, and the usability of the interface as well as the query language itself is presented. Visual queries are translated to OQL, the standard query language proposed by the ODMG, and query answers are presented using O₂ Look. During the course of our investigation, we conducted a user evaluation to compare QUIVER and OQL. The results were extremely encouraging in favour of QUIVER.
Wu, Chao-Hui. "Querying and synchronizing multimedia presentations /". The Ohio State University, 1998. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488186329501598.
Pełny tekst źródłaHossain, Md Delwar. "Querying communities of interest in peer database networks". Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/26926.
Pełny tekst źródłaChiu, Tsz Wai. "WinyDB : collaboratively querying sensor networks through handheld devices /". View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20CHIUT.
Pełny tekst źródłaColgrove, Matthew Edward. "Querying Geographically Dispersed, Heterogeneous Data Stores: The PPerfXchange Approach". PDXScholar, 2002. https://pdxscholar.library.pdx.edu/open_access_etds/2665.
Pełny tekst źródłaQiao, Shi. "QUERYING GRAPH STRUCTURED RDF DATA". Case Western Reserve University School of Graduate Studies / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=case1447198654.
Pełny tekst źródłaSun, Yi. "Querying with Ontological Terminologies And their Annotations". Miami University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=miami1177653662.
Pełny tekst źródłaLam, Wai-Yeung. "XCQ : a framework for XML compression and querying /". View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20LAM.
Pełny tekst źródłaIncludes bibliographical references (leaves 142-147). Also available in electronic version. Access restricted to campus users.
Li, Jing, i 李晶. "Advanced spatial queries with textual and social components". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49617837.
Pełny tekst źródłapublished_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
Jain, Prateek. "Linked Open Data Alignment & Querying". Wright State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=wright1345575500.
Pełny tekst źródłaSun, Christina M. Eng Massachusetts Institute of Technology. "A natural language interface for querying graph databases". Thesis, Massachusetts Institute of Technology, 2018. http://hdl.handle.net/1721.1/119708.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 67-69).
An increasing amount of knowledge in the world is stored in graph databases. However, most people have limited or no understanding of database schemes and query languages. Providing a tool that translates natural language queries into structured queries allows people without this technical knowledge or specific domain expertise to retrieve information that was previously inaccessible. Many existing natural language interfaces to databases (NLIDB) propose solutions that may not generalize well to multiple domains and may require excessive feature engineering, manual customization, or large amounts of annotated training data. We present a method for constructing subgraph queries which can represent a graph of activities, events, persons, behaviors, and relations, for search against a graph database containing information from a variety of data sources. Our model interprets complex natural language queries by using a pipeline of named entity recognition and binary relation extraction models to identify key entities and relations corresponding to graph components such as nodes, attributes, and edges. This information is combined in order to create structured graph queries, which may then be applied to graph databases. By breaking down the translation task into a pipeline of several submodules, our model achieves a prediction accuracy of 46.9 % with a small training set of only 218 sentences.
by Christina Sun.
M. Eng.
Baxter, Jay. "BayesDB : querying the probable implications of tabular data". Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/91451.
Pełny tekst źródła43
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 93-95).
BayesDB, a Bayesian database table, lets users query the probable implications of their tabular data as easily as an SQL database lets them query the data itself. Using the built-in Bayesian Query Language (BQL), users with little statistics knowledge can solve basic data science problems, such as detecting predictive relationships between variables, inferring missing values, simulating probable observations, and identifying statistically similar database entries. BayesDB is suitable for analyzing complex, heterogeneous data tables with no preprocessing or parameter adjustment required. This generality rests on the model independence provided by BQL, analogous to the physical data independence provided by the relational model. SQL enables data filtering and aggregation tasks to be described independently of the physical layout of data in memory and on disk. Non-experts rely on generic indexing strategies for good-enough performance, while experts customize schemes and indices for performance-sensitive applications. Analogously, BQL enables analysis tasks to be described independently of the models used to solve them. Non-statisticians can rely on a general-purpose modeling method called CrossCat to build models that are good enough for a broad class of applications, while experts can customize the schemes and models when needed. This thesis defines BQL, describes an implementation of BayesDB, quantitatively characterizes its scalability and performance, and illustrates its efficacy on real-world data analysis problems in the areas of healthcare economics, statistical survey data analysis, web analytics, and predictive policing.
by Jay Baxter.
M. Eng.
Wang, Song. "State-Slice: A New Stream Query Optimization Paradigm for Multi-query and Distributed Processing". Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-032508-044505/.
Pełny tekst źródłaDevadithya, Tharaka. "A graph based cache system for efficient querying in distributed triplestores". [Bloomington, Ind.] : Indiana University, 2008. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3324608.
Pełny tekst źródłaTitle from PDF t.p. (viewed on May 14, 2009). Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 4837. Adviser: Randall Bramley.
Zhang, Shijie. "Index-based Graph Querying and Matching in Large Graphs". Cleveland, Ohio : Case Western Reserve University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=case1263256028.
Pełny tekst źródłaTitle from PDF (viewed on 2010-04-12) Department of Electrical Engineering and Computer Science (EECS) Includes abstract Includes bibliographical references and appendices Available online via the OhioLINK ETD Center
Li, Ruirui, i 李锐瑞. "A probabilistic approach to diversified query recommendation". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49799757.
Pełny tekst źródłapublished_or_final_version
Computer Science
Master
Master of Philosophy
Dinakar, Rohit. "Ontology based Querying and Integration of Heterogeneous Flat Files". The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1285063965.
Pełny tekst źródłaMorgan, Fabian F. 1981. "Querying over heterogeneous XML schemas in a content management system". Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/87283.
Pełny tekst źródłaIncludes bibliographical references (leaves 51-52).
by Fabian F. Morgan.
M.Eng.
Sabesan, Manivasakan. "Querying Data Providing Web Services". Doctoral thesis, Uppsala universitet, Avdelningen för datalogi, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-128928.
Pełny tekst źródłaeSSENCE
Bandyopadhyay, Bortik. "Querying Structured Data via Informative Representations". The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1595447189545086.
Pełny tekst źródłaLi, Boyang. "Private data querying in the precomputation model". Miami University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=miami1312292383.
Pełny tekst źródłaLau, Ching Hin. "An I/O-efficient data structure for querying XML with inherited attributes /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20LAU.
Pełny tekst źródłaWang, Xin. "Querying the web of data with low latency : high performance distributed SPARQL processing and benchmarking". Thesis, University of Southampton, 2014. https://eprints.soton.ac.uk/368261/.
Pełny tekst źródłaThiagarajan, Arvind. "Representing and querying regression models in a relational database management system". Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42254.
Pełny tekst źródłaIncludes bibliographical references (p. 77-79).
Curve fitting is a widely employed, useful modeling tool in several financial, scientific, engineering and data mining applications, and in applications like sensor networks that need to tolerate missing or noisy data. These applications need to both fit functions to their data using regression, and pose relational-style queries over regression models. Unfortunately, existing DBMSs are ill suited for this task because they do not include support for creating, representing and querying functional data, short of brute-force discretization of functions into a collection of tuples. This thesis describes FunctionDB, a novel DBMS that extends the state of the art. FunctionDB treats functions output by regression as first-class citizens that can be queried declaratively and manipulated like traditional database relations. The key contributions of FunctionDB are a compact, algebraic representation for regression models as piecewise functions, and an algebraic query processor that executes declarative queries directly on this representation as combinations of algebraic operations like function inversion, zero finding and symbolic integration. FunctionDB is evaluated on two real world data sets: measurements from a temperature sensor network, and traffic traces from cars driving on Boston roads. The results show that operating in the functional domain has substantial accuracy advantages (over 15% for some queries) and order of magnitude (10x-100x) performance gains over existing approaches that represent models as discrete collections of points. The thesis also describes an algorithm to maintain regression models online, as new raw data is inserted into the system. The algorithm supports a sustained insertion rate of the order of a million records per second, while generating models no less compact than a clairvoyant (offline) strategy.
by Arvind Thiagarajan.
S.M.
Breed, Aditi. "Querying semantically heterogeneous data sources using ontologies". Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/1089.
Pełny tekst źródłaKwan, Kang-lun. "Adaptive stream filters for entity-based queries with non-value tolerance". Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B3884333X.
Pełny tekst źródłaKwan, Kang-lun, i 關庚麟. "Adaptive stream filters for entity-based queries with non-value tolerance". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B3884333X.
Pełny tekst źródłaZhang, Yinuo, i 张一诺. "Evaluating continuous probabilistic queries over constantly-evolving data". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45589835.
Pełny tekst źródłaChen, Lei. "Answering why-not questions on spatial keyword top-k queries /Chen Lei". HKBU Institutional Repository, 2016. https://repository.hkbu.edu.hk/etd_oa/365.
Pełny tekst źródłaHe, Bingsheng. "Cache-oblivious query processing /". View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20HE.
Pełny tekst źródłaCheng, James Sheung-Chak. "Efficient query processing on graph databases /". View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20CHENG.
Pełny tekst źródłaZhang, Shiming, i 张世明. "Scalable skyline evaluation in multidimensional and partially ordered domains". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B46973916.
Pełny tekst źródłaTew, Kevin. "Skuery : manipulation of S-expressions using Xquery techniques /". Diss., CLICK HERE for online access, 2006. http://contentdm.lib.byu.edu/ETD/image/etd1677.pdf.
Pełny tekst źródłaJin, Guang. "Towards Spatial Queries over Phenomena in Sensor Networks". Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/JinG2009.pdf.
Pełny tekst źródłaPapadopoulos, Stavros. "Authenticated query processing /". View abstract or full-text, 2010. http://library.ust.hk/cgi/db/thesis.pl?CSED%202010%20PAPADO.
Pełny tekst źródłaLin, Zhifeng, i 林志锋. "Advanced spatial queries in wireless ad hoc networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43224295.
Pełny tekst źródłaJin, Yifan, i 金一帆. "A filter-based protocol for continuous queries over imprecise locationdata". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49617953.
Pełny tekst źródłapublished_or_final_version
Computer Science
Master
Master of Philosophy
Lin, Zhifeng. "Advanced spatial queries in wireless ad hoc networks". Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43224295.
Pełny tekst źródłaLian, Xiang. "Efficient query processing over uncertain data /". View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20LIAN.
Pełny tekst źródłaMayes, Stephen Frederick. "ADVANCED INTERFACE FOR QUERYING GRAPH DATA". Case Western Reserve University School of Graduate Studies / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=case1196443381.
Pełny tekst źródłaWang, Ling. "Updating XML views". Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-082406-013940/.
Pełny tekst źródłaFan, Zhe. "Secure subgraph query services". HKBU Institutional Repository, 2015. https://repository.hkbu.edu.hk/etd_oa/229.
Pełny tekst źródłaJiang, Jiaxin. "Efficient frameworks for keyword search on massive graphs". HKBU Institutional Repository, 2020. https://repository.hkbu.edu.hk/etd_oa/806.
Pełny tekst źródłaAcar, Aybar C. "Query consolidation interpreting queries sent to independent heterogenous databases /". Fairfax, VA : George Mason University, 2008. http://hdl.handle.net/1920/3223.
Pełny tekst źródłaVita: p. 169. Thesis director: Amihai Motro. Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science. Title from PDF t.p. (viewed Aug. 27, 2008). Includes bibliographical references (p. 162-168). Also issued in print.
El-Sayed, Maged F. "Incremental maintenance of materialized Xquery views". Link to electronic dissertation, 2005. http://www.wpi.edu/Pubs/ETD/Available/etd-082305-120333/.
Pełny tekst źródłaDing, Luping. "Metadata-aware query processing over data streams". Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-042208-194826/.
Pełny tekst źródłaLi, Jin. "Window Queries Over Data Streams". PDXScholar, 2008. https://pdxscholar.library.pdx.edu/open_access_etds/2675.
Pełny tekst źródłaWang, Fan. "SEEDEEP: A System for Exploring and Querying Deep Web Data Sources". The Ohio State University, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=osu1279758181.
Pełny tekst źródłaElliott, Brendan David. "Hierarchical and Semantic Data Management and Querying for Patient Records and Personal Photos". Case Western Reserve University School of Graduate Studies / OhioLINK, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=case1226303040.
Pełny tekst źródła