• No results found

[PDF] Top 20 Approximate rewriting of queries using views

Has 10000 "Approximate rewriting of queries using views" found on our website. Below are the top 20 most common "Approximate rewriting of queries using views".

Approximate rewriting of queries using views

Approximate rewriting of queries using views

... Q using the viewset ...the rewriting is much more critical than the speed of generation of the rewriting, for example in applications where the rewriting is obtained once, and then executed ... See full document

60

Designing views to answer queries under set, bag, and bag-set semantics

Designing views to answer queries under set, bag, and bag-set semantics

... optimizing queries in the presence of materialized ...SQL queries have bag-theoretic seman- tics (duplicates are not eliminated unless explicitly re- ...designing views to answer queries in ... See full document

6

Obtaining information about queries behind views and dependencies

Obtaining information about queries behind views and dependencies

... the views in V), in the secret query Q. We will be referring to all queries R over schema V as “rewritings” (in terms of V), as indeed they would be defined in terms of the relation symbols in V ...such ... See full document

34

Designing and using views to improve performance of aggregate queries

Designing and using views to improve performance of aggregate queries

... materialized views or indexes, are routinely used in data-intensive systems to improve query-evaluation ...of queries, a database, and a set of constraints on derived data ...the queries. Automated ... See full document

31

Accessing queries using views

Accessing queries using views

... RSI) queries and LSI (or RSI) views satisfying the non-union conditions C1 and ...the queries do not need to be ...containing rewriting might not exist in the language of conjunc- tive ... See full document

18

Algorithms for Selecting Views and Indexes to Answer Queries

Algorithms for Selecting Views and Indexes to Answer Queries

... that can be treated as tasks. Incorporation of any classes of tasks, including indexes, in our stage-one algorithms is orthogonal to the query/view/rewriting languages to which the algorithms are applicable. Note ... See full document

132

Materialized View Selection Approach Using Tree Based Methodology

Materialized View Selection Approach Using Tree Based Methodology

... materialized views to efficiently process a given set of ...all views is not possible because of the space constraint and maintenance cost ...Materialized views is one of the most important decisions ... See full document

11

Providing Security to Sensitive Information in Relational Database Using The Concept of Null Value Theory

Providing Security to Sensitive Information in Relational Database Using The Concept of Null Value Theory

... offers a limited interaction layer. After all, protecting data may require additional measures, like withholding from certain users certain information that is, most likely, not crucial for many applications. From these ... See full document

5

Complete and equivalent query rewriting using views.

Complete and equivalent query rewriting using views.

... Query rewriting using views is a technique for answering a query using a set o f views instead of accessing the database relations ...equivalent rewriting using ... See full document

101

Algebraic Optimization of Outerjoin Queries

Algebraic Optimization of Outerjoin Queries

... relations. Queries on views are well dened; translation of view updates into base relations is not dened, in ...treat views as if they were real relations, and the system replaces references to ... See full document

123

Reasoning by term rewriting

Reasoning by term rewriting

... As an example of the structural rules S5-S8, consider the signature Alice, John, Jill, Jenny, Kelly, Mary E person, father : person person, E = sister, aunt : person --* {person}, female[r] ... See full document

146

Development and evaluation of a geographic information retrieval system using fine grained toponyms

Development and evaluation of a geographic information retrieval system using fine grained toponyms

... (e.g., using georeferenced Tweets to train classifiers [66] or benchmark data to develop methods to locate images and videos [10]) suggests that joint resources can rapidly acceler- ate ... See full document

29

Query Rewriting Using Monolingual Statistical Machine Translation

Query Rewriting Using Monolingual Statistical Machine Translation

... Information Retrieval (IR) applications have been notoriously resistant to improvement attempts by Natural Language Processing (NLP). With a few exceptions for specialized tasks, 1 the contribution of part-of-speech ... See full document

14

On the Parameterized Complexity of Linear Context Free Rewriting Systems

On the Parameterized Complexity of Linear Context Free Rewriting Systems

... where the derivation has, so far, generated some terminal symbols (the lower-case letters), two in- stances of the non-terminal A and one instance of B. The configuration keeps track of where the symbols generated by the ... See full document

9

Modular Graph Rewriting to Compute Semantics

Modular Graph Rewriting to Compute Semantics

... Since each step of computation is fired by some local conditions in the whole graph, it is well known that one has no grip on the sequence of rewriting steps. The more rules, the more interaction between rules, ... See full document

10

A survey on the use of relevance feedback for information access systems

A survey on the use of relevance feedback for information access systems

... query using terms chosen from the relevant documents in the top 20 retrieved ...all queries, each combination of cut-offs was ...more queries: it was a more stable improvement over the AQE ... See full document

53

JIT costing adaptive skeletons for performance portability

JIT costing adaptive skeletons for performance portability

... The paper evaluates the AS prototype to discover (1) whether the system scales given enough parallelism of suitable granularity, and (2) whether the trace cost model can predict granularity with sufficient accuracy to ... See full document

9

Preliminary Interpretation Using Ambiguous Queries

Preliminary Interpretation Using Ambiguous Queries

... Boolean queries by instances,” [4] This project allows the client toanalyze and verifyall the quantified queries,a set of database queries known to be very difficult for all but the most expert users ... See full document

6

Using natural language for database queries

Using natural language for database queries

... design used semantic input into its information In such parser in which the target attribute identification Using, an idea a query "What street, city as target attributes the Masters The[r] ... See full document

88

Reflection and Transmission Coefficients from Rectangular Notches in Pipes

Reflection and Transmission Coefficients from Rectangular Notches in Pipes

... The (consistent) force vector at the points along the radial line θ = 0 can be obtained, for the incident and reflected wave fields by expressing the modal stresses in terms of the displacement wave functions and ... See full document

14

Show all 10000 documents...