Dissertations / Theses: 'Query languages (Computer science)'

1

Robinson, Aaron R. "Integrating a universal query mechanism into Java /." Online version of thesis, 2007. http://hdl.handle.net/1850/4816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Crous, Theodorus. "Semantos : a semantically smart information query language." Pretoria : [s.n.], 2008. http://upetd.up.ac.za/thesis/available/etd-11292009-190944/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wisnesky, Ryan. "Functional Query Languages with Categorical Types." Thesis, Harvard University, 2013. http://dissertations.umi.com/gsas.harvard:11288.

Full text

Abstract:

We study three category-theoretic types in the context of functional query languages (typed lambda-calculi extended with additional operations for bulk data processing). The types we study are:
Engineering and Applied Sciences

APA, Harvard, Vancouver, ISO, and other styles

4

Jiang, Haifeng. "Efficient structural query processing in XML databases /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20JIANG.

Full text

Abstract:

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 115-125). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

5

Faisal, Farhan. "Query-by-Pointing: Algorithms and Pointing Error Compensation." Fogler Library, University of Maine, 2003. http://www.library.umaine.edu/theses/pdf/FaisalF2003.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Mouratidis, Kyriakos. "Continuous monitoring of multi-dimensional queries /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20MOURAT.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Li, Xiang, and 李想. "Managing query quality in probabilistic databases." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47753134.

Full text

Abstract:

In many emerging applications, such as sensor networks, location-based services, and data integration, the database is inherently uncertain. To handle a large amount of uncertain data, probabilistic databases have been recently proposed, where probabilistic queries are enabled to provide answers with statistical guarantees. In this thesis, we study the important issues of managing the quality of a probabilistic database. We first address the problem of measuring the ambiguity, or quality, of a probabilistic query. This is accomplished by computing the PWS-quality score, a recently proposed measure for quantifying the ambiguity of query answers under the possible world semantics. We study the computation of the PWS-quality for the top-k query. This problem is not trivial, since directly computing the top-k query score is computationally expensive. To tackle this challenge, we propose efficient approximate algorithms for deriving the quality score of a top-k query. We have performed experiments on both synthetic and real data to validate their performance and accuracy. Our second contribution is to study how to use the PWS-quality score to coordinate the process of cleaning uncertain data. Removing ambiguous data from a probabilistic database can often give us a higher-quality query result. However, this operation requires some external knowledge (e.g., an updated value from a sensor source), and is thus not without cost. It is important to choose the correct object to clean, in order to (1) achieve a high quality gain, and (2) incur a low cleaning cost. In this thesis, we examine different cleaning methods for a probabilistic top-k query. We also study an interesting problem where different query users have their own budgets available for cleaning. We demonstrate how an optimal solution, in terms of the lowest cleaning costs, can be achieved, for probabilistic range and maximum queries. An extensive evaluation reveals that these solutions are highly efficient and accurate.
published_or_final_version
Computer Science
Master
Master of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

8

Evangelista, Mark A. "Implementation of data flow query language on a handheld device." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2005. http://library.nps.navy.mil/uhtbin/hyperion/05Mar%5FEvangelista.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Elsidani, Elariss Haifa. "A new visual query language and query optimization for mobile GPS." Thesis, Kingston University, 2008. http://eprints.kingston.ac.uk/20306/.

Full text

Abstract:

