{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T08:10:21Z","timestamp":1739088621662,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642010903"},{"type":"electronic","value":"9783642010910"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01091-0_12","type":"book-chapter","created":{"date-parts":[[2009,5,4]],"date-time":"2009-05-04T16:56:46Z","timestamp":1241456206000},"page":"265-296","source":"Crossref","is-referenced-by-count":1,"title":["Automated Incremental Building of Weighted Semantic Web Repository"],"prefix":"10.1007","author":[{"given":"Martin","family":"\u0158imn\u00e1\u010d","sequence":"first","affiliation":[]},{"given":"Roman","family":"\u0160p\u00e1nek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Raghavan, P.: Information retrieval algorithms: a survey. In: SODA 1997: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 11\u201318. Society for Industrial and Applied Mathematics (1997)","key":"12_CR1"},{"key":"12_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"A.N. Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"12_CR3","volume-title":"A Semantic Web Primer (Cooperative Information Systems)","author":"G. Antoniou","year":"2004","unstructured":"Antoniou, G., van Harmelen, F.: A Semantic Web Primer (Cooperative Information Systems). MIT Press, Cambridge (2004)"},{"unstructured":"Pivk, A.: Automatic ontology generation from web tabular structures. AI Communications (2005)","key":"12_CR4"},{"issue":"3","key":"12_CR5","first-page":"139","volume":"12","author":"P.A. Flach","year":"1999","unstructured":"Flach, P.A., Savnik, I.: Database dependency discovery: A machine learning approach. AI Communications\u00a012(3), 139\u2013160 (1999)","journal-title":"AI Communications"},{"unstructured":"Date, C.J.: An Introduction to Database Systems. Addison Wesley Longman (October 1999)","key":"12_CR6"},{"key":"12_CR7","first-page":"147","volume-title":"Proceedings of the CISIS 2007","author":"M. \u0158imn\u00e1\u010d","year":"2007","unstructured":"\u0158imn\u00e1\u010d, M.: Data structure estimation for rdf oriented repository building. In: Proceedings of the CISIS 2007, pp. 147\u2013154. IEEE Computer Society, Los Alamitos (2007)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-540-68234-9_39","volume-title":"The Semantic Web: Research and Applications","author":"B. Quilitz","year":"2008","unstructured":"Quilitz, B., Leser, U.: Querying distributed rdf data sources with sparql. In: Bechhofer, S., Hauswirth, M., Hoffmann, J., Koubarakis, M. (eds.) ESWC 2008. LNCS, vol.\u00a05021, pp. 524\u2013538. Springer, Heidelberg (2008)"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0022-0000(86)90015-2","volume":"33","author":"H. Mannila","year":"1986","unstructured":"Mannila, H., R\u00e4ith\u00e4, K.J.: Design by example: An applications of armstrong relations. Journal of computer and system sciences\u00a033, 129\u2013141 (1986)","journal-title":"Journal of computer and system sciences"},{"unstructured":"Mannila, H., R\u00e4ih\u00e4, K.J.: Dependency inference. In: Proc. of VLDB, pp. 155\u2013158 (1987)","key":"12_CR10"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0169-023X(94)90023-X","volume":"12","author":"H. Mannila","year":"1994","unstructured":"Mannila, H., R\u00e4ith\u00e4, K.J.: Algorithms for inferring functional dependencies from relations. Data & Knowledge Engineering\u00a012, 83\u201399 (1994)","journal-title":"Data & Knowledge Engineering"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/S0304-3975(02)00183-4","volume":"292","author":"T. Akutsu","year":"2003","unstructured":"Akutsu, T., Miyano, S., Kuhara, S.: A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis. Theoretical Computer Science\u00a0292, 481\u2013495 (2003)","journal-title":"Theoretical Computer Science"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-19488-6_140","volume-title":"Automata, Languages and Programming","author":"K. Simon","year":"1988","unstructured":"Simon, K.: On minimum flow and transitive reduction. In: Lepist\u00f6, T., Salomaa, A. (eds.) ICALP 1988. LNCS, vol.\u00a0317, pp. 535\u2013546. Springer, Heidelberg (1988)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/3-540-52292-1_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"K. Simon","year":"1990","unstructured":"Simon, K.: Finding a minimal transitive reduction in a strongly connected digraph within linear time. In: Nagl, M. (ed.) WG 1989. LNCS, vol.\u00a0411, pp. 245\u2013259. Springer, Heidelberg (1990)"},{"key":"12_CR15","first-page":"483","volume-title":"ADBIS 2002: Advances in databases and information systems","author":"C. Giannella","year":"2004","unstructured":"Giannella, C., Robertson, E.: On approximation measures for functional dependencies. In: ADBIS 2002: Advances in databases and information systems, pp. 483\u2013507. Elsevier, Amsterdam (2004)"},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/s007780100057","volume":"10","author":"E. Rahm","year":"2001","unstructured":"Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB Journal: Very Large Data Bases\u00a010(4), 334\u2013350 (2001)","journal-title":"VLDB Journal: Very Large Data Bases"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/11603412_5","volume-title":"Journal on Data Semantics IV","author":"P. Shvaiko","year":"2005","unstructured":"Shvaiko, P., Euzenat, J.: A survey of schema-based matching approaches. In: Spaccapietra, S. (ed.) Journal on Data Semantics IV. LNCS, vol.\u00a03730, pp. 146\u2013171. Springer, Heidelberg (2005)"},{"unstructured":"Mitra, P., Wiederhold, G., Jannink, J.: Semi-automatic integration of knowledge sources. In: Proc. of the 2nd Int. Conf. On Information FUSION 1999 (1999)","key":"12_CR18"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/3-540-36560-5_17","volume-title":"Web, Web-Services, and Database Systems","author":"H.-H. Do","year":"2003","unstructured":"Do, H.-H., Melnik, S., Rahm, E.: Comparison of schema matching evaluations. In: Chaudhri, A.B., Jeckle, M., Rahm, E., Unland, R. (eds.) NODe-WS 2002. LNCS, vol.\u00a02593, pp. 221\u2013237. Springer, Heidelberg (2003)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/543613.543644","volume-title":"PODS 2002: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems","author":"M. Lenzerini","year":"2002","unstructured":"Lenzerini, M.: Data integration: a theoretical perspective. In: PODS 2002: Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of Database Systems, pp. 233\u2013246. ACM Press, New York (2002)"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ipm.2006.10.014","volume":"43","author":"H. Nottelmann","year":"2007","unstructured":"Nottelmann, H., Straccia, U.: Information retrieval and machine learning for probabilistic schema matching. Information Processing and Management\u00a043, 552\u2013576 (2007)","journal-title":"Information Processing and Management"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.datak.2005.05.012","volume":"58","author":"X. Su","year":"2006","unstructured":"Su, X., Gulla, J.A.: An information retrieval approach to ontology mapping. Data Knowl. Eng.\u00a058(1), 47\u201369 (2006)","journal-title":"Data Knowl. Eng."},{"issue":"1-2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.ins.2004.02.013","volume":"169","author":"S. Yi","year":"2005","unstructured":"Yi, S., Huang, B., Chan, W.T.: Xml application schema matching using similarity measure and relaxation labeling. Inf. Sci.\u00a0169(1-2), 27\u201346 (2005)","journal-title":"Inf. Sci."},{"issue":"6","key":"12_CR24","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1016\/j.is.2006.09.002","volume":"32","author":"H.-H. Do","year":"2007","unstructured":"Do, H.-H., Rahm, E.: Matching large schemas: Approaches and evaluation. Inf. Syst.\u00a032(6), 857\u2013885 (2007)","journal-title":"Inf. Syst."},{"issue":"8","key":"12_CR25","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1016\/j.is.2005.01.003","volume":"31","author":"L. Xu","year":"2006","unstructured":"Xu, L., Embley, D.W.: A composite approach to automating direct and indirect schema mappings. Inf. Syst.\u00a031(8), 697\u2013732 (2006)","journal-title":"Inf. Syst."},{"unstructured":"Li, N., Mitchell, J.: A role-based trust-management framework. In: DARPA Information Survivability Conference and Exposition (DISCEX), Washington, D.C. (April 2003)","key":"12_CR26"},{"unstructured":"Basney, J., Nejdl, W., Olmedilla, D., Welch, V., Winslett, M.: Negotiating trust on the grid. In: 2nd WWW Workshop on Semantics in P2P and Grid Computing, New York, USA (May 2004)","key":"12_CR27"},{"doi-asserted-by":"crossref","unstructured":"Grandison, T., Sloman, M.: Survey of trust in internet applications. IEEE Communications Surveys\u00a03(4) (2000)","key":"12_CR28","DOI":"10.1109\/COMST.2000.5340804"},{"doi-asserted-by":"crossref","unstructured":"Damiani, E., di Vimercati, S.D.C., Paraboschi, S., Samarati, P., Violante, F.: A reputation-based approach for choosing reliable resources in peer-to-peer networks. In: Proceedings of ACM Conference on Computer and Communications Security, pp. 202\u2013216 (2002)","key":"12_CR29","DOI":"10.1145\/586110.586138"},{"issue":"2","key":"12_CR30","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10458-006-5952-x","volume":"12","author":"W.T.L. Teacy","year":"2006","unstructured":"Teacy, W.T.L., Patel, J., Jennings, N.R., Luck, M.: Travos: Trust and reputation in the context of inaccurate information sources. Autonomous Agents and Multi-Agent Systems\u00a012(2), 183\u2013198 (2006)","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"doi-asserted-by":"crossref","unstructured":"Lee, S., Sherwood, R., et al.: Cooperative peer groups in nice. In: IEEE Infocom, San Francisco, USA (2003)","key":"12_CR31","DOI":"10.1109\/INFCOM.2003.1208963"},{"doi-asserted-by":"crossref","unstructured":"Gupta, M., Judge, P., et al.: A reputation system for peer-to-peer networks. In: Thirteenth ACM International Workshop on Network and Operating Systems Support for Digital Audio and Video, Monterey, California (2003)","key":"12_CR32","DOI":"10.1145\/776322.776346"},{"doi-asserted-by":"crossref","unstructured":"Kamvar, S., Schlosser, M., et al.: The eigentrust algorithm for reputation management in p2p networks. In: WWW, Budapest, Hungary (2003)","key":"12_CR33","DOI":"10.1145\/775152.775242"},{"doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: Eigenrep: Reputation management in p2p networks. In: Proceedings of 12th International WWW Conference, pp. 640\u2013651 (2003)","key":"12_CR34","DOI":"10.1145\/775152.775242"},{"doi-asserted-by":"crossref","unstructured":"Sabater, J., Sierra, C.: Regret: A reputation model for gregarious societies. In: 4th Workshop on Deception, Fraud and Trust in Agetn Societies, Montreal, Canada (2001)","key":"12_CR35","DOI":"10.1145\/375735.376110"},{"doi-asserted-by":"crossref","unstructured":"Pujol, J., Sanguesa, R., et al.: Extracting reputation in multi agent systems by means of social network topology. In: First International Joint Conference on Autonomous Agents and Multi-Agent Systems, Bologna, Italy (2002)","key":"12_CR36","DOI":"10.1145\/544741.544853"},{"issue":"7","key":"12_CR37","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/71.780863","volume":"10","author":"U.V. Catalyurek","year":"1999","unstructured":"Catalyurek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems\u00a010(7), 673\u2013693 (1999)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"12_CR38","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, London (1980)"},{"key":"12_CR39","volume-title":"Robust incentive techniques for peer-to-peer networks","author":"M. Feldman","year":"2004","unstructured":"Feldman, M., Lai, K., Stoica, I., Chuang, J.: Robust incentive techniques for peer-to-peer networks. ACM Press, New York (2004)"},{"key":"12_CR40","volume-title":"Limited reputation sharing in P2P systems","author":"S. Marti","year":"2004","unstructured":"Marti, S., Garcia-Molina, H.: Limited reputation sharing in P2P systems. ACM Press, New York (2004)"},{"doi-asserted-by":"crossref","unstructured":"Maniatis, P., Roussopoulos, M., Giuli, T., Rosenthal, D., Baker, M., Muliadi, Y.: Preserving peer replicas by rate-limited sampled voting. Technical Report arXiv:cs.CR\/0303026, Stanford University (2003)","key":"12_CR41","DOI":"10.1145\/945449.945451"},{"unstructured":"Lai, K., Feldman, M., Stoica, I., Chuang, J.: Incentives for cooperation in peer-to-peer networks. In: Workshop on Economics of Peer-toPeer Systems (2003)","key":"12_CR42"}],"container-title":["Studies in Computational Intelligence","Foundations of Computational, IntelligenceVolume 6"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01091-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T07:46:22Z","timestamp":1739087182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01091-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010903","9783642010910"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01091-0_12","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2009]]}}}