To see the other types of publications on this topic, follow the link: Querying (Computer science).

Dissertations / Theses on the topic 'Querying (Computer science)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Querying (Computer science).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Chavda, Manoj. "Visually querying object-oriented databases." Master's thesis, University of Cape Town, 1997. http://hdl.handle.net/11427/17516.

Full text
Abstract:
Bibliography: pages 141-145.<br>As 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. QUIVE
APA, Harvard, Vancouver, ISO, and other styles
3

Wu, Chao-Hui. "Querying and synchronizing multimedia presentations /." The Ohio State University, 1998. http://rave.ohiolink.edu/etdc/view?acc_num=osu1488186329501598.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hossain, Md Delwar. "Querying communities of interest in peer database networks." Thesis, University of Ottawa (Canada), 2005. http://hdl.handle.net/10393/26926.

Full text
Abstract:
Peer-to-Peer (P2P) networks are used primarily for file sharing. P2P user communities are continuing to grow rapidly, but there is no specific query mechanism for communities of interest in peer database networks. Peer databases are linked to each other through acquaintances. These are individual, independently developed databases that contain local data. Many researchers have tackled the problem of query processing in P2P networks. Moreover, researchers have started to investigate community-based querying in peer database networks. The focus of this thesis is to study a query translation mech
APA, Harvard, Vancouver, ISO, and other styles
5

Chiu, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Colgrove, Matthew Edward. "Querying Geographically Dispersed, Heterogeneous Data Stores: The PPerfXchange Approach." PDXScholar, 2002. https://pdxscholar.library.pdx.edu/open_access_etds/2665.

Full text
Abstract:
This thesis details PPerfXchange’s approach for querying geographically dispersed heterogeneous data stores. While elements of PPerfXchange’s method have been implemented for other application areas, PPerfXchange shows how these elements can be applied to parallel performance analysis. The accomplishments of this thesis are: The design of an architecture for PPerfXchange, giving a uniform method to query heterogeneous data stores; A proof of concept prototype implementation of PPerfXchange including a partial implementation of an XQuery processor and a relational database virtual XML documen
APA, Harvard, Vancouver, ISO, and other styles
7

Qiao, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sun, Yi. "Querying with Ontological Terminologies And their Annotations." Miami University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=miami1177653662.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lam, 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.

Full text
Abstract:
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2003.<br>Includes bibliographical references (leaves 142-147). Also available in electronic version. Access restricted to campus users.
APA, Harvard, Vancouver, ISO, and other styles
10

Li, Jing, and 李晶. "Advanced spatial queries with textual and social components." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49617837.

Full text
Abstract:
The emerging new services for GPS and mobile users have developed applications that access and exploit spatial objects with new components (e.g. text and social network). Web objects, including blogs, tweets, photos and videos, are embedded into a map by the APIs of map service providers, where textual messages are associated with geographic information. Location-based social networking services, arising from Facebook and Foursquare, allow users to browse and share their traces of locations among the social networks. Among this class of applications, the highlight is that the retrieved spatia
APA, Harvard, Vancouver, ISO, and other styles
11

Jain, Prateek. "Linked Open Data Alignment & Querying." Wright State University / OhioLINK, 2012. http://rave.ohiolink.edu/etdc/view?acc_num=wright1345575500.

Full text
APA, Harvard, Vancouver, ISO, and other styles
12

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/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
13

Sun, 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.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 67-69).<br>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
APA, Harvard, Vancouver, ISO, and other styles
14

Baxter, Jay. "BayesDB : querying the probable implications of tabular data." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/91451.

Full text
Abstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.<br>43<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 93-95).<br>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 valu
APA, Harvard, Vancouver, ISO, and other styles
15

Devadithya, 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.

Full text
Abstract:
Thesis (Ph.D.)--Indiana University, Dept. of Computer Science, 2008.<br>Title from PDF t.p. (viewed on May 14, 2009). Source: Dissertation Abstracts International, Volume: 69-08, Section: B, page: 4837. Adviser: Randall Bramley.
APA, Harvard, Vancouver, ISO, and other styles
16

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.