In recent years computer applications have been deployed to manage spatial data with Geographic Information Systems (GIS) to store and analyze data related to domains such as transportation and tourism. Recent developments have shown that there is an urgent need to develop systmes for mobile devices and particularly for Location Based Services (LBS) such as proximity analysis that helps in finding the nearest neighbors, for example. restaurant, and the facilities that are located within a circle area around the user's location, known as a buffer area, for example, all restaurants within 100 meters. The mobile market potential is across geographical and cultural boundaries. Hence the visualization of queries becomes important especially that the existing visual query languages have a number of limitations. They are not tailored for mobile GIS and they do not support dynamic complex queries (DCQ) and visual query formation. Thus, the first aim of this research is to develop a new visual query language (IVQL) for mobile GIS that handles static and DCQ for proximity analysis. IVQL is designed and implemented using smiley icons that visualize operators, values, and objects. The evaluation results reveal that it has an expressive power, easy-to-use user interface, easy query building, and a high user satisfaction. There is also a need that new optimization strategies consider the scale of mobile user queries. Existing query optimization strategies are based on the sharing and push-down paradigms and they do not cover multiple-DCQ (MDCQ) for proximity analysis. This leads to the second aim of this thesis which is to develop the query melting processor (QMP) that is responsible for processing MDCQs. QMP is based on the new Query Melting paradigm which consists of the sharing paradigm, query optimization, and is implemented by a new strategy "Melting Ruler". Moreover, with the increase in volume of cost sensitive mobile users, the need emerges to develop a time cost optimizer for processing MDCQs. Thus, the thirs aim of the thesis is to develop a new Decision Making Mechanism for time cost optimization (TCOP) and prove its cost effectiveness. TCOP is based on the new paradigm "Sharing global execution plans by MDCQs with similar scenarios". The experimental evaluation results, using a case study based on the map of Paris, proved that significant saving in time can be achieved by employing the newly developed strategies.

APA, Harvard, Vancouver, ISO, and other styles

10

Dai, Xiangyuan. "Spatial queries based on non-spatial constraints." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B38436395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Dai, Xiangyuan, and 戴祥元. "Spatial queries based on non-spatial constraints." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B38436395.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Huang, Lizhong. "Express query language and templates and rules two languages for advanced software system integrations." Ohio : Ohio University, 1999. http://www.ohiolink.edu/etd/view.cgi?ohiou1181162850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Maksimovic, Gordana. "Query Languages for Semi-structured Data." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-4332.

Full text

Abstract:

Semi-structured data is defined as irregular data with structure that may change rapidly or unpredictably. An example of such data can be found inside the World-Wide Web. Since the data is irregular, the user may not know the complete structure of the database. Thus, querying such data becomes a difficult issue. In order to write meaningful queries on semi-structured data, there is a need for a query language that will support the features that are presented by this data. Standard query languages, such as SQL for relational databases and OQL for object databases, are too constraining for querying semi-structured data, because they require data to conform to a fixed schema before any data is stored into the database. This paper introduces Lorel, a query language developed particularly for querying semi-structured data. Furthermore, it investigates if the standardised query languages support any of the criteria presented for semi-structured data. The result is an evaluation of three query languages, SQL, OQL and Lorel against these criteria.

APA, Harvard, Vancouver, ISO, and other styles

14

Pielech, Bradford Charles. "Adaptive scheduling algorithm selection in a streaming query system." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0113104-194126.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

16

Raghavan, Venkatesh. "VAMANA -- A high performance, scalable and cost driven XPath engine." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0505104-185545/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Xu, Lin. "Approximate XPath." Online access for everyone, 2004. http://www.dissertations.wsu.edu/Thesis/Spring2004/L%5FXu%5F033104.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Jian, Jinhuj. "Efficient XML stream processing with automata and query algebra." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0827103-152442.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Chen, Li. "Semantic caching for XML queries." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0129104-174457.

Full text

Abstract:

Thesis (Ph. D.)--Worcester Polytechnic Institute.
Keywords: Replacement strategy; Query rewriting; Query containment; Semantic caching; Query; XML. Includes bibliographical references (p. 210-222).

APA, Harvard, Vancouver, ISO, and other styles

20

Zhang, Wangda, and 张望达. "Evaluating multi-way joins over discounted hitting time." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/196484.

Full text

Abstract:

