{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:29Z","timestamp":1698127829993},"reference-count":26,"publisher":"Wiley","issue":"13","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":5558,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1992,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the deductive database, a large number of query processing techniques has been proposed for the efficient processing of a large amount of data. Several deductive databases actually were proposed based on those techniques. There are only few cases among those, however, where such a system is applied to the practical problem. Consequently, it is not clear to what type of actual problems the deductive database can be applied.<\/jats:p><jats:p>In the CAD system, the \u201cindirect\u201d and \u201cconditional\u201d connection relations among components must be specified to utilize the design diagram more efficiently. It is proposed that the techniques of the deductive database can effectively be applied to such a problem to determine efficiently the connection relations. A prototype system was constructed to demonstrate the idea. The prototype is applied to a practical problem and the performance is evaluated. It is shown that the deductive database can effectively be applied to the forementioned problem.<\/jats:p><jats:p>In the course of this experiment, several observations are made concerning the realization of the query processing method in the deductive database. This paper outlines the constructed prototype system and discusses the result of evaluation. The range of application for the deductive database as well as the practical usefulness are discussed.<\/jats:p>","DOI":"10.1002\/scj.4690231302","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T22:44:20Z","timestamp":1183848260000},"page":"15-27","source":"Crossref","is-referenced-by-count":1,"title":["Evaluation of a deductive database system for CAD applications"],"prefix":"10.1002","volume":"23","author":[{"given":"Toshihisa","family":"Takagi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahiko","family":"Suzuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susumu","family":"Goto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kazuo","family":"Ushijima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Toward a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming (J. Minker","author":"Apt K. R.","year":"1988"},{"key":"e_1_2_1_3_2","volume-title":"Efficient bottom\u2010up computation for stratified databases","author":"Balbin I.","year":"1987"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/B978-0-934613-40-8.50016-6","volume-title":"Performance evaluation of data intensive logic programs. Foundations of Deductive Databases and Logic Programming (J. Minker","author":"Bancilhon F.","year":"1988"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"C.Beeri S.Naqvi R.Ramakrishnan O.ShmueliandS.Tsur.Sets and Negation in a Logic Database Language (LDL 1). Proc. 6th ACM PODS pp.21\u201337 San Diego CA (1987).","DOI":"10.1145\/28659.28662"},{"key":"e_1_2_1_6_2","doi-asserted-by":"crossref","unstructured":"C.BeeriandR.Ramakrishnan.On the Power of Magic. Proc. 6th ACM PODS pp.269\u2013283 San Diego CA (1987).","DOI":"10.1145\/28659.28689"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"F.Bry.Logic programming as constructivism: A formalization and its application to databases. Proc. 8th ACM PODS pp.34\u201350 Philadelphia PA (1989).","DOI":"10.1145\/73721.73725"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"e_1_2_1_9_2","unstructured":"D.Kemp K.Ramamohanarao I.BalbinandK.Meenakshi.Propagating Constraints in Recursive Deductive Databases. Proc. NACLP pp.981\u2013998 Cleveland OH (1989)."},{"key":"e_1_2_1_10_2","unstructured":"D.Kemp K.RamamohanaraoandZ.Somogyi.RightLeftandMulti\u2010Linear Rule Transformations that Maintain Context Information. Proc. Far East Workshop on Future Database Systems pp.38\u201352 Melbourne Australia (1990)."},{"key":"e_1_2_1_11_2","unstructured":"J. M.KerisitandJ. M.Pugin.Efficient Query Answering on Stratified Databases. Proc. Int. Conf. on Fifth Generation Computer Systems pp.719\u2013726 Tokyo (1988)."},{"key":"e_1_2_1_12_2","doi-asserted-by":"crossref","unstructured":"N.Miyazaki.Distribution of Selections: The Missing Link between Strategies for Relational Databases and Deductive Databases. Proc. DOOD '89 pp.130\u2013149 Kyoto (1989).","DOI":"10.1016\/B978-0-444-88433-6.50013-7"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"K.Morris J. D.Ullman andA. V.Gelder.Design Overview of the NAIL! System. Proc. 3rd Int. Conf. on Logic Programming pp.554\u2013568 London (1986).","DOI":"10.1007\/3-540-16492-8_104"},{"key":"e_1_2_1_14_2","doi-asserted-by":"crossref","unstructured":"I.Mumick S.FinkelsteinandH.Pirahesh.Magic is Relevant. Proc. ACM SIGMOD pp.247\u2013258 Atlantic City NJ (1990).","DOI":"10.1145\/93605.98734"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"I.Mumick S.Finkelstein H.PiraheshandR.Ramakrishnan.Magic Conditions. Proc. 9th ACM PODS pp.314\u2013330 Nashville TN (1990).","DOI":"10.1145\/298514.298584"},{"key":"e_1_2_1_16_2","doi-asserted-by":"crossref","unstructured":"J. F.Naughton.One\u2010Sided Recursions. Proc. 6th ACM PODS pp.340\u2013348 San Diego CA (1987).","DOI":"10.1145\/28659.28695"},{"key":"e_1_2_1_17_2","doi-asserted-by":"crossref","unstructured":"J. F.Naughton.Compiling Separable Recursions. Proc. ACM SIGMOD pp.312\u2013319 Chicago IL (1988).","DOI":"10.1145\/971701.50240"},{"key":"e_1_2_1_18_2","first-page":"69","volume-title":"Minimizing function\u2010free recursive inference rules","author":"Naughton J. F.","year":"1989"},{"key":"e_1_2_1_19_2","first-page":"235","volume-title":"Efficient Evaluation of Right\u2010, Left\u2010, and Multi\u2010Linear Rules","author":"Naughton J. F.","year":"1989"},{"key":"e_1_2_1_20_2","unstructured":"J. F.Naughton R.Ramakrishnan Y.Sagiv andJ. D.Ullman.Argument Reduction by Factoring. Proc. VLDB '89 pp.173\u2013182 Amsterdam (1989)."},{"key":"e_1_2_1_21_2","unstructured":"T.Suzuki T.TakagiandK.Ushijima.Efficient Bottom\u2010Up Evaluation of Negative Closed Queries on Stratified Databases. Proc. Advanced Database System Symposium '89 pp.143\u2013150 Kyoto (1989)."},{"issue":"2","key":"e_1_2_1_22_2","first-page":"206","article-title":"Efficient processing of negative query and closed query in stratified database using vertical index and magic set method","volume":"32","author":"Suzuki T.","year":"1991","journal-title":"Trans. Inf. Proc. Soc., Japan"},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","unstructured":"D.SaccaandC.Zaniolo.The Generalized Counting Methods for Recursive Logic Queries. Proc. of First International Conference on Data Theory pp.31\u201353 Rome (1986).","DOI":"10.1007\/3-540-17187-8_28"},{"key":"e_1_2_1_24_2","unstructured":"F.Tsutsumi T.TakagiandK.Ushijima.An Effective Program Transformation of Logical Recursive Queries in Deductive Databases. Proc. Far East Workshop on Future Database Systems pp.13\u201325 Melbourne (1990)."},{"key":"e_1_2_1_25_2","volume-title":"Principles of Database and Knowledgebase Systems","author":"Ullman J. D.","year":"1989"},{"key":"e_1_2_1_26_2","unstructured":"J.Vaghani K.RamamohanaraoandD.Kemp.Design Overview of Aditi: A Deductive Database System. Proc. Far East Workshop on Future Database Systems pp.202\u2013216 Melbourne (1990)."},{"key":"e_1_2_1_27_2","first-page":"135","volume-title":"Recursive Query Processing: Fundamental Algorithms and the DedGin System","author":"Vieille L.","year":"1988"}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690231302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690231302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:19:41Z","timestamp":1698085181000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690231302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":26,"journal-issue":{"issue":"13","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["10.1002\/scj.4690231302"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690231302","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"value":"0882-1666","type":"print"},{"value":"1520-684X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]}}}