Full text
Abstract:
Thesis(Ph.D.)--Case Western Reserve University, 2010<br>Title 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
APA, Harvard, Vancouver, ISO, and other styles
17

Li, Ruirui, and 李锐瑞. "A probabilistic approach to diversified query recommendation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2012. http://hub.hku.hk/bib/B49799757.

Full text
Abstract:
The effectiveness of keyword-based search engines depends largely on the ability of a user to formulate proper queries that are both expressive and selective. However, web search queries issued by casual users are often short and with limited expressiveness. Query recommendation is a popular technique employed by search engines to help users refine their queries. Traditional similarity-based methods, however, often result in redundant and monotonic recommendations. We identify five basic requirements of a query recommendation system, namely relevancy, redundancy-free, diversity, ranking and e
APA, Harvard, Vancouver, ISO, and other styles
18

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
19

Morgan, 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.

Full text
Abstract:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.<br>Includes bibliographical references (leaves 51-52).<br>by Fabian F. Morgan.<br>M.Eng.
APA, Harvard, Vancouver, ISO, and other styles
20

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.

Full text
Abstract:
Web services are often used for search computing where data is retrieved from servers providing information of different kinds. Such data providing web services return a set of objects for a given set of parameters without any side effects. There is need to enable general and scalable search capabilities of data from data providing web services, which is the topic of this Thesis. The Web Service MEDiator (WSMED) system automatically provides relational views of any data providing web service operations by reading the WSDL documents describing them. These views can be queried with SQL. Without
APA, Harvard, Vancouver, ISO, and other styles
21

Bandyopadhyay, Bortik. "Querying Structured Data via Informative Representations." The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1595447189545086.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Li, Boyang. "Private data querying in the precomputation model." Miami University / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=miami1312292383.

Full text
APA, Harvard, Vancouver, ISO, and other styles
23

Lau, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

Wang, 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/.

Full text
Abstract:
The Web of Data extends the World Wide Web (WWW) in a way that applications can understand information and cooperate with humans on complex tasks. The basis of performing complex tasks is low latency queries over the Web of Data. The large scale and distributed nature of the Web of Data have negative impacts on several critical factors for efficient query processing, including fast data transmission between datasets, predictable data distribution and statistics that summarise and describe certain patterns in the data. Moreover, it is common on the Web of Data that the same resource is identifi
APA, Harvard, Vancouver, ISO, and other styles
25

Thiagarajan, 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.

Full text
Abstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.<br>Includes bibliographical references (p. 77-79).<br>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 no
APA, Harvard, Vancouver, ISO, and other styles
26

Breed, Aditi. "Querying semantically heterogeneous data sources using ontologies." Thesis, Manhattan, Kan. : Kansas State University, 2008. http://hdl.handle.net/2097/1089.

Full text
APA, Harvard, Vancouver, ISO, and other styles
27

Kwan, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Kwan, Kang-lun, and 關庚麟. "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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Zhang, Yinuo, and 张一诺. "Evaluating continuous probabilistic queries over constantly-evolving data." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45589835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
30

Chen, 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.

Full text
Abstract:
With the continued proliferation of location-based services, a growing number of web-accessible data objects are geo-tagged and have text descriptions. Spatial keyword top-k queries retrieve k such objects with the best score according to a ranking function that takes into account a query location and query keywords. However, it is in some cases difficult for users to specify appropriate query parameters. After a user issues an initial query and gets back the result, the user may find that some expected objects are missing and may wonder why. Answering the resulting why-not questions can aid u
APA, Harvard, Vancouver, ISO, and other styles
31

He, Bingsheng. "Cache-oblivious query processing /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20HE.

Full text
APA, Harvard, Vancouver, ISO, and other styles
32

Cheng, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
33

Zhang, Shiming, and 张世明. "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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
34

Tew, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
35

Jin, Guang. "Towards Spatial Queries over Phenomena in Sensor Networks." Fogler Library, University of Maine, 2009. http://www.library.umaine.edu/theses/pdf/JinG2009.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
36