The prevalence of graphs in emerging applications has recently raised a lot of research interests. To acquire interesting information hidden in large graphs, tasks including link prediction, collaborative recommendation, and reputation ranking, all make use of proximities between graph nodes. The discounted hitting time (DHT), which is a random-walk similarity measure for graph node pairs, has shown to be useful in various applications. In this thesis, we examine a novel query, called the multi-way join (or n-way join), over DHT scores. Given a graph and n sets of nodes, the n-way join retrieves a ranked list of n-tuples with the k highest scores, according to some aggregation function of DHT values. By extracting such top-k results, this query enables the analysis and prediction of various complex relationships among n sets of nodes on a large graph. Since an n-way join is expensive to evaluate, we develop the Partial Join algorithm (or PJ). This solution decomposes an n-way join into a number of top-m 2-way joins, and combines their results to construct the answer of the n-way join. Since the process of PJ may necessitate the computation of top-(m + 1) 2-way joins, we study an incremental solution, which saves the trouble of recomputation and allows the results of top-(m+1) 2-way join to be derived quickly from the top-m 2-way join results earlier computed. For better performance, we further examine efficient processing algorithms and pruning techniques for 2-way joins. Through extensive experiments on three real graph datasets, we show that the proposed PJ algorithm accurately evaluates n-way joins, and is four orders of magnitude faster than basic solutions.
published_or_final_version
Computer Science
Master
Master of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

21

Liu, Kaiyang. "Efficient structural join processing algorithms /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LIU.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

Tang, Henry 1974. "Toward a query language for organizational processes." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/46233.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (leaves 99-100).
by Henry Tang.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

24

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.
Includes bibliographical references (leaves 142-147). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

25

Yang, Yin. "Join processing in non-conventional databases /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20YANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Wang, Zhen. "Static type analysis of XQuery expressions using rewriting calculus." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B38882966.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Wang, Zhen, and 王珍. "Static type analysis of XQuery expressions using rewriting calculus." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B38882966.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Hu, Haibo. "Spatial and continuous spatial queries on smart mobile clients /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20HU.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Liu, Bin. "Multi-dimensional queries in distributed systems /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20LIUB.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Athreya, Prahlad S. "The CAD query language towards design-concurrent cost estimation /." Ohio : Ohio University, 2002. http://www.ohiolink.edu/etd/view.cgi?ohiou1177523234.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Pielech, Bradford Charles. "Adaptive Scheduling Algorithm Selection in a Streaming Query System." Digital WPI, 2004. https://digitalcommons.wpi.edu/etd-theses/79.

Full text

Abstract:

Many modern applications process queries over unbounded streams of data. These applications include tracking financial data from international markets, intrusion detection in networks, monitoring remote sensors, and monitoring patients vital signs. These data streams arrive in real time, are unbounded in length and have unpredictable arrival patterns due to external uncontrollable factors such as network congestion or weather in the case of remote sensors. This thesis presents a novel technique for adapting the execution of stream queries that, to my knowledge, is not present in any other continuous query system to date. This thesis hypothesizes that utilizing a single scheduling algorithm to execute a continuous query, as is employed in other state-of-the-art continuous query systems, is not sufficient because existing scheduling algorithms all have inherent flaws or tradeoffs. Thus, one scheduling algorithm cannot optimally meet an arbitrary set of Quality of Service (QoS) requirements. Therefore, to meet unique features of specific monitoring applications, an adaptive strategy selector guidable by QoS requirements was developed. The adaptive strategy selector monitors the effects of its behavior on its environment through a feedback mechanism, with the aim of exploiting previously beneficial behavior and exploring alternative behavior. The feedback mechanism is guided by qualitatively comparing how well each algorithm has met the QoS requirements. Then the next scheduling algorithm is chosen by spinning a roulette wheel where each candidate is chosen with a probability equal to its performance score. The adaptive algorithm is general, being able to employ any candidate scheduling algorithm and to react to any combination of quality of service preferences. As part of this thesis, the Raindrop system was developed as exploratory test bed in which to conduct an experimental study. In that experimental study, the adaptive algorithm was shown to be effective in outperforming single scheduling algorithms for many QoS combinations and data arrival patterns.

APA, Harvard, Vancouver, ISO, and other styles

32

