Abstract
The problem of schema or ontology matching is to define mappings among schema or ontology elements. Such mappings are typically defined between two schemas or two ontologies at a time. Ideally, using the defined mappings, one would be able to issue a single query that will be rewritten automatically to all the databases, instead of manually writing a query to each database. In a centrally mediated architecture a query is written in terms of a global schema or ontology that integrates all the database schemas or ontologies, while in a peer-to-peer architecture a query is written in terms of the schema or of the ontology of any of the peer databases.
This work was supported in part by the National Science Foundation under ITR awards IIS–0326284, IIS–0324846, and IIS–0513553.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agrawal, R., Evfimievski, A.V., Srikant, R.: Information sharing across private databases. In: Proc. ACM SIGMOD, pp. 86–97. ACM Press, New York (2003)
Candan, K.S., Jajodia, S., Subrahmanian, V.S.: Secure mediated databases. In: Proc. IEEE Int. Conf. on Data Engineering, pp. 28–37. IEEE Computer Society Press, Los Alamitos (1996)
Clifton, C., Kantarcioglu, M., Doan, A., Schadow, G., Vaidya, J., Elmagarmid, A.K., Suciu, D.: Privacy-preserving data integration and sharing. In: Proc. ACM Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 19–26. ACM Press, New York (2004)
Dawson, S., Qian, S., Samarati, P.: Providing security and interoperation of heterogeneous systems. Journal of Distributed and Parallel Databases 8(1), 119–145 (2000)
Freedman, M., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Kang, J., Naughton, J.F.: On schema matching with opaque column names and data values. In: Proc. ACM SIGMOD, pp. 205–216. ACM Press, New York (2003)
Mitra, P., Liu, P., Pan, C.-C.: Privacy-preserving ontology mapping. In: Proc. Int. Workshop on Contexts and Ontologies: Theory, Practice and Applications (2005)
Mitra, P., Pan, C.-C., Liu, P., Atluri, V.: Privacy-preserving semantic interoperation and access control of heterogeneous databases. In: Proc. ACM Conf. on Computer and Communications Security, pp. 66–77. ACM Press, New York (2006)
Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB Journal 10(4), 334–350 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Cruz, I.F., Tamassia, R., Yao, D. (2007). Privacy-Preserving Schema Matching Using Mutual Information. In: Barker, S., Ahn, GJ. (eds) Data and Applications Security XXI. DBSec 2007. Lecture Notes in Computer Science, vol 4602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73538-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-73538-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73533-5
Online ISBN: 978-3-540-73538-0
eBook Packages: Computer ScienceComputer Science (R0)