{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:13:38Z","timestamp":1768871618629,"version":"3.49.0"},"reference-count":108,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T00:00:00Z","timestamp":1483747200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["652976"],"award-info":[{"award-number":["652976"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"973 Program","doi-asserted-by":"crossref","award":["2014CB340302"],"award-info":[{"award-number":["2014CB340302"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61133002"],"award-info":[{"award-number":["61133002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61421003"],"award-info":[{"award-number":["61421003"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/J015377\/1"],"award-info":[{"award-number":["EP\/J015377\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000266","name":"EPSRC","doi-asserted-by":"crossref","award":["EP\/M025268\/1"],"award-info":[{"award-number":["EP\/M025268\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Shenzhen Peacock Program","award":["1105100030834361"],"award-info":[{"award-number":["1105100030834361"]}]},{"DOI":"10.13039\/100012540","name":"Guangdong Innovative Research Team Program","doi-asserted-by":"crossref","award":["2011D005,"],"award-info":[{"award-number":["2011D005,"]}],"id":[{"id":"10.13039\/100012540","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Foundation for Innovative Research Groups of NSFC, Beijing Advanced Innovation Center for Big Data and Brain Computing, Shenzhen Science and Technology Fund","award":["JCYJ20150529164656096"],"award-info":[{"award-number":["JCYJ20150529164656096"]}]},{"name":"NSF III","award":["1302212"],"award-info":[{"award-number":["1302212"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s41019-016-0025-x","type":"journal-article","created":{"date-parts":[[2017,1,7]],"date-time":"2017-01-07T10:57:17Z","timestamp":1483786637000},"page":"36-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Big Graph Analyses: From Queries to Dependencies and Association Rules"],"prefix":"10.1007","volume":"2","author":[{"given":"Wenfei","family":"Fan","sequence":"first","affiliation":[]},{"given":"Chunming","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,7]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal S, Mozafari B, Panda A, Milner H, Madden S, Stoica I (2013) BlinkDB: queries with bounded errors and bounded response times on very large data. In: EuroSys, pp 29\u201342","DOI":"10.1145\/2465351.2465355"},{"key":"25_CR2","unstructured":"Akhtar W, Cort\u00e9s-Calabuig A, Paredaens J (2010) Constraints in RDF. In: SDKB, pp 23\u201339"},{"key":"25_CR3","unstructured":"Amer-Yahia S, Lakshmanan LVS, Yu C (2009) Socialscope: enabling information discovery on social content sites. In: CIDR"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Arenas M, Bertossi L, Chomicki J (1999) Consistent query answers in inconsistent databases. In: PODS, pp 68\u201379","DOI":"10.1145\/303976.303983"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Babcock B, Chaudhuri S, Das G (2003) Dynamic sample selection for approximate query processing. In: SIGMOD","DOI":"10.1145\/872757.872822"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Balc\u00e1zar JL, Bonchi F, Gionis A, Sebag M (eds.) (2010) Machine Learning and Knowledge Discovery in Databases, Proceedings, Part I, LNCS, vol. 6321. Springer","DOI":"10.1007\/978-3-642-15883-4"},{"key":"25_CR7","unstructured":"Bapna R, Umyarov A (2012) Do your online friends make you pay? A randomized field experiment in an online music social network. NBER working paper"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Bohannon P, Fan W, Flaster M, Rastogi R (2005) A cost-based model and effective heuristic for repairing constraints by value modification. In: SIGMOD, pp 143\u2013154","DOI":"10.1145\/1066157.1066175"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Boldi P, Vigna S (2004) The Webgraph framework I: compression techniques. In: WWW","DOI":"10.1145\/988672.988752"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S (2008) What is frequent in a single graph? In: PAKDD","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Br\u00f6cheler M, Pugliese A, Subrahmanian VS (2011) A budget-based algorithm for efficient subgraph matching on huge networks. In: ICDE workshops","DOI":"10.1109\/ICDEW.2011.5767618"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Calvanese D, Fischl W, Pichler R, Sallinger E, \u0160imkus M (2014) Capturing relational schemas and functional dependencies in RDFS. In: AAAI","DOI":"10.1609\/aaai.v28i1.8867"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Cao Y, Fan W (2016) An effective syntax for bounded relational queries. In: SIGMOD","DOI":"10.1145\/2882903.2882942"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Cao Y, Fan W, Geerts F, Lu P (2016) Bounded query rewriting using views. In: PODS","DOI":"10.1145\/2902251.2902294"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Cao Y, Fan W, Huai J, Huang R (2015) Making pattern queries bounded in big graphs. In: ICDE","DOI":"10.1109\/ICDE.2015.7113281"},{"key":"25_CR16","unstructured":"Cao Y, Fan W, Tian C, Wang Y (2015) Effective techniques for CDR queries: technical report for Huawei technologies"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Cao Y, Fan W, Yu W (2014) Bounded conjunctive queries. PVLDB, pp 1231\u20131242","DOI":"10.14778\/2732977.2732996"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Catania B, Guerrini G (2013) Approximate queries with adaptive processing. In: Advanced query processing. Springer, Berlin","DOI":"10.1007\/978-3-642-28323-9_10"},{"key":"25_CR19","unstructured":"Cort\u00e9s-Calabuig A, Paredaens J (2012) Semantics of constraints in RDFS. In: AMW, pp 75\u201390"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Dong X, Gabrilovich E, Heitz G, Horn W, Lao N, Murphy K, Strohmann T, Sun S, Zhang W (2014) Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: KDD","DOI":"10.1145\/2623330.2623623"},{"key":"25_CR21","unstructured":"Dylla M, Sozio M, Theobald M (2011) Resolving temporal conflicts in inconsistent RDF knowledge bases. In: BTW"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Fan W, Geerts F, Cao Y, Deng T, Lu P (2015) Querying big data by accessing small data. In: PODS","DOI":"10.1145\/2745754.2745771"},{"issue":"1","key":"25_CR23","first-page":"6","volume":"33","author":"W Fan","year":"2008","unstructured":"Fan W, Geerts F, Jia X, Kementsietsidis A (2008) Conditional functional dependencies for capturing data inconsistencies. ACM Trans Database Syst 33(1):6","journal-title":"ACM Trans Database Syst"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Fan W, Geerts F, Libkin L (2014) On scale independence for querying big data. In: PODS, pp 51\u201362","DOI":"10.1145\/2594538.2594551"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Fan W, Li J, Wang X, Wu Y (2012) Query preserving graph compression. In: SIGMOD, pp 157\u2013168","DOI":"10.1145\/2213836.2213855"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Fan W, Wang X, Wu Y (2014) Distributed graph simulation: impossibility and possibility. PVLDB","DOI":"10.14778\/2732977.2732983"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Fan W, Wang X, Wu Y (2014) Querying big graphs within bounded resources. In: SIGMOD, pp 301\u2013312","DOI":"10.1145\/2588555.2610513"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Fan W, Wu Y, Xu J (2016) Adding counting quantifiers to graph patterns. In: SIGMOD","DOI":"10.1145\/2882903.2882937"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Fan W, Wu Y, Xu J (2016) Functional dependencies for graphs. In: SIGMOD","DOI":"10.1145\/2882903.2915232"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Fan W, Xu J, Wu Y, Jiang J, Cao Y, Tian C, Yu W, Zhang B, Zheng Z (2017) Parallelizing sequential graph computations. In: SIGMOD","DOI":"10.1145\/3035918.3035942"},{"key":"25_CR31","doi-asserted-by":"crossref","unstructured":"Gal\u00e1rraga LA, Teflioudi C, Hose K, Suchanek F (2013) AMIE: association rule mining under incomplete evidence in ontological knowledge bases. In: WWW","DOI":"10.1145\/2488388.2488425"},{"key":"25_CR32","unstructured":"Gallego MA, Fern\u00e1ndez JD, Mart\u00ednez-Prieto MA, de\u00a0la Fuente P (2011) An empirical study of real-world SPARQL queries. In: USEWOD workshop"},{"key":"25_CR33","unstructured":"Gartner (2007) \u2019Dirty data\u2019 is a business problem, not an IT problem. http:\/\/www.gartner.com\/newsroom\/id\/501733"},{"key":"25_CR34","unstructured":"Giraph: http:\/\/giraph.apache.org\/"},{"key":"25_CR35","doi-asserted-by":"crossref","unstructured":"Gollapudi S, Sharma A (2009) An axiomatic approach for result diversification. In: WWW, pp 381\u2013390","DOI":"10.1145\/1526709.1526761"},{"key":"25_CR36","unstructured":"Gonzalez JE, Xin RS, Dave A, Crankshaw D, Franklin MJ, Stoica I (2014) GraphX: graph processing in a distributed dataflow framework. In: OSDI"},{"key":"25_CR37","unstructured":"Grujic I, Bogdanovic-Dinic S, Stoimenov L (2014) Collecting and analyzing data from e-government Facebook pages. In: ICT Innovations"},{"key":"25_CR38","doi-asserted-by":"crossref","unstructured":"Gubichev A, Bedathur SJ, Seufert S, Weikum G (2010) Fast and accurate estimation of shortest paths in large graphs. In: CIKM","DOI":"10.1145\/1871437.1871503"},{"key":"25_CR39","doi-asserted-by":"crossref","unstructured":"Haenni R, Lehmann N (2002) Resource bounded and anytime approximation of belief function computations. IJAR 31","DOI":"10.1016\/S0888-613X(02)00074-9"},{"key":"25_CR40","doi-asserted-by":"crossref","unstructured":"Hellings J, Gyssens M, Paredaens J, Wu Y (2014) Implication and axiomatization of functional constraints on patterns with an application to the RDF data model. In: FoIKS","DOI":"10.1007\/978-3-319-04939-7_12"},{"key":"25_CR41","doi-asserted-by":"crossref","unstructured":"Henzinger MR, Henzinger T, Kopke P (1995) Computing simulations on finite and infinite graphs. In: FOCS","DOI":"10.1109\/SFCS.1995.492576"},{"key":"25_CR42","doi-asserted-by":"crossref","unstructured":"He B, Zou L, Zhao D (2014) Using conditional functional dependency to discover abnormal data in RDF graphs. In: SWIM, pp 1\u20137","DOI":"10.1145\/2630602.2630605"},{"key":"25_CR43","doi-asserted-by":"publisher","unstructured":"Huang S, Li Q, Hitzler P (2012) Reasoning with inconsistencies in hybrid MKNF knowledge bases. Logic J IGPL. doi: 10.1093\/jigpal\/jzs043","DOI":"10.1093\/jigpal\/jzs043"},{"key":"25_CR44","unstructured":"IMDb: http:\/\/www.imdb.com\/stats\/search\/"},{"key":"25_CR45","doi-asserted-by":"crossref","unstructured":"Karloff HJ, Suri S, Vassilvitskii S (2010) A model of computation for MapReduce. In: SODA, pp 938\u2013948","DOI":"10.1137\/1.9781611973075.76"},{"key":"25_CR46","unstructured":"Karp RM, Ramachandran V (1988) A survey of parallel algorithms for shared-memory machines. Tech. Rep. UCB\/CSD-88-408, EECS Department, University of California, Berkeley . http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/1988\/5865.html"},{"key":"25_CR47","doi-asserted-by":"crossref","unstructured":"Ke Y, Cheng J, Ng W (2006) Mining quantitative correlated patterns using an information-theoretic approach. In: SIGKDD","DOI":"10.1145\/1150402.1150430"},{"key":"25_CR48","unstructured":"Korn F, Labrinidis A, Kotidis Y, Faloutsos C (1998) Ratio rules: A new paradigm for fast, quantifiable data mining. In: VLDB"},{"key":"25_CR49","doi-asserted-by":"crossref","unstructured":"Lausen G, Meier M, Schmidt M (2008) SPARQLing constraints for RDF. In: EDBT, ACM, pp 499\u2013509","DOI":"10.1145\/1353343.1353404"},{"key":"25_CR50","doi-asserted-by":"crossref","unstructured":"Liptchinsky V, Satzger B, Zabolotnyi R, Dustdar S (2013) Expressive languages for selecting groups from graph-structured data. In: WWW","DOI":"10.1145\/2488388.2488455"},{"issue":"1","key":"25_CR51","first-page":"4","volume":"39","author":"S Ma","year":"2014","unstructured":"Ma S, Cao Y, Fan W, Huai J, Wo T (2014) Strong simulation: capturing topology in graph pattern matching. ACM Trans Database Syst 39(1):4","journal-title":"ACM Trans Database Syst"},{"key":"25_CR52","doi-asserted-by":"crossref","unstructured":"Malewicz G, Austern MH, Bik AJC, Dehnert JC, Horn I, Leiser N, Czajkowski G (2010) Pregel: a system for large-scale graph processing. In: SIGMOD","DOI":"10.1145\/1807167.1807184"},{"key":"25_CR53","unstructured":"Mart\u0131n M, Gutierrez C, Wood P (2011) SNQL: a social networks query and transformation language. In: AMW"},{"key":"25_CR54","doi-asserted-by":"crossref","unstructured":"Navlakha S, Rastogi R, Shrivastava N (2008) Graph summarization with bounded error. In: SIGMOD","DOI":"10.1145\/1376616.1376661"},{"key":"25_CR55","doi-asserted-by":"crossref","unstructured":"Ogaard K, Roy H, Kase S, Nagi R, Sambhoos K, Sudit M (2013) Discovering patterns in social networks with graph matching algorithms. In: SBP","DOI":"10.1007\/978-3-642-37210-0_37"},{"key":"25_CR56","doi-asserted-by":"crossref","unstructured":"Qin L, Yu JX, Chang L, Cheng H, Zhang C, Lin X (2014) Scalable big graph processing in mapreduce. In: SIGMOD","DOI":"10.1145\/2588555.2593661"},{"key":"25_CR57","unstructured":"Qun C, Lim A, Ong KW (2003) D(k)-index: an adaptive structural summary for graph-structured data. In: SIGMOD"},{"key":"25_CR58","volume-title":"Database management systems","author":"R Ramakrishnan","year":"2000","unstructured":"Ramakrishnan R, Gehrke J (2000) Database management systems. McGraw-Hill Higher Education, New York"},{"key":"25_CR59","unstructured":"Rula A, Zaveri A (2014) Methodology for assessment of linked data quality. In: LDQ@SEMANTiCS"},{"key":"25_CR60","doi-asserted-by":"crossref","unstructured":"Schmitz C, Hotho A, J\u00e4schke R, Stumme G (2006) Mining association rules in folksonomies. In: Data science and classification, pp 261\u2013270","DOI":"10.1007\/3-540-34416-0_28"},{"key":"25_CR61","doi-asserted-by":"crossref","unstructured":"Shang H, Zhang Y, Lin X, Yu JX (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. In: PVLDB","DOI":"10.14778\/1453856.1453899"},{"key":"25_CR62","unstructured":"Smith C (2013) Twitter users say they use the site to influence their shopping decisions. Business Insider Intelligence"},{"key":"25_CR63","doi-asserted-by":"crossref","unstructured":"Srikant R, Agrawal R (1996) Mining quantitative association rules in large relational tables. In: SIGMOD","DOI":"10.1145\/233269.233311"},{"key":"25_CR64","doi-asserted-by":"crossref","unstructured":"Stern RT, Puzis R, Felner A (2011) Potential search: a bounded-cost search algorithm. In: ICAPS","DOI":"10.1609\/icaps.v21i1.13455"},{"key":"25_CR65","doi-asserted-by":"crossref","unstructured":"Tao Y, Lin W, Xiao X (2013) Minimal mapreduce algorithms. In: SIGMOD","DOI":"10.1145\/2463676.2463719"},{"key":"25_CR66","doi-asserted-by":"crossref","unstructured":"Thayer JT, Stern R, Felner A, Ruml W (2012) Faster bounded-cost search using inadmissible estimates. In: ICAPS","DOI":"10.1609\/icaps.v22i1.13514"},{"key":"25_CR67","unstructured":"Wikibon (2012) A comprehensive list of big data statistics. http:\/\/wikibon.org\/blog\/big-data-statistics\/"},{"key":"25_CR68","doi-asserted-by":"crossref","unstructured":"Xin D, Cheng H, Yan X, Han J (2006) Extracting redundancy-aware top-k patterns. In: KDD","DOI":"10.1145\/1150402.1150452"},{"key":"25_CR69","doi-asserted-by":"crossref","unstructured":"Yu Y, Heflin J (2011) Extending functional dependency to detect abnormal data in RDF graphs. In: ISWC","DOI":"10.1007\/978-3-642-25073-6_50"},{"key":"25_CR70","unstructured":"Zilberstein S, Charpillet F, Chassaing P, et\u00a0al (1999) Real-time problem-solving with contract algorithms. In: IJCAI, pp 1008\u20131015"},{"key":"25_CR71","volume-title":"Foundations of databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul S, Hull R, Vianu V (1995) Foundations of databases. Addison-Wesley, Boston"},{"issue":"2","key":"25_CR72","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. SIGMOD Rec 22(2):207\u2013216","journal-title":"SIGMOD Rec"},{"issue":"4","key":"25_CR73","first-page":"33","volume":"32","author":"S Amer-Yahia","year":"2009","unstructured":"Amer-Yahia S, Lakshmanan LV, Vassilvitskii S, Yu C (2009) Battling predictability and overconcentration in recommender systems. IEEE Data Eng Bull 32(4):33\u201340","journal-title":"IEEE Data Eng Bull"},{"key":"25_CR74","first-page":"2002","volume":"37","author":"H Blau","year":"2002","unstructured":"Blau H, Immerman N, Jensen D (2002) A visual language for querying and updating graphs. Univ Mass Amherst Comput Sci Tech Rep 37:2002","journal-title":"Univ Mass Amherst Comput Sci Tech Rep"},{"issue":"5","key":"25_CR75","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen E, Halperin E, Kaplan H, Zwick U (2003) Reachability and distance queries via 2-hop labels. SICOMP 32(5):1338\u20131355","journal-title":"SICOMP"},{"issue":"10","key":"25_CR76","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub) graph isomorphism algorithm for matching large graphs. TPAMI 26(10):1367\u20131372","journal-title":"TPAMI"},{"issue":"1\u20133","key":"25_CR77","first-page":"1","volume":"4","author":"G Cormode","year":"2012","unstructured":"Cormode G, Garofalakis M, Haas PJ, Jermaine C (2012) Synopses for massive data: Samples, histograms, wavelets, sketches. FTDB 4(1\u20133):1\u2013294","journal-title":"FTDB"},{"issue":"2","key":"25_CR78","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/2602136","volume":"39","author":"T Deng","year":"2014","unstructured":"Deng T, Fan W (2014) On the complexity of query result diversification. ACM Trans Database Syst 39(2):15","journal-title":"ACM Trans Database Syst"},{"key":"25_CR79","unstructured":"Eckerson WW (2002) Data quality and the bottom line: Achieving business success through a commitment to high quality data. Tech rep, The Data Warehousing Institute"},{"issue":"7","key":"25_CR80","first-page":"517","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P (2014) GRAMI: frequent subgraph and pattern mining in a single large graph. PVLDB 7(7):517\u2013528","journal-title":"PVLDB"},{"issue":"1","key":"25_CR81","first-page":"1161","volume":"3","author":"W Fan","year":"2010","unstructured":"Fan W, Li J, Ma S, Tang N, Wu Y, Wu Y (2010) Graph pattern matching: from intractability to polynomial time. PVLDB 3(1):1161\u20131172","journal-title":"PVLDB"},{"issue":"5","key":"25_CR82","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1109\/TKDE.2010.154","volume":"23","author":"W Fan","year":"2011","unstructured":"Fan W, Geerts F, Li J, Xiong M (2011) Discovering conditional functional dependencies. IEEE Trans Data Knowl Eng 23(5):683\u2013698","journal-title":"IEEE Trans Data Knowl Eng"},{"issue":"2","key":"25_CR83","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s00778-011-0253-7","volume":"21","author":"W Fan","year":"2012","unstructured":"Fan W, Li J, Ma S, Tang N, Yu W (2012) Towards certain fixes with editing rules and master data. VLDB J 21(2):213\u2013238","journal-title":"VLDB J"},{"issue":"11","key":"25_CR84","first-page":"1304","volume":"5","author":"W Fan","year":"2012","unstructured":"Fan W, Wang X, Wu Y (2012) Performance guarantees for distributed reachability queries. PVLDB 5(11):1304\u20131315","journal-title":"PVLDB"},{"issue":"8","key":"25_CR85","first-page":"577","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan W, Geerts F, Neven F (2013) Making queries tractable on big data with preprocessing. PVLDB 6(8):577\u2013588","journal-title":"PVLDB"},{"issue":"13","key":"25_CR86","first-page":"1510","volume":"6","author":"W Fan","year":"2013","unstructured":"Fan W, Wang X, Wu Y (2013) Diversified top-k graph pattern matching. PVLDB 6(13):1510\u20131521","journal-title":"PVLDB"},{"issue":"3","key":"25_CR87","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/2854006.2854008","volume":"44","author":"W Fan","year":"2015","unstructured":"Fan W (2015) Data quality: from theory to practice. SIGMOD Rec 44(3):7\u201318","journal-title":"SIGMOD Rec"},{"issue":"12","key":"25_CR88","first-page":"1590","volume":"8","author":"W Fan","year":"2015","unstructured":"Fan W, Fan Z, Tian C, Dong XL (2015) Keys for graphs. PVLDB 8(12):1590\u20131601","journal-title":"PVLDB"},{"issue":"12","key":"25_CR89","first-page":"1502","volume":"8","author":"W Fan","year":"2015","unstructured":"Fan W, Wang X, Wu Y, Xu J (2015) Association rules with graph patterns. PVLDB 8(12):1502\u20131513","journal-title":"PVLDB"},{"issue":"2","key":"25_CR90","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/TKDE.2015.2429138","volume":"28","author":"W Fan","year":"2016","unstructured":"Fan W, Wang X, Wu Y (2016) Answering pattern queries using views. IEEE Trans Knowl Data Eng 28(2):326\u2013341","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"25_CR91","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01892-3","volume-title":"Foundations of data quality management","author":"W Fan","year":"2012","unstructured":"Fan W, Geerts F (2012) Foundations of data quality management. Morgan & Claypool Publishers, San Rafael"},{"issue":"5","key":"25_CR92","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s11390-014-1473-2","volume":"29","author":"W Fan","year":"2014","unstructured":"Fan W, Huai J (2014) Querying big data: bridging theory and practice. J Comput Sci Technol 29(5):849\u2013869","journal-title":"J Comput Sci Technol"},{"issue":"4","key":"25_CR93","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.socnet.2010.06.003","volume":"34","author":"RW Faris","year":"2013","unstructured":"Faris RW, Ennett ST (2013) Adolescent aggression: the role of peer group status motives, peer aggression, and group characteristics. Soc Netw 34(4):371\u2013378","journal-title":"Soc Netw"},{"key":"25_CR94","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to parallel computation: P-completeness theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw R, Hoover HJ, Ruzzo WL (1995) Limits to parallel computation: P-completeness theory. Oxford University Press, Oxford"},{"issue":"2","key":"25_CR95","doi-asserted-by":"crossref","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 (1999) TANE: an efficient algorithm for discovering functional and approximate dependencies. Comput J 42(2):100\u2013111","journal-title":"Comput J"},{"issue":"01","key":"25_CR96","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang C, Coenen F, Zito M (2013) A survey of frequent subgraph mining algorithms. Knowl Eng Rev 28(01):75\u2013105","journal-title":"Knowl Eng Rev"},{"key":"25_CR97","unstructured":"Ley C, Linse B, Poppe O (2010) SPARQLog: SPARQL with rules and quantification. A model-based perspective p, semantic web information management, p 341"},{"key":"25_CR98","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1023\/A:1013284820704","volume":"6","author":"W Lin","year":"2000","unstructured":"Lin W, Alvarez SA, Ruiz C (2000) Collaborative recommendation via adaptive association rule mining. Data Min Knowl Discov 6:83\u2013105","journal-title":"Data Min Knowl Discov"},{"issue":"8","key":"25_CR99","first-page":"716","volume":"5","author":"Y Low","year":"2012","unstructured":"Low Y, Gonzalez J, Kyrola A, Bickson D, Guestrin C, Hellerstein JM (2012) Distributed GraphLab: a framework for machine learning in the cloud. PVLDB 5(8):716\u2013727","journal-title":"PVLDB"},{"issue":"6","key":"25_CR100","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc L, Zhou T (2011) Link prediction in complex networks: a survey. Phys A 390(6):1150\u20131170","journal-title":"Phys A"},{"key":"25_CR101","unstructured":"Nielsen global online consumer survey. http:\/\/www.nielsen.com\/content\/dam\/corporate\/us\/en\/newswire\/uploads\/2009\/07\/pr_global-study_07709"},{"key":"25_CR102","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) Computational complexity. Addison-Wesley, Boston"},{"issue":"5","key":"25_CR103","first-page":"425","volume":"14","author":"C Romero","year":"2004","unstructured":"Romero C, Ventura S, De Bra P (2004) Knowledge discovery with genetic programming for providing feedback to courseware authors. UMUAI 14(5):425\u2013464","journal-title":"UMUAI"},{"issue":"7","key":"25_CR104","first-page":"193","volume":"7","author":"Y Tian","year":"2013","unstructured":"Tian Y, Balmin A, Corsten SA, Shirish Tatikonda JM (2013) From \u2018think like a vertex\u2019 to \u2018think like a graph\u2019. PVLDB 7(7):193\u2013204","journal-title":"PVLDB"},{"key":"25_CR105","unstructured":"Trinity. http:\/\/research.microsoft.com\/en-us\/projects\/trinity\/"},{"issue":"14","key":"25_CR106","first-page":"1981","volume":"7","author":"D Yan","year":"2014","unstructured":"Yan D, Cheng J, Lu Y, Ng W (2014) Blogel: a block-centric framework for distributed computation on real-world graphs. PVLDB 7(14):1981\u20131992","journal-title":"PVLDB"},{"key":"25_CR107","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-46027-6","volume-title":"Association rule mining: models and algorithms","author":"C Zhang","year":"2002","unstructured":"Zhang C, Zhang S (2002) Association rule mining: models and algorithms. Springer, Berlin"},{"issue":"3","key":"25_CR108","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. AI Mag 17(3):73","journal-title":"AI Mag"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0025-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41019-016-0025-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-016-0025-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T16:21:11Z","timestamp":1692634871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41019-016-0025-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,7]]},"references-count":108,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["25"],"URL":"https:\/\/doi.org\/10.1007\/s41019-016-0025-x","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,7]]}}}