Pei, Zhisong. "ONTOSELF+TQ: A TOPOLOGY QUERY SYSTEM FOR ONTOSELF." Oxford, Ohio : Miami University, 2009. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=miami1241191230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Nilekar, Shirish K. "Self maintenance of materialized xquery views via query containment and re-writing." Link to electronic thesis, 2006. http://www.wpi.edu/Pubs/ETD/Available/etd-042406-140436/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Trotman, Andrew, and n/a. "Searching and ranking structured documents." University of Otago. Department of Computer Science, 2007. http://adt.otago.ac.nz./public/adt-NZDU20070403.110440.

Full text

Abstract:

It is common to see documents with explicit structure marked up in languages such as XML. Queries, on the other hand, typically have no structure. There is a clear mismatch, although documents contain structure it is typically not used in information retrieval. An efficient index structure for document-centric searching is proposed and its efficiency is discussed. It is shown to be at worst linear with respect to the number of occurrences of a given search term. The algorithm is then extended to accommodate element-centric information retrieval. Ranking algorithms for structured documents are examined. Genetic Algorithms are used to learn different weights for each structure present in a document. Applying these weights as part of a function is shown to yield significant precision improvements in some functions. Genetic Programming is then used to learn an entire ranking function. This function is shown to be portable between document collections. A query language for structured information retrieval is proposed. Use of this language in the 2004 INEX workshop resulted in a large decrease in query errors. Structured information retrieval is now a viable alternative to its unstructured counterpart. A successful query language, efficient indexing structures, and improved ranking functions are all presented.

APA, Harvard, Vancouver, ISO, and other styles

35

Silva, Asima. "Multiple continuous query processing with relative window predicates "Juggler"." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0527104-223456/.

Full text

Abstract:

Thesis (M.S.)--Worcester Polytechnic Institute.
Keywords: reordering predicates; multi-join operator; sliding windows; window predicates; join algorithm; continuous queries. Includes bibliographical references (p. 101-103).

APA, Harvard, Vancouver, ISO, and other styles

36

Wang, Wei. "Structural join : processing algorithms and size estimation /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20WANG.

Full text

Abstract:

Thesis (Ph. D.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 107-120). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

37

Wilk, Artur. "Descriptive Types for XML Query Language Xcerpt." Licentiate thesis, Linköping : Univ, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-7542.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Sutherland, Timothy Michael. "D-CAPE -- A self-tuning continuous query plan distribution architecture." Link to electronic thesis, 2004. http://www.wpi.edu/Pubs/ETD/Available/etd-0505104-120617/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Jbantova, Mariana G. "State spill policies for state intensive continuous query plan evaluation." Link to ETD, 2007. http://www.wpi.edu/Pubs/ETD/Available/etd-050207-222839/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Shen, Qiong Mao. "Group nearest neighbor queries /." View abstract or full-text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20SHEN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Nehme, Rimma V. "Continuous query processing on spatio-temporal data streams." Link to electronic thesis, 2005. http://www.wpi.edu/Pubs/ETD/Available/etd-082305-154035/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Mohammed, Salahadin 1959. "Optimal multidimensional storage organisation for efficient query processing in databases." Monash University, School of Computer Science and Software Engineering, 2001. http://arrow.monash.edu.au/hdl/1959.1/8259.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Wong, Wing Sing. "K-nearest-neighbor queries with non-spatial predicates on range attributes /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?COMP%202005%20WONGW.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Hui, Michael Chun Kit. "Aggregate nearest neighbor queries /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20HUI.

Full text

Abstract:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 91-95). Also available in electronic version. Access restricted to campus users.

APA, Harvard, Vancouver, ISO, and other styles

45

Molyneux, Richard. "Hyperset approach to semi-structured databases and the experimental implementation of the query language Delta." Thesis, University of Liverpool, 2009. http://livrepository.liverpool.ac.uk/1109/.

Full text

Abstract:

This thesis presents practical suggestions towards the implementation of the hyperset approach to semi-structured databases and the associated query language Delta. This work can be characterised as part of a top-down approach to semi-structured databases, from theory to practice. The main original part of this work consisted in implementation of the hyperset Delta query language to semi-structured databases, including worked example queries. In fact, the goal was to demonstrate the practical details of this approach and language. The required development of an extended, practical version of the language based on the existing theoretical version, and the corresponding operational semantics. Here we present detailed description of the most essential steps of the implementation. Another crucial problem for this approach was to demonstrate how to deal in reality with the concept of the equality relation between (hyper)sets, which is computationally realised by the bisimulation relation. In fact, this expensive procedure, especially in the case of distributed semi-structured data, required some additional theoretical considerations and practical suggestions for efficient implementation. To this end the 'local/global' strategy for computing the bisimulation relation over distributed semi-structured data was developed and its efficiency was experimentally confirmed. Finally, the XML-WDB format for representing any distributed WDB as system of set equations was developed so that arbitrary XML elements can participate and, hence, queried by the -language. The query system with the syntax of the language and several example queries from this thesis is available online at http://www.csc.liv.ac.uk/˜molyneux/t/

APA, Harvard, Vancouver, ISO, and other styles

46

Potturi, Venkatakalyan. "IMPLEMENTATION FOR A COHERENT KEYWORD-BASED XML QUERY LANGUAGE." Wright State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=wright1175539749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Achananuparp, Palakorn Hu Xiaohua. "Similarity measures and diversity rankings for query-focused sentence extraction /." Philadelphia, Pa. : Drexel University, 2010. http://hdl.handle.net/1860/3245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Terwilliger, James Felger. "Graphical User Interfaces as Updatable Views." PDXScholar, 2009. https://pdxscholar.library.pdx.edu/open_access_etds/2671.

Full text

Abstract:

In contrast to a traditional setting where users express queries against the database schema, we assert that the semantics of data can often be understood by viewing the data in the context of the user interface (UI) of the software tool used to enter the data. That is, we believe that users will understand the data in a database by seeing the labels, dropdown menus, tool tips, help text, control contents, and juxtaposition or arrangement of controls that are built in to the user interface. Our goal is to allow domain experts with little technical skill to understand and query data. In this dissertation, we present our GUi As View (Guava) framework and describe how we use forms-based UIs to generate a conceptual model that represents the information in the user interface. We then describe how we generate a query interface from the conceptual model. We characterize the resulting query language using a subset of relational algebra. Since most application developers want to craft a physical database to meet desired performance needs independent of the schema used by the user interface, we subsequently present a general-purpose schema mapping tool called a channel that can be configured by instantiating a sequence of discrete transformations. Each transformation is an encapsulation of a physical design decision or business logic process. The channel, once configured, automatically transforms queries from our query interface into queries that address the underlying physical database, similar to a view. The channel also transforms data updates, schema updates, and constraint definitions posed against the channel’s input schema into equivalent forms against the physical schema. We present formal definitions of each transformation and properties that must be true of transformations, and prove that our definitions respect the properties.

APA, Harvard, Vancouver, ISO, and other styles

49

Shah, Hanifa Unisa. "The implementation of a functional query language front-end to a relational database system." Thesis, Aston University, 1989. http://publications.aston.ac.uk/10652/.

Full text

Abstract:

Database systems have a user interface one of the components of which will normally be a query language which is based on a particular data model. Typically data models provide primitives to define, manipulate and query databases. Often these primitives are designed to form self-contained query languages. This thesis describes a prototype implementation of a system which allows users to specify queries against the database in a query language whose primitives are not those provided by the actual model on which the database system is based, but those provided by a different data model. The implementation chosen is the Functional Query Language Front End (FQLFE). This uses the Daplex functional data model and query language. Using FQLFE, users can specify the underlying database (based on the relational model) in terms of Daplex. Queries against this specified view can then be made in Daplex. FQLFE transforms these queries into the query language (Quel) of the underlying target database system (Ingres). The automation of part of the Daplex function definition phase is also described and its implementation discussed.

APA, Harvard, Vancouver, ISO, and other styles

50

Ren, Feng Hui. "Multi-image query content-based image retrieval." Access electronically, 2006. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20070103.143624/index.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Query languages (Computer science)'

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