{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:23:14Z","timestamp":1751775794710,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icdm.2003.1250899","type":"proceedings-article","created":{"date-parts":[[2004,4,23]],"date-time":"2004-04-23T18:38:15Z","timestamp":1082745495000},"page":"27-34","source":"Crossref","is-referenced-by-count":21,"title":["Zigzag: a new algorithm for mining large inclusion dependencies in databases"],"prefix":"10.1109","author":[{"given":"F.","family":"De Marchi","sequence":"first","affiliation":[]},{"given":"J.-M.","family":"Petit","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(99)00003-4"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90075-8"},{"key":"ref11","first-page":"38","article-title":"Enforcing inclusion dependencies and referencial integrity","author":"casanova","year":"1988","journal-title":"Proc of International Conference on Very Large Data Bases (VLDB)"},{"key":"ref12","first-page":"687","article-title":"Implementation of two semantic query optimization techniques in DB2 universal database","author":"cheng","year":"1999","journal-title":"Int Conf on Very Large Data Bases"},{"key":"ref13","first-page":"464","article-title":"Efficient algorithms for mining inclusion dependencies","author":"de marchi","year":"2002","journal-title":"International Conference on Extending Database Technology (EDBT'02) Prague Czech Republic volume 2287 of Lecture Notes in Computer Science"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/640990.640997"},{"key":"ref15","first-page":"167","article-title":"Some remarks on generating armstrong and inferring functional dependencies relation","volume":"12","author":"demetrovics","year":"1995","journal-title":"Acta Cybernetica"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793250299"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989514"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655768"},{"key":"ref19","first-page":"209","article-title":"Data mining, hypergraph transversals, and machine learning","author":"gunopulos","year":"1997","journal-title":"Symposium on Principles of Database Systems (PODS'97)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/373626.373713"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009796218281"},{"key":"ref3","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"agrawal","year":"1994","journal-title":"Proc of International Conference on Very Large Data Bases (VLDB)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59286-5_64"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80002-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276313"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021571501451"},{"key":"ref7","article-title":"Hypergraphs","volume":"45","author":"berge","year":"1989","journal-title":"North Holland Mathematical Library"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/507533.507537"},{"key":"ref9","article-title":"Mining all non-derivable frequent itemsets","author":"calders","year":"2002","journal-title":"Principles of Data Mining and Knowledge Discovery volume 2431 of Lecture Notes in Computer Science"},{"journal-title":"Foundations of Databases","year":"1995","author":"abiteboul","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/int.4550070703"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-349-7"},{"key":"ref21","article-title":"Discovery of high-dimentional inclusion dependencies (poster)","author":"koeller","year":"2003","journal-title":"International Conference on Data Engineering"},{"key":"ref24","first-page":"105","article-title":"Pincer search: A new algorithm for discovering the maximum frequent set","volume":"1377","author":"lin","year":"1998","journal-title":"Extending Database Technology"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/69.842267"},{"key":"ref26","first-page":"713","article-title":"Inclusion dependencies in database design","author":"mannila","year":"1986","journal-title":"International Conference on Data Engineering (ICDE'86)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/S0306-4379(01)00027-8"}],"event":{"name":"Third IEEE International Conference on Data Mining","acronym":"ICDM-03","location":"Melbourne, FL, USA"},"container-title":["Third IEEE International Conference on Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8854\/27998\/01250899.pdf?arnumber=1250899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T19:12:50Z","timestamp":1489432370000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250899\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/icdm.2003.1250899","relation":{},"subject":[]}}