{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:36:01Z","timestamp":1725564961405},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260769"},{"type":"electronic","value":"9783540319351"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11430919_63","type":"book-chapter","created":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T06:06:46Z","timestamp":1283839606000},"page":"539-544","source":"Crossref","is-referenced-by-count":0,"title":["Frequent Itemset Mining with Parallel RDBMS"],"prefix":"10.1007","author":[{"given":"Xuequn","family":"Shang","sequence":"first","affiliation":[]},{"given":"Kai-Uwe","family":"Sattler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","unstructured":"Agarwal, R., Shim, R.: Developing tightly-coupled data mining application on a relational database system. In: Proc.of the 2nd Int. Conf. on Knowledge Discovery in Database and Data Mining, Portland,Oregon (1996)"},{"key":"63_CR2","unstructured":"Agarwal, R., Srikant, R.: Fast algorithm for mining association rules. In: Proc. 1994 Int. Conf. Very Large Data Bases (VLDB 1994), Santiago, Chile, September 1994, pp. 487\u2013499 (1994)"},{"key":"63_CR3","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proc. 2000 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 2000), Dallas, TIX, May 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"63_CR4","unstructured":"Meo, R., Psaila, G., Ceri, S.: A new sql like operator for mining association rules. In: Proc. Of the 22nd Int. Conf. on Very Large Databases, Bombay, India (September 1996)"},{"key":"63_CR5","doi-asserted-by":"crossref","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. In: Proc. 1995 ACM-SIGMOD Int. Conf. Management of Data (SIGMOD 1995), San Jose, CA, May 1995, pp. 175\u2013186 (1995)","DOI":"10.1145\/223784.223813"},{"key":"63_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-36175-8_47","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"I. Pramudiono","year":"2003","unstructured":"Pramudiono, I., Kitsuregawa, M.: Parallel fp-growth on pc cluster. In: Whang, K.-Y., Jeon, J., Shim, K., Srivastava, J. (eds.) PAKDD 2003. LNCS (LNAI), vol.\u00a02637, pp. 467\u2013473. Springer, Heidelberg (2003)"},{"key":"63_CR7","doi-asserted-by":"crossref","unstructured":"Shang, X., Sattler, K.: Depth-first frequent itemset mining in relational databases. In: Proc. ACM Symposium on Applied Computing SAC 2005, New Mexico, USA (March 2005)","DOI":"10.1145\/1066677.1066928"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11430919_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:01Z","timestamp":1619507461000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11430919_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260769","9783540319351"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11430919_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}