{"title":"在中介系统中具有结果缓存的布尔查询处理","authors":"Jae-Heon Cheong, Sang-goo Lee","doi":"10.1109/ADL.2000.848392","DOIUrl":null,"url":null,"abstract":"A mediator system is a kind of meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator system are geographically distributed, its performance is mainly influenced by data transmission time between the mediator and its collections. Existing mediator systems employ a result cache that is composed of the results of previously issued queries to reduce this transmission time. However, these systems do not support a general Boolean query model but only simple ones such as a conjunctive query or a single keyword query, etc. In this paper, we propose a new method to efficiently process general Boolean queries using a result cache for mediator systems. A way of semantically partitioning the given result cache in order to reduce the complexity of inference is also presented.","PeriodicalId":426762,"journal":{"name":"Proceedings IEEE Advances in Digital Libraries 2000","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Boolean query processing with a result cache in mediator systems\",\"authors\":\"Jae-Heon Cheong, Sang-goo Lee\",\"doi\":\"10.1109/ADL.2000.848392\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A mediator system is a kind of meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator system are geographically distributed, its performance is mainly influenced by data transmission time between the mediator and its collections. Existing mediator systems employ a result cache that is composed of the results of previously issued queries to reduce this transmission time. However, these systems do not support a general Boolean query model but only simple ones such as a conjunctive query or a single keyword query, etc. In this paper, we propose a new method to efficiently process general Boolean queries using a result cache for mediator systems. A way of semantically partitioning the given result cache in order to reduce the complexity of inference is also presented.\",\"PeriodicalId\":426762,\"journal\":{\"name\":\"Proceedings IEEE Advances in Digital Libraries 2000\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Advances in Digital Libraries 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ADL.2000.848392\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE Advances in Digital Libraries 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ADL.2000.848392","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Boolean query processing with a result cache in mediator systems
A mediator system is a kind of meta-search engine that provides a seamlessly integrated search service for diverse search engines (collections). Since collections of a mediator system are geographically distributed, its performance is mainly influenced by data transmission time between the mediator and its collections. Existing mediator systems employ a result cache that is composed of the results of previously issued queries to reduce this transmission time. However, these systems do not support a general Boolean query model but only simple ones such as a conjunctive query or a single keyword query, etc. In this paper, we propose a new method to efficiently process general Boolean queries using a result cache for mediator systems. A way of semantically partitioning the given result cache in order to reduce the complexity of inference is also presented.