Papadopoulos, Stavros. "Authenticated query processing /." View abstract or full-text, 2010. http://library.ust.hk/cgi/db/thesis.pl?CSED%202010%20PAPADO.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Lin, Zhifeng, and 林志锋. "Advanced spatial queries in wireless ad hoc networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43224295.

Full text
APA, Harvard, Vancouver, ISO, and other styles
38

Jin, Yifan, and 金一帆. "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.

Full text
Abstract:
In typical location-based services (LBS), moving objects (e.g., GPS-enabled mobile phones) report their locations through a wireless network. An LBS server can use the location information to answer various types of continuous queries, e.g., \Give me the ID of a battalion which is the closest to a military base within the next hour." Due to hardware limitations, location data reported by the moving objects are often uncertain. In this paper, we study efficient methods for the execution of Continuous Possible Nearest Neighbor Query (CPoNNQ) that accesses imprecise location data. A CPoNNQ is a
APA, Harvard, Vancouver, ISO, and other styles
39

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Lian, Xiang. "Efficient query processing over uncertain data /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20LIAN.

Full text
APA, Harvard, Vancouver, ISO, and other styles
41

Mayes, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
42

Wang, Ling. "Updating XML views." Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-082406-013940/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
43

Fan, Zhe. "Secure subgraph query services." HKBU Institutional Repository, 2015. https://repository.hkbu.edu.hk/etd_oa/229.

Full text
Abstract:
Graphs are powerful tools for a wide range of real applications, from Biological and Chemical Databases, Social Networks, Citation Networks to Knowledge Bases. Large graph data repositories have been consistently found in recent applications. Due to the high complexity of graph queries, e.g., NP-Completeness of subgraph query, and the lack of IT expertise, hosting efficient graph query services for the owners of graph data has been a technically challenging task. And hence, they may prefer to outsource their services to third-party service providers (SPs) for scalability, elasticity and effici
APA, Harvard, Vancouver, ISO, and other styles
44

Jiang, Jiaxin. "Efficient frameworks for keyword search on massive graphs." HKBU Institutional Repository, 2020. https://repository.hkbu.edu.hk/etd_oa/806.

Full text
Abstract:
Due to the unstructuredness and the lack of schema information of knowledge graphs, social networks and RDF graphs, keyword search has been proposed for querying such graphs/networks. Recently, various keyword search semantics have been designed. However, these keyword search semantics and algorithms encounter efficiency or scalability issues. In this thesis, we propose new three generic frameworks or index techniques to address these issues. The thesis results show that the keyword search on massive graphs under different scenarios can be effective and efficient, which would facilitate keywor
APA, Harvard, Vancouver, ISO, and other styles
45

Acar, Aybar C. "Query consolidation interpreting queries sent to independent heterogenous databases /." Fairfax, VA : George Mason University, 2008. http://hdl.handle.net/1920/3223.

Full text
Abstract:
Thesis (Ph.D.)--George Mason University, 2008.<br>Vita: 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.
APA, Harvard, Vancouver, ISO, and other styles
46

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/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
47

Ding, Luping. "Metadata-aware query processing over data streams." Worcester, Mass. : Worcester Polytechnic Institute, 2008. http://www.wpi.edu/Pubs/ETD/Available/etd-042208-194826/.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Li, Jin. "Window Queries Over Data Streams." PDXScholar, 2008. https://pdxscholar.library.pdx.edu/open_access_etds/2675.

Full text
Abstract:
Evaluating queries over data streams has become an appealing way to support various stream-processing applications. Window queries are commonly used in many stream applications. In a window query, certain query operators, especially blocking operators and stateful operators, appear in their windowed versions. Previous research work in evaluating window queries typically requires ordered streams and this order requirement limits the implementations of window operators and also carries performance penalties. This thesis presents efficient and flexible algorithms for evaluating window queries. We
APA, Harvard, Vancouver, ISO, and other styles
49

Wang, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
50

Dong, Xin. "Providing best-effort services in dataspace systems /." Thesis, Connect to this title online; UW restricted, 2007. http://hdl.handle.net/1773/6902.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!