{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T22:28:17Z","timestamp":1648506497196},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T00:00:00Z","timestamp":1288742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron Commer Res"],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1007\/s10660-010-9067-8","type":"journal-article","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T17:06:36Z","timestamp":1288717596000},"page":"103-121","source":"Crossref","is-referenced-by-count":5,"title":["A privacy policy conflict detection method for\u00a0multi-owner privacy data protection"],"prefix":"10.1007","volume":"11","author":[{"given":"Yi","family":"Ren","sequence":"first","affiliation":[]},{"given":"Fangquan","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]},{"given":"Xiaoting","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,3]]},"reference":[{"key":"9067_CR1","volume-title":"Proc. 28th int\u2019l conf. on very large data bases","author":"R. Agrawal","year":"2002","unstructured":"Agrawal, R., Kiernan, J., Srikant, R., & Xu, Y. (2002). Hippocratic databases. In Proc. 28th int\u2019l conf. on very large data bases, Hong Kong, China."},{"issue":"1","key":"9067_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TDSC.2005.9","volume":"2","author":"E. Bertino","year":"2005","unstructured":"Bertino, E., & Sandhu, R. (2005). Database security\u2014concepts, approached, and challenge. IEEE Transaction On Dependable and Secure Computing, 2(1), 2\u201319.","journal-title":"IEEE Transaction On Dependable and Secure Computing"},{"key":"9067_CR3","volume-title":"Proceedings of the 2006 ACM SIGMOD international conference on management of data","author":"X. Xiao","year":"2006","unstructured":"Xiao, X., & Tao, Y. (2006). Personalized privacy preservation. In Proceedings of the 2006 ACM SIGMOD international conference on management of data, Chicago, IL, USA."},{"issue":"1","key":"9067_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1121995.1121997","volume":"35","author":"J.-W. Byun","year":"2006","unstructured":"Byun, J.-W., Bertino, E., & Li, N. (2006). Micro-views, or on how to protect privacy while enhancing data usability\u2014concepts and challenges. SIGMOD Record, 35(1), 9\u201313.","journal-title":"SIGMOD Record"},{"key":"9067_CR5","first-page":"217","volume-title":"ICDE","author":"R. Bayardo","year":"2005","unstructured":"Bayardo, R., & Agrawal, R. (2005). Data privacy through optimal k-anonymization. In ICDE (pp. 217\u2013228)."},{"key":"9067_CR6","first-page":"1","volume-title":"Secure data management","author":"C. Yao","year":"2006","unstructured":"Yao, C., Wang, L., Wang, X. S., & Jajodia, S. (2006). Indistinguishability: the other aspect of privacy. In Secure data management (pp. 1\u201317)."},{"key":"9067_CR7","unstructured":"Samarati, P., & Sweeney, L. (1998). Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression (Technical Report). SRI International, March 1998."},{"issue":"5","key":"9067_CR8","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L. (2002). k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5), 557\u2013570.","journal-title":"International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"9067_CR9","volume-title":"ICDE","author":"K. LeFevre","year":"2006","unstructured":"LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006). Mondrian multidimensional k-anonymity. In ICDE."},{"key":"9067_CR10","volume-title":"ICDE","author":"A. Machanavajjhala","year":"2006","unstructured":"Machanavajjhala, A., Gehrke, J., & Kifer, D. (2006). l-diversity: privacy beyond k-anonymity. In ICDE."},{"key":"9067_CR11","volume-title":"SACMAT\u201905","author":"J.-W. Byun","year":"2005","unstructured":"Byun, J.-W., Bertino, E., & Li, N. (2005). Purpose based access control of complex data for privacy protection. In SACMAT\u201905, June 1\u20133, 2005."},{"key":"9067_CR12","volume-title":"CONIELECOMP\u201907","author":"I. Olmos","year":"2007","unstructured":"Olmos, I., Gonzalez, J. A., & Osorio, M. (2007). Reductions between the subgraph isomorphism problem and Hamiltonian and SAT problems. In CONIELECOMP\u201907."},{"key":"9067_CR13","volume-title":"VLDB\u201908","author":"J.-W. Byun","year":"2008","unstructured":"Byun, J.-W., Bertino, E., & Li, N. (2008). Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In VLDB\u201908, August 24\u201330, 2008."},{"key":"9067_CR14","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02265083","volume":"6","author":"Y. Kambayashi","year":"1996","unstructured":"Kambayashi, Y., & Peng, Z. (1996). An object deputy model for realization of flexible and powerful objectbases. Journal of Systems Integration, 6, 329\u2013362.","journal-title":"Journal of Systems Integration"},{"key":"9067_CR15","first-page":"333","volume-title":"Proc. of IEEE 11th int. conf. on data engineering","author":"Z. Peng","year":"1995","unstructured":"Peng, Z., & Kambayashi, Y. (1995). Deputy mechanisms for object-oriented databases. In Proc. of IEEE 11th int. conf. on data engineering (pp. 333\u2013340)."},{"key":"9067_CR16","volume-title":"Second international workshop in information and computer security","author":"Y. Ren","year":"2007","unstructured":"Ren, Y., Luo, M., Tang, Z., & Ye, L. (2007). A composite privacy protection model. In Second international workshop in information and computer security, Nara, Japan."},{"key":"9067_CR17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1007\/3-540-63385-5_30","volume-title":"Proceeding of the 5th Kurt Godel colloquium on computational logic and proof theory","author":"S. R. Buss","year":"1997","unstructured":"Buss, S. R. (1997). Alogtime algorithms for tree isomorphism, comparison, and canonization. In Proceeding of the 5th Kurt Godel colloquium on computational logic and proof theory (pp. 18\u201333)."},{"key":"9067_CR18","unstructured":"Wen, X.-l., & Liang, H.-j. (2005). A BULT algorithms for tree isomorphism. Acta scientiarum naturalium universitatis sunyatseni, 44(6)."},{"issue":"5\/6","key":"9067_CR19","first-page":"199","volume":"71","author":"S. O. Kuznetsov","year":"1999","unstructured":"Kuznetsov, S. O., & Obiedkov, S. A. (1999). Comparing performance of algorithmsfor generating concept lattices. Journal of Experimental and Theoretical Artificial Intelligence, 71(5\/6), 199\u2013204.","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"9067_CR20","volume-title":"VLDB\u201902","author":"C. Bettini","year":"2002","unstructured":"Bettini, C., Jajodia, S., Wang, X. S., & Wijesekera, D. (2002). Provisions and obligations in policy management and security applications. In VLDB\u201902, Hong Kong, China."}],"container-title":["Electronic Commerce Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-010-9067-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10660-010-9067-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10660-010-9067-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:52:52Z","timestamp":1559249572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10660-010-9067-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,1]]}},"alternative-id":["9067"],"URL":"https:\/\/doi.org\/10.1007\/s10660-010-9067-8","relation":{},"ISSN":["1389-5753","1572-9362"],"issn-type":[{"value":"1389-5753","type":"print"},{"value":"1572-9362","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,3]]}}}