Abstract
When record sets become large, indexing becomes a required technique for speeding up querying. This holds for regular databases, but also for ‘fuzzy’ databases. In this paper we propose a novel indexing technique, supporting the querying of imperfect numerical data. A possibility based relational database setting is considered. Our approach is based on a novel adaptation of a B\(^{+}\)-tree, which is currently still one of the most efficient indexing techniques for databases. The leaf nodes of a B\(^{+}\)-tree are enriched with extra data and an extra tree pointer so that interval data can be stored and handled with them, hence the name Interval B\(^{+}\)-tree (IBPT). An IBPT allows to index possibility distributions using a single index structure, offering almost the same benefits as a B\(^{+}\)-tree. We illustrate how an IBPT index can be used to index fuzzy sets and demonstrate its benefits for supporting ‘fuzzy’ querying of ‘fuzzy’ databases. More specifically, we focus on the handling of elementary query criteria that use the so-called compatibility operator IS, which checks whether stored imperfect data are compatible with user preferences (or not).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. Addison-Wesley, Boston (1983)
Barranco, C.D., Campana, J.R., Medina, J.M.: A B\(^{+}\)-tree based indexing technique for fuzzy numerical data. Fuzzy Sets Syst. 159, 1431–1449 (2008)
Bosc, P., Galibourg, M.: Indexing principles for a fuzzy data base. Inf. Syst. 14(6), 493–499 (1989)
Boss, B., Helmer, S.: Indexing a fuzzy database using the technique of superimposed coding - cost models and measurements. Reihe Informatik 2, 24 (1996)
Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377–387 (1970)
Dubois, D., Prade, H.: Possibility Theory: An Approach to Computerized Processing of Uncertainty. Plenum Press, New York (1988)
Liu, C., Ouksel, A., Sistla, P., Wu, J., Yu, C., Rishe, N.: Performance evaluation of G-tree and its application in fuzzy databases. In: Proceeding of the 5th International Conference on Information and Knowledge Management CIKM 1996, pp. 235–242. ACM, New York (1996)
Prade, H., Testemale, C.: Generalizing database relational algebra for the treatment of incomplete or uncertain information and vague queries. Inf. Sci. 34(2), 115–143 (1984)
Yazici, A., Cibiceli, D.: An index structure for fuzzy databases. In: Proceeding of the 5th IEEE International Conference on Fuzzy Systems, vol. 2, pp. 1375–1381, New Orleans (1996)
Yazici, A., Cibiceli, D.: An access structure for similarity-based fuzzy databases. Inf. Sci. 115(1–4), 137–163 (1999)
Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1, 3–28 (1978)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
De Tré, G., De Mol, R., Bronselaer, A. (2016). Indexing Possibilistic Numerical Data: The Interval B\(^{+}\)-tree Approach. In: Carvalho, J., Lesot, MJ., Kaymak, U., Vieira, S., Bouchon-Meunier, B., Yager, R. (eds) Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2016. Communications in Computer and Information Science, vol 611. Springer, Cham. https://doi.org/10.1007/978-3-319-40581-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-40581-0_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-40580-3
Online ISBN: 978-3-319-40581-0
eBook Packages: Computer ScienceComputer Science (R0)