Skip to main content
SpringerLink
Log in

Attribute-pair range rules

  • Conference paper
  • First Online:
Database and Expert Systems Applications (DEXA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1460))

Included in the following conference series:

Abstract

This paper examines the properties of metadata in the form of IF THEN rules which contain two predicates on attributes of a relational database table. For example: a(15. 30) ⟹ d(243. 271), which means “if the value of attribute ‘a’ in a tuple is in the range 15 to 30 then the value of attribute ‘d’ will be in the range 243 to 271.” Metadata of this kind is useful in Semantic Query Optimisation and Remote Cache Management. The two predicates (antecedent and consequent) in each rule are Selection Conditions or constraints of the type found in database queries. Each condition therefore denotes a subset of a database table. Rules can be cascaded, using subrange containment as the link between successive rules. The set of rules can therefore be regarded as a set of edges in a Condition Dependency Graph, and using the rule-set is path discovery in the graph. The purpose of the current paper is to introduce some of the properties of attribute-pair range rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adali, S., Candan, K. S., Papakonstantinou, Y., Subrahmanian, V. S.: Query Caching and Optimization in Distributed Mediator Systems. ACM SIGMOD Conf. (1996) 137–148.

    Google Scholar 

  2. Dar, S., Franklin, M. J., Jonsson, B. T., Srivastava, D., Tan, M.: Semantic Data Caching and Replacement, Proc. 22nd VLDB Conference (1996) 330–341.

    Google Scholar 

  3. Keller, A. M., Basu, J.: A Predicate-based Caching Scheme for Client-Server Database Architectures. VLDB Journal 5(1) 1996, 35–47.

    Article  Google Scholar 

  4. Lowden, B.G.T., Robinson, J., Lim, K.Y.: A Semantic Query Optimiser using Automatic Rule Derivation. WITS'95, 5th Intl. Workshop on Information Technologies and Systems (1995) 68–76.

    Google Scholar 

  5. Qian, X.: Query Folding. 12th IEEE Intl. Conf. on Data Engineering (1996) 48–55.

    Google Scholar 

  6. Robinson, J., Lowden, B. G. T.: Data Analysis for Query Processing. 2nd Intl. Symposium on Intelligent Data Analysis (1997) 447–458. (LNCS 1280)

    Google Scholar 

  7. Robinson, J., Lowden, B. G. T.: Semantic Query Optimisation and Rule Graphs. KRDB'98, 5th International Workshop on Knowledge Representation meets Data Bases (1998).

    Google Scholar 

  8. Shekhar, S., et al.: A Formal Trade-off between Optimization and Execution Costs in Semantic Query Optimization. Proc. 14th VLDB Conference (1988) 457–467.

    Google Scholar 

  9. Shenoy, S. T., Ozsoyoglu, Z. M.: Design and Implementation of a Semantic Query Optimizer. IEEE Trans. Knowledge and Data Engineering, 1(3) 1989, 344–361.

    Article  Google Scholar 

  10. Siegel, M.,et al.: A Method for Automatic Rule Derivation to Support Semantic Query Optimization. ACM Trans. Database Systems, 17(4) 1992, 563–600.

    Article  MathSciNet  Google Scholar 

  11. Yu, C., Sun, W.: Automatic Knowledge Acquisition and Maintenance for Semantic Query Optimization. IEEE Trans. Knowledge and Data Engineering, 1(3) 1989, 362–375.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Essex, CO4 3SQ, Colchester, Essex, UK

    Jerome Robinson & Barry G. T. Lowden

Authors
  1. Jerome Robinson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Barry G. T. Lowden
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerald Quirchmayr Erich Schweighofer Trevor J.M. Bench-Capon

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robinson, J., Lowden, B.G.T. (1998). Attribute-pair range rules. In: Quirchmayr, G., Schweighofer, E., Bench-Capon, T.J. (eds) Database and Expert Systems Applications. DEXA 1998. Lecture Notes in Computer Science, vol 1460. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054524

Download citation

  • DOI: https://doi.org/10.1007/BFb0054524

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64950-2

  • Online ISBN: 978-3-540-68060-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation