1993
DOI: 10.1109/69.250077
|View full text |Cite
|
Sign up to set email alerts
|

Learning transformation rules for semantic query optimization: a data-driven approach

Abstract: Learning query transformation rules is vital for the success of semantic query optimization in domains where the user cannot provide a comprehensive set of integrity constraints. Finding these rules is a discovery task because of the lack of target. Previous approaches to learning query transformation rules have been based on analyzing past queries. We propose a new approach to learning query transformation rules based on analyzing the existing data in the database. This paper describes a framework and a closu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
22
0

Year Published

1997
1997
2006
2006

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(22 citation statements)
references
References 22 publications
0
22
0
Order By: Relevance
“…In previous work [12,15,16,17] on 'semantic query optimisation' [10,18,19,20] the authors developed a particular type of subset descriptor, which the data server used for query optimisation (rewriting the query in a form that is answerable more quickly). The current paper extends the use of rules for query optimisation, by utilizing descriptors in the Server to provide new subset descriptors for remote client caches, and so extends current research on 'associative caching' [e.g.…”
Section: Discussionmentioning
confidence: 99%
“…In previous work [12,15,16,17] on 'semantic query optimisation' [10,18,19,20] the authors developed a particular type of subset descriptor, which the data server used for query optimisation (rewriting the query in a form that is answerable more quickly). The current paper extends the use of rules for query optimisation, by utilizing descriptors in the Server to provide new subset descriptors for remote client caches, and so extends current research on 'associative caching' [e.g.…”
Section: Discussionmentioning
confidence: 99%
“…We now generalise the queryrecommended rule to a pattern for a set of rules to be obtained by data analysis, which then examines and shortlists the most probably useful subset for future queries. Shekhar [ 5 ] used a classification grid to examine the distribution of data values and derive rules with a wide range of structures, whose applicability to a wide range of queries, robustness against data changes, ease of maintenance, and access speed is poor compared with attribute-pair rules.…”
Section: Discussionmentioning
confidence: 99%
“…Analysis produces summary information that can either answer a query without consulting the data itself, or else modify the query to a form the data server will be able to process more quickly. This query-modification operation using knowledge of the data is known as Semantic Query Optimisation (SQO) [1,3,5,7]. Relational data is discussed in this paper.…”
Section: Introductionmentioning
confidence: 99%
“…Let us assume that n 11 , n 22 and n 33 have values 3, 4 and 2 respectively and all other cells contain a zero. The traditional way of calculating Chi-square would be:…”
Section: Algorithm Design and Memory Limitationmentioning
confidence: 99%
“…Generally, rules can be supplied by the database engineer or derived automatically. Automatic rule generation methods include heuristic based systems [13], logic based systems [1], graph based systems [12] and data driven systems [7,11].…”
Section: Introductionmentioning
confidence: 99%