{"title":"分布式数据库查询的一种表示和实现方法","authors":"S. V. Korotikov, V. A. Stapchuk","doi":"10.1109/APEIE.2000.913136","DOIUrl":null,"url":null,"abstract":"The problems of representation and implementation of queries to the distributed database (DDB) by the natural language are considered. One of the approaches of building of unplanned queries, on the basis of representation of conceptual model as the hypergraph, is described. The task of finding of the shortest path between sets of graph vertexes for optimal execution of query and some means's of its solution is defined.","PeriodicalId":184476,"journal":{"name":"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"One approach to representation and implementation of query to the distributed database\",\"authors\":\"S. V. Korotikov, V. A. Stapchuk\",\"doi\":\"10.1109/APEIE.2000.913136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problems of representation and implementation of queries to the distributed database (DDB) by the natural language are considered. One of the approaches of building of unplanned queries, on the basis of representation of conceptual model as the hypergraph, is described. The task of finding of the shortest path between sets of graph vertexes for optimal execution of query and some means's of its solution is defined.\",\"PeriodicalId\":184476,\"journal\":{\"name\":\"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat\",\"volume\":\"97 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APEIE.2000.913136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 5th International Conference on Actual Problems of Electronic Instrument Engineering Proceedings. APEIE-2000. Devoted to the 50th Anniversary of Novosibirsk State Technical University. Vol.1 (Cat","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APEIE.2000.913136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
One approach to representation and implementation of query to the distributed database
The problems of representation and implementation of queries to the distributed database (DDB) by the natural language are considered. One of the approaches of building of unplanned queries, on the basis of representation of conceptual model as the hypergraph, is described. The task of finding of the shortest path between sets of graph vertexes for optimal execution of query and some means's of its solution is defined.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
