Implicit Representation of Bigranular Rules for Multigranular Data
Domains for spatial and temporal data are often multigranular in nature, possessing a natural order structure defined by spatial inclusion and time-interval inclusion, respectively. This order structure induces lattice-like (partial) operations, such as join, which in turn lead to join rules, in which a single domain element (granule) is asserted to be equal to, or contained in, the join of a set of such granules. In general, the efficient representation of such join rules is a difficult problem. However, there is a very effective representation in the case that the rule is bigranular; i.e., all of the joined elements belong to the same granularity, and, in addition, complete information about the (non)disjointness of all granules involved is known. The details of that representation form the focus of the paper.
The work of M. Andrea Rodríguez, as well as three visits of Stephen J. Hegner to Concepción, during which many of the ideas reported here were developed, were funded in part by Fondecyt-Conicyt grant number 1170497.
- 1.Bettini, C., Dyreson, C.E., Evans, W.S., Snodgrass, R.T., Wang, X.S.: A glossary of time granularity concepts. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Temporal Databases: Research and Practice. LNCS, vol. 1399, pp. 406–413. Springer, Heidelberg (1998). https://doi.org/10.1007/BFb0053711CrossRefGoogle Scholar
- 8.Hegner, S.J., Rodríguez, M.A.: A model for multigranular data and its integrity. Informatica Lith. Acad. Sci. 28, 45–78 (2017)Google Scholar
- 9.Kifer, M., Bernstein, A., Lewis, P.M.: Database Systems: An Application-Oriented Approach, 2nd edn. Addison-Wesley, Boston (2006)Google Scholar