Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 17 of 17 for “"SIMPLE QUERIES"”.

  1. XML, selectivity estimation, self tuning, Markov histogram, simple queries

    To give an accurate selectivity estimation, the statistics needs to capture the distribution information and depict it correctly and efficiently. The semi-structured nature of XML complicate this problem by introducing more strong correlations to be captured (both path-to-path and path-to-value).In …

    nus Repository record for XML, selectivity estimation, self tuning, Markov histogram, simple queries (opens in a new tab) Download file for XML, selectivity estimation, self tuning, Markov histogram, simple queries (opens in a new tab)

  2. Visual database query language

    … system (DBMS). Its use is straightforward for simple queries, but it gets complicated, hard to comprehend and express for the complex queries. In term of easy of use, Data Flow Query Language (DFQL) represents graphical user interface to the relational model based on a dataflow diagram, and …

    nps Repository record for Visual database query language (opens in a new tab)

  3. A DISTRIBUTED APPROACH TO CONTENT DATA PROCESSING

    … Thirdly, in order to handle compound context queries, a divide-and-conquer methodology is utilized to convert each compound context query into a tree of simple queries processed separately. In addition, a distributed context processing mechanism is developed to handle simultaneous context …

    nus Repository record for A DISTRIBUTED APPROACH TO CONTENT DATA PROCESSING (opens in a new tab) Download file for A DISTRIBUTED APPROACH TO CONTENT DATA PROCESSING (opens in a new tab)

  4. Query-aware generation of database instances for testing database applications

    … database instance(s) to run application queries on these instances. We first propose a method that takes a database schema, a test case representing a sequence of simple queries on a path within a transaction in a given database application, and corresponding properties associated with …

    ottawa-retro Repository record for Query-aware generation of database instances for testing database applications (opens in a new tab)

  5. Tweets2Cube: Interactive spatiotemporal knowledge acquisition from massive social media

    … activity occur. As such, the end users can use simple queries to retrieve task-relevant sub-corpus from the data cube in a flexible way. Moreover, Tweets2Cube consists of a set of spatiotemporal modeling algorithms, which can be readily applied to the retrieved data for extracting knowledge …

    uiuc Repository record for Tweets2Cube: Interactive spatiotemporal knowledge acquisition from massive social media (opens in a new tab)

  6. Onto VQL : Ontology Visual Query Language

    … domains, there grows the need for a simple way to query ontologies. This thesis presents OntoVQL, a formal visual query language that allows to query OWL ontologies. OntoVQL hides the complexity of an OWL query language by abstracting the query as a graph that can be broken and …

    concordia Download PDF for Onto VQL : Ontology Visual Query Language (opens in a new tab)

  7. SAFIR, analogy-based system for database definition and query reuse.

    … users who often adapt database relations and queries from documentation examples to the problem at hand. The user has at her disposal a manual that contains examples of database designs with a variety of database queries in some exemplary milieu called the base domain. The manual explains the …

    ottawa-retro Repository record for SAFIR, analogy-based system for database definition and query reuse. (opens in a new tab)

  8. Regret-based Reward Elicitation for Markov Decision Processes

    … optimal selection of complex queries about full MDP policies (which are informative, but, we believe, cognitively difficult) to the heuristic selection of simple queries that focus on a small set of reward parameters. Results are demonstrated on MDPs drawn from the domains of …

    toronto-retro Repository record for Regret-based Reward Elicitation for Markov Decision Processes (opens in a new tab)

  9. Enabling semantically richer queries over unstructured data

    … focus on efficiently executing semantically simple queries. This thesis argues that enabling semantically rich queries over unstructured data requires rethinking both the query execution strategies and the query interfaces. To this end, we develop four systems that can efficiently and …

    gatech Repository record for Enabling semantically richer queries over unstructured data (opens in a new tab)

  10. Software Evolution: A Requirements Engineering Perspective

    … is done automatically by answering simple queries. Maintaining a requirements knowledge base in parallel with running code means that changes precipitated by evolution are always addressed relative to the ultimate purpose of the system. This thesis begins with empirical studies which …

    toronto-retro Repository record for Software Evolution: A Requirements Engineering Perspective (opens in a new tab)

  11. Efficient Similarity Search in Structured Data

    … The focus of database users has shifted from simple queries to complex analyses of the data, known as knowledge discovery in databases. Important tasks in this area are the grouping of data objects (clustering), the classification of new data objects or the detection of exceptional data …

    lmu-germany Repository record for Efficient Similarity Search in Structured Data (opens in a new tab)

  12. Exploratory search through large video corpora

    … we design a system for rapidly identifying simple queries in large-scale video corpora. Instead of focusing on feature design, our system focuses on the spatiotemporal relationships between those features as a means of disambiguating an activity of interest from background. We define a …

    bu Repository record for Exploratory search through large video corpora (opens in a new tab)

  13. Secure Geometric Search on Encrypted Spatial Data

    … graph design, medical imaging, etc. Geometric queries, such as geometric range queries (i.e., finding points inside a geometric range) and nearest neighbor queries (i.e., finding the closest point to a given point), are fundamental primitives to analyze and retrieve information over spatial …

    arizona-thes Repository record for Secure Geometric Search on Encrypted Spatial Data (opens in a new tab)

  14. Σταθμισμένα ασαφή λογικά προγράμματα: αναπαράσταση, συλλογιστική και προσαρμογή

    … As a result, going one step further than the simple static transcription of classical logic rules as fuzzy logic rules and recognizing that the several antecedents of a fuzzy logic rule may not always be of the same significance for inferencing its consequence, we propose the introduction and …

    greece Repository record for Σταθμισμένα ασαφή λογικά προγράμματα: αναπαράσταση, συλλογιστική και προσαρμογή (opens in a new tab)

  15. Whole-Mouse Brain Vascular Analysis Framework: Synthetic Model-Based Validation, Informatics Platform, and Queryable Database

    … query for visualizations. This means that a simple text-based query can retrieve cerebrovasculature geometry and topology of the specified vasculature. For example, a query can return all vessels within the frontal cortex, those with specific attribute(s) value range(s), or any combination of …

    tamu Repository record for Whole-Mouse Brain Vascular Analysis Framework: Synthetic Model-Based Validation, Informatics Platform, and Queryable Database (opens in a new tab)

  16. Efficient Source Selection For SPARQL Endpoint Query Federation

    … contain complementary data. Running complex queries on this compendium thus often requires accessing data from different data sources within one query. The abundance of datasets and the need for running complex query has thus motivated a considerable body of work on SPARQL query federation …

    qucosa-diss

  17. ΥΠΟΛΟΓΙΣΜΟΣ ΕΠΙΔΟΣΗΣ ΑΡΧΕΙΩΝ ΣΕ ΑΠΛΕΣ ΚΑΙ ΜΑΖΙΚΕΣ ΕΡΩΤΗΣΕΙΣ

    … OF A DATABASE SYSTEM, WHEN SEARCHED FOR SIMPLE AND BATCHED QUERIES IN STRUCTURES STORED IN MAIN OR SECONDARY MEMORY. SIMPLE QUERY IS THE QUERY WHICH IS SATISFIED BY ONE ONLY RECORD OF THE STRUCTURE. BATCHED QUERY SEARCHES FOR MANY RECORDS OF THE STRUCTURE AND IT MAYBE DIVIDED IN TWO …

    greece Repository record for ΥΠΟΛΟΓΙΣΜΟΣ ΕΠΙΔΟΣΗΣ ΑΡΧΕΙΩΝ ΣΕ ΑΠΛΕΣ ΚΑΙ ΜΑΖΙΚΕΣ ΕΡΩΤΗΣΕΙΣ (opens in a new tab)