{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:40:19Z","timestamp":1739922019359,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233053"},{"type":"electronic","value":"9783540301929"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30192-9_25","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:02:43Z","timestamp":1267552963000},"page":"260-269","source":"Crossref","is-referenced-by-count":5,"title":["Summarizing XML Data by Means of Association Rules"],"prefix":"10.1007","author":[{"given":"Elena","family":"Baralis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Garza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisa","family":"Quintarelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Letizia","family":"Tanca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proceeding of VLDB 1994 (1994)"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Arenas, M., Libkin, L.: A normal form for xml documents. ACM TODS (2002)","DOI":"10.1145\/543621.543625"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Augurusa, E., Braga, D., Campi, A., Ceri, S.: Design and implementation of a graphical interface to xquery. In: SAC 2003 (2003)","DOI":"10.1145\/952532.952759"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Baralis, E., Garza, P., Quintarelli, E., Tanca, L.: Answering Queries on XML Data by means of Association Rules. Technical Report, 3, Politecnico di Milano (2004), http:\/\/www.elet.polimi.it\/upload\/quintare\/Papers\/BGQT-RR.ps","DOI":"10.1007\/978-3-540-30192-9_25"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Buneman, P., Davidson, S., Fan, W., Hara, C., Tan, W.: Reasoning about keys for XML. In: DBLP 2001 (2001)","DOI":"10.1145\/371920.371984"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/373626.373697","volume":"30","author":"P. Buneman","year":"2001","unstructured":"Buneman, P., Fan, W., Sim\u00e9on, J., Weinstein, S.: Constraints for semistructured data and XML. ACM SIGMOD Record\u00a030(1), 47\u201354 (2001)","journal-title":"ACM SIGMOD Record"},{"issue":"1\u20132","key":"25_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0304-3975(01)00295-X","volume":"275","author":"A. Cortesi","year":"2002","unstructured":"Cortesi, A., Dovier, A., Quintarelli, E., Tanca, L.: Operational and Abstract Semantics of a Query Language for Semi\u2013Structured Information. Theoretical Computer Science\u00a0275(1\u20132), 521\u2013560 (2002)","journal-title":"Theoretical Computer Science"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Damiani, E., Oliboni, B., Quintarelli, E., Tanca, L.: Modeling Semistructured Data by using graph-based constraints. Technical Report 27\/03, Politecnico di Milano. Dipartimento di Elettronica e Informazione (July 2003)","DOI":"10.1007\/978-3-540-39962-9_9"},{"key":"25_CR9","unstructured":"Dovier, A., Piazza, C., Policriti, A.: An efficient algorithm for computing bisimulation equivalence. Theoretical Computer Science (to appear)"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Fan, W., Libkin, L.: On XML integrity constraints in the presence of DTDs. In: Symposium on Principles of Database Systems (2001)","DOI":"10.1145\/375551.375568"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1145\/584792.584867","volume-title":"Proceedings of CIKM 2002","author":"G. Grahne","year":"2002","unstructured":"Grahne, G., Zhu, J.: Discovering approximate keys in XML data. In: Proceedings of CIKM 2002, pp. 453\u2013460. ACM Press, New York (2002)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceeding of SIGMOD 2000 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y. Huhtala","year":"1999","unstructured":"Huhtala, Y., K\u00e4rkk\u00e4inen, J., Porkka, P., Toivonen, H.: TANE: An efficient algorithm for discovering functional and approximate dependencies. The Computer Journal\u00a042(2), 100\u2013111 (1999)","journal-title":"The Computer Journal"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/3-540-45876-X_10","volume-title":"Advances in Database Technology - EDBT 2002","author":"M.L. Lee","year":"2002","unstructured":"Lee, M.L., Ling, T.W., Low, W.L.: Designing functional dependencies for XML. In: Jensen, C.S., Jeffery, K., Pokorn\u00fd, J., \u0160altenis, S., Bertino, E., B\u00f6hm, K., Jarke, M. (eds.) EDBT 2002. LNCS, vol.\u00a02287, p. 124. Springer, Heidelberg (2002)"},{"key":"25_CR15","unstructured":"Merialdo, P.: SIGMOD RECORD in XML (2003), http:\/\/www.acm.org\/sigmod\/record\/xml"},{"key":"25_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Berlin (1980)"},{"key":"25_CR17","first-page":"237","volume-title":"Proceedings of VLDB 1989","author":"A. Motro","year":"1989","unstructured":"Motro, A.: Using Integrity Constraints to Provide Intensional Answers to Relational Queries. In: Proceedings of VLDB 1989, pp. 237\u2013245. Morgan Kaufmann, San Francisco (1989)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Porter, M.F.: An algorithm for suffix stripping. Program (1980)","DOI":"10.1108\/eb046814"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/3-540-18420-1_69","volume-title":"Graph Reduction","author":"J. Staples","year":"1987","unstructured":"Staples, J., Robinson, P.J.: Unification of quantified terms. In: Fasel, J.H., Keller, R.M. (eds.) Graph Reduction 1986. LNCS, vol.\u00a0279, pp. 426\u2013450. Springer, Heidelberg (1987)"},{"key":"25_CR20","unstructured":"World Wide Web Consortium. XML Information Set (2001), http:\/\/www.w3C.org\/xml-infoset\/"},{"key":"25_CR21","unstructured":"World Wide Web Consortium. Extensible Markup Language (XML) 1.0 (1998), http:\/\/www.w3C.org\/TR\/REC-xml\/"}],"container-title":["Lecture Notes in Computer Science","Current Trends in Database Technology - EDBT 2004 Workshops"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30192-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:05:39Z","timestamp":1739919939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30192-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233053","9783540301929"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30192-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}