An approximate approach of querying between heterogeneous ontology-basedinformation systems based on an association matrix is proposed. First, the association matrix isdefined to describe relations between concepts in...An approximate approach of querying between heterogeneous ontology-basedinformation systems based on an association matrix is proposed. First, the association matrix isdefined to describe relations between concepts in two ontologies. Then, a methodof rewriting queriesbased on the association matrix is presented to solve the ontology heterogeneity problem. Itrewrites the queries in one ontology to approximate queries in another ontology based on thesubsumption relations between concepts. The method also uses vectors to represent queries, and thencomputes the vectors with the association matrix; the disjoint relations between concepts can beconsidered by the results. It can get better approximations than the methods currently in use, whichdonot consider disjoint relations. The method can be processed by machines automatically. It issimple to implement and expected to run quite fast.展开更多
Based on the fuzzy expert system fault diagnosis theory, the knowledge base architecture and inference engine algorithm are put forward for avionic device fault diagnosis. The knowledge base is constructed by fault qu...Based on the fuzzy expert system fault diagnosis theory, the knowledge base architecture and inference engine algorithm are put forward for avionic device fault diagnosis. The knowledge base is constructed by fault query network, of which the basic ele- ment is the test-diagnosis fault unit. Every underlying fault cause＇s membership degree is calculated using fuzzy product inference algorithm, and the fault answer best selection algorithm is developed, to which the deep knowledge is applied. Using some examples the proposed algorithm is analyzed for its capability of synthesis diagnosis and its improvement compared to greater membership degree first principle.展开更多
An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are in...An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are inaccurate and the query efficiency cannot be guaranteed as well.In particular,they are difficult to accurately obtain the complex relationships between multiple tables in complex database systems.When dealing with complex queries,the existing cardinality estimators cannot achieve good results.In this study,a novel cardinality estimator is proposed.It uses the core techniques with the BiLSTM network structure and adds the attention mechanism.First,the columns involved in the query statements in the training set are sampled and compressed into bitmaps.Then,the Word2vec model is used to embed the word vectors about the query statements.Finally,the BiLSTM network and attention mechanism are employed to deal with word vectors.The proposed model takes into consideration not only the correlation between tables but also the processing of complex predicates.Extensive experiments and the evaluation of BiLSTM-Attention Cardinality Estimator(BACE)on the IMDB datasets are conducted.The results show that the deep learning model can significantly improve the quality of cardinality estimation,which is a vital role in query optimisation for complex databases.展开更多
In Chinese question answering system, because there is more semantic relation in questions than that in query words, the precision can be improved by expanding query while using natural language questions to retrieve ...In Chinese question answering system, because there is more semantic relation in questions than that in query words, the precision can be improved by expanding query while using natural language questions to retrieve documents. This paper proposes a new approach to query expansion based on semantics and statistics Firstly automatic relevance feedback method is used to generate a candidate expansion word set. Then the expanded query words are selected from the set based on the semantic similarity and seman- tic relevancy between the candidate words and the original words. Experiments show the new approach is effective for Web retrieval and out-performs the conventional expansion approaches.展开更多
A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed a...A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.展开更多
In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local par...In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local part or in the cloud. It is shown that the time data acquisition remains unchanged as a result of modification. Suggestions have been made about the use of the theory of dynamic systems to hybrid cloud database. The present work is aimed at attracting the attention of specialists in the field of cloud database to the apparatus control theory. The experiment presented in this article allows the use of the description of the known methods for solving important practical problems.展开更多
The volume of information being created, generated and stored is huge. Without adequate knowledge of Information Retrieval (IR) methods, the retrieval process for information would be cumbersome and frustrating. Studi...The volume of information being created, generated and stored is huge. Without adequate knowledge of Information Retrieval (IR) methods, the retrieval process for information would be cumbersome and frustrating. Studies have further revealed that IR methods are essential in information centres (for example, Digital Library environment) for storage and retrieval of information. Therefore, with more than one billion people accessing the Internet, and millions of queries being issued on a daily basis, modern Web search engines are facing a problem of daunting scale. The main problem associated with the existing search engines is how to avoid irrelevant information retrieval and to retrieve the relevant ones. In this study, the existing system of library retrieval was studied. Problems associated with them were analyzed in order to address this problem. The concept of existing information retrieval models was studied, and the knowledge gained was used to design a digital library information retrieval system. It was successfully implemented using a real life data. The need for a continuous evaluation of the IR methods for effective and efficient full text retrieval system was recommended.展开更多
Querying XML data is a computationally expensive process due to the complex nature of both the XML data and the XML queries. In this paper we propose an approach to expedite XML query processing by caching the results...Querying XML data is a computationally expensive process due to the complex nature of both the XML data and the XML queries. In this paper we propose an approach to expedite XML query processing by caching the results of frequent queries. We discover frequent query patterns from user-issued queries using an efficient bottom-up mining approach called VBUXMiner. VBUXMiner consists of two main steps. First, all queries are merged into a summary structure named "compressed global tree guide" (CGTG). Second, a bottom-up traversal scheme based on the CGTG is employed to generate frequent query patterns. We use the frequent query patterns in a cache mechanism to improve the XML query performance. Experimental results show that our proposed mining approach outperforms the previous mining algorithms for XML queries, such as XQPMinerTID and FastXMiner, and that by caching the results of frequent query patterns, XML query performance can be dramatically improved.展开更多
Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Pee...Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.展开更多
One way of achieving interoperability among heterogeneous, distributed DBMSs is through a multidatabase system. Recently, there is an increasing use of CORBA implementation in developing multidatabase systems. Panoram...One way of achieving interoperability among heterogeneous, distributed DBMSs is through a multidatabase system. Recently, there is an increasing use of CORBA implementation in developing multidatabase systems. Panorama is a multidatabase system that has been implemented on the top of CORBA compliant namely VisiBroker. It aims to achieve interoperability among Oracle, Sybase and other different DBMSs through the registration of these DBMSs to Panorama and through the single global query language PanoSQL designed for this system. In this paper, we first introduce CORBA for the interoperability in multidatabase systems. Then, a general view for our designed multidatabase system, Panorama, has been given. In section four, we introduce the global query language PanoSQL designed to achieve interoperability among the different DBMSs implemented in Panorama. Then, as an example, we present the registration of Oracle to Panorama in order to achieve interoperability in this system. And finally, a conclusion and the future work for this system have been given.展开更多
This work aims to reduce queries on big data to computations on small data,and hence make querying big data possible under bounded resources.A query Q is boundedly evaluable when posed on any big dataset D,there exist...This work aims to reduce queries on big data to computations on small data,and hence make querying big data possible under bounded resources.A query Q is boundedly evaluable when posed on any big dataset D,there exists a fraction DQ of D such that Q(D)=Q(DQ),and the cost of identifying DQ is independent of the size of D.It has been shown that with an auxiliary structure known as access schema,many queries in relational algebra(RA)are boundedly evaluable under the set semantics of RA.This paper extends the theory of bounded evaluation to RAaggr,i.e.,RA extended with aggregation,under the bag semantics.(1)We extend access schema to bag access schema,to help us identify DQ for RAaggr queries Q.(2)While it is undecidable to determine whether an RAaggr query is boundedly evaluable under a bag access schema,we identify special cases that are decidable and practical.(3)In addition,we develop an effective syntax for bounded RAaggr queries,i.e.,a core subclass of boundedly evaluable RAaggr queries without sacrificing their expressive power.(4)Based on the effective syntax,we provide efficient algorithms to check the bounded evaluability of RAaggr queries and to generate query plans for bounded RAaggr queries.(5)As proof of concept,we extend PostgreSQL to support bounded evaluation.We experimentally verify that the extended system improves performance by orders of magnitude.展开更多
To enable accessing web information at semantic level, this paper develops a semantic query rewriting mechanism on peer to peer XISs with complex ontology mapping technology. It discusses the patterns of complex ontol...To enable accessing web information at semantic level, this paper develops a semantic query rewriting mechanism on peer to peer XISs with complex ontology mapping technology. It discusses the patterns of complex ontology mappings at first, and the ontology-based query mechanism in peer to peer environment. The extension of XML query algebra and XML query rewriting mechanism are dissussed in detail.展开更多
In this paper, the method of tmderstanding GIS Chinese query based on CBR （case-based reasoning） is proposed. The CaseBase is designed on the grammar rule of Chinese query sentences, the cases that pick up the chara...In this paper, the method of tmderstanding GIS Chinese query based on CBR （case-based reasoning） is proposed. The CaseBase is designed on the grammar rule of Chinese query sentences, the cases that pick up the character of standard query language （SQL） and are expressed in form semantics. In retrieval, the concepts of target comparability, structure comparability and individual comparability are given. The algorithm of case retrieval searches first the case of structure comparability and then individual comparability. The SQL reasoning algorithm that first parses form semantics, then reasons on structure comparability, and finally reasons on individual comparability is realized. In the actual GIS, the structure comparability and individual comparability are tested respectively. The experiment results show that the strategy of CBR is correct and feasible. With the size of CaseBase increasing through studies, the CaseBase will eventually be perfected. The effect of retrieval and reasoning will become better and better.展开更多
It can not provide dynamic view mechanism in previous dataspace information system. In this paper, the dynamic extendable view mechanism provided by object deputy model is proposed for personalized dataspace informati...It can not provide dynamic view mechanism in previous dataspace information system. In this paper, the dynamic extendable view mechanism provided by object deputy model is proposed for personalized dataspace information system which can provide rich semantics and enough flexibility. The flexible inheritance avoids a lot of data redundancy. The cross class query mechanism allows users to find more related data based on complex relationships. The personalized dataspace service provides less storage space consumption and shorter query response time. The experiment result shows that our approach is more feasible and efficient than the traditional one.展开更多
We developed a parallel object relational DBMS named PORLES. It uses BSP model as its parallel computing model, and monoid calculus as its basis of data model. In this paper, we introduce its data model, parallel que...We developed a parallel object relational DBMS named PORLES. It uses BSP model as its parallel computing model, and monoid calculus as its basis of data model. In this paper, we introduce its data model, parallel query optimization, transaction processing system and parallel access method in detail.展开更多
This paper proposes a useful web-based system for the management and sharing of electron probe micro-analysis( EPMA)data in geology. A new web-based architecture that integrates the management and sharing functions is...This paper proposes a useful web-based system for the management and sharing of electron probe micro-analysis( EPMA)data in geology. A new web-based architecture that integrates the management and sharing functions is developed and implemented.Earth scientists can utilize this system to not only manage their data,but also easily communicate and share it with other researchers.Data query methods provide the core functionality of the proposed management and sharing modules. The modules in this system have been developed using cloud GIS technologies,which help achieve real-time spatial area retrieval on a map. The system has been tested by approximately 263 users at Jilin University and Beijing SHRIMP Center. A survey was conducted among these users to estimate the usability of the primary functions of the system,and the assessment result is summarized and presented.展开更多
Description logics （DLs） play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web...Description logics （DLs） play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Lite.n, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Lite,n can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably.展开更多
Time is an important dimension for information in the geographical information system. Data, such as the historical state of target property space and related events causing the state to be changed, should be saved as...Time is an important dimension for information in the geographical information system. Data, such as the historical state of target property space and related events causing the state to be changed, should be saved as important files. This should be applied to property management. This paper designs and constructs a spatial temporal model, which is suitable to the property data changing management and spatial temporal query by analyzing the basic types and characteristics of property management spatial changing time and date. This model uses current and historical situational layers to organize and set up the relationship between current situation data and historical dates according to spatial temporal topological relations in property entities. By using Map Basic, housing property management and spatial query is realized.展开更多
Tag collision algorithm is a key issue for energy saving and throughput with Radio Frequency IDentification (RFID) system more popular in sensing infrastructure of covering wider area on a large scale. Exploiting low ...Tag collision algorithm is a key issue for energy saving and throughput with Radio Frequency IDentification (RFID) system more popular in sensing infrastructure of covering wider area on a large scale. Exploiting low energy consumption strategy would enable longer operational life of tags and reader with battery energy supply. And improving throughput is required on a large scale to preserve the capability of the correct reception. Therefore, this paper proposes an enhanced anti-collision algorithm called Dynamic Slotted with Muting (DSM), which uses multiple slots within a frame per node in a binary tree and takes tag estimation function to optimize the number of slots, and adds a mute command to put identified tags silence. The performance of the proposed algorithm is analytically provided, and simulation results show that DSM saves more than 40% energy consumptions both at reader and tags, and improves more than 35% throughput compared to the existing algorithms. Thus our algorithm is demonstrated to perform efficient energy savings at reader and tags with throughput improvement.展开更多
This research aims to enhance Clinical Decision Support Systems(CDSS)within Wireless Body Area Networks(WBANs)by leveraging advanced machine learning techniques.Specifically,we target the challenges of accurate diagno...This research aims to enhance Clinical Decision Support Systems(CDSS)within Wireless Body Area Networks(WBANs)by leveraging advanced machine learning techniques.Specifically,we target the challenges of accurate diagnosis in medical imaging and sequential data analysis using Recurrent Neural Networks(RNNs)with Long Short-Term Memory(LSTM)layers and echo state cells.These models are tailored to improve diagnostic precision,particularly for conditions like rotator cuff tears in osteoporosis patients and gastrointestinal diseases.Traditional diagnostic methods and existing CDSS frameworks often fall short in managing complex,sequential medical data,struggling with long-term dependencies and data imbalances,resulting in suboptimal accuracy and delayed decisions.Our goal is to develop Artificial Intelligence(AI)models that address these shortcomings,offering robust,real-time diagnostic support.We propose a hybrid RNN model that integrates SimpleRNN,LSTM layers,and echo state cells to manage long-term dependencies effectively.Additionally,we introduce CG-Net,a novel Convolutional Neural Network(CNN)framework for gastrointestinal disease classification,which outperforms traditional CNN models.We further enhance model performance through data augmentation and transfer learning,improving generalization and robustness against data scarcity and imbalance.Comprehensive validation,including 5-fold cross-validation and metrics such as accuracy,precision,recall,F1-score,and Area Under the Curve(AUC),confirms the models’reliability.Moreover,SHapley Additive exPlanations(SHAP)and Local Interpretable Model-agnostic Explanations(LIME)are employed to improve model interpretability.Our findings show that the proposed models significantly enhance diagnostic accuracy and efficiency,offering substantial advancements in WBANs and CDSS.展开更多
文摘An approximate approach of querying between heterogeneous ontology-basedinformation systems based on an association matrix is proposed. First, the association matrix isdefined to describe relations between concepts in two ontologies. Then, a methodof rewriting queriesbased on the association matrix is presented to solve the ontology heterogeneity problem. Itrewrites the queries in one ontology to approximate queries in another ontology based on thesubsumption relations between concepts. The method also uses vectors to represent queries, and thencomputes the vectors with the association matrix; the disjoint relations between concepts can beconsidered by the results. It can get better approximations than the methods currently in use, whichdonot consider disjoint relations. The method can be processed by machines automatically. It issimple to implement and expected to run quite fast.
基金The 11th Five-year National Defense Preliminary Research Projects (B0520060455)
文摘Based on the fuzzy expert system fault diagnosis theory, the knowledge base architecture and inference engine algorithm are put forward for avionic device fault diagnosis. The knowledge base is constructed by fault query network, of which the basic ele- ment is the test-diagnosis fault unit. Every underlying fault cause＇s membership degree is calculated using fuzzy product inference algorithm, and the fault answer best selection algorithm is developed, to which the deep knowledge is applied. Using some examples the proposed algorithm is analyzed for its capability of synthesis diagnosis and its improvement compared to greater membership degree first principle.
基金supported by the National Natural Science Foundation of China under grant nos.61772091,61802035,61962006,61962038,U1802271,U2001212,and 62072311the Sichuan Science and Technology Program under grant nos.2021JDJQ0021 and 22ZDYF2680+7 种基金the CCF‐Huawei Database System Innovation Research Plan under grant no.CCF‐HuaweiDBIR2020004ADigital Media Art,Key Laboratory of Sichuan Province,Sichuan Conservatory of Music,Chengdu,China under grant no.21DMAKL02the Chengdu Major Science and Technology Innovation Project under grant no.2021‐YF08‐00156‐GXthe Chengdu Technology Innovation and Research and Development Project under grant no.2021‐YF05‐00491‐SNthe Natural Science Foundation of Guangxi under grant no.2018GXNSFDA138005the Guangdong Basic and Applied Basic Research Foundation under grant no.2020B1515120028the Science and Technology Innovation Seedling Project of Sichuan Province under grant no 2021006the College Student Innovation and Entrepreneurship Training Program of Chengdu University of Information Technology under grant nos.202110621179 and 202110621186.
文摘An excellent cardinality estimation can make the query optimiser produce a good execution plan.Although there are some studies on cardinality estimation,the prediction results of existing cardinality estimators are inaccurate and the query efficiency cannot be guaranteed as well.In particular,they are difficult to accurately obtain the complex relationships between multiple tables in complex database systems.When dealing with complex queries,the existing cardinality estimators cannot achieve good results.In this study,a novel cardinality estimator is proposed.It uses the core techniques with the BiLSTM network structure and adds the attention mechanism.First,the columns involved in the query statements in the training set are sampled and compressed into bitmaps.Then,the Word2vec model is used to embed the word vectors about the query statements.Finally,the BiLSTM network and attention mechanism are employed to deal with word vectors.The proposed model takes into consideration not only the correlation between tables but also the processing of complex predicates.Extensive experiments and the evaluation of BiLSTM-Attention Cardinality Estimator(BACE)on the IMDB datasets are conducted.The results show that the deep learning model can significantly improve the quality of cardinality estimation,which is a vital role in query optimisation for complex databases.
基金the Specialized Research Program Fundthe Doctoral Program of Higher Education of China (20050007023)the Natural Science Foundation of Shandong Province(Y2004G04)
文摘In Chinese question answering system, because there is more semantic relation in questions than that in query words, the precision can be improved by expanding query while using natural language questions to retrieve documents. This paper proposes a new approach to query expansion based on semantics and statistics Firstly automatic relevance feedback method is used to generate a candidate expansion word set. Then the expanded query words are selected from the set based on the semantic similarity and seman- tic relevancy between the candidate words and the original words. Experiments show the new approach is effective for Web retrieval and out-performs the conventional expansion approaches.
文摘A new routing algorithm of peer-to-peer file sharing system with routing indices was proposed, in which a node forwards a query to neighbors that are more likely to have answers based on its statistics. The proposed algorithm was tested by creating a P2P simulator and varying the input parameters, and was compared to the search algorithms using flooding （FLD） and random walk （RW）. The result shows that with the proposed design, the queries are muted effectively, the network flows are reduced remarkably, and the peer-to-peer file sharing system gains a good expansibility.
文摘In the article, an experiment is aimed at clarifying the transfer efficiency of the database in the cloud infrastructure. The system was added to the control unit, which has guided the database search in the local part or in the cloud. It is shown that the time data acquisition remains unchanged as a result of modification. Suggestions have been made about the use of the theory of dynamic systems to hybrid cloud database. The present work is aimed at attracting the attention of specialists in the field of cloud database to the apparatus control theory. The experiment presented in this article allows the use of the description of the known methods for solving important practical problems.
文摘The volume of information being created, generated and stored is huge. Without adequate knowledge of Information Retrieval (IR) methods, the retrieval process for information would be cumbersome and frustrating. Studies have further revealed that IR methods are essential in information centres (for example, Digital Library environment) for storage and retrieval of information. Therefore, with more than one billion people accessing the Internet, and millions of queries being issued on a daily basis, modern Web search engines are facing a problem of daunting scale. The main problem associated with the existing search engines is how to avoid irrelevant information retrieval and to retrieve the relevant ones. In this study, the existing system of library retrieval was studied. Problems associated with them were analyzed in order to address this problem. The concept of existing information retrieval models was studied, and the knowledge gained was used to design a digital library information retrieval system. It was successfully implemented using a real life data. The need for a continuous evaluation of the IR methods for effective and efficient full text retrieval system was recommended.
基金the National Natural Science Foundation of China (No. 60603044)the National Key Technologies Supporting Program of China during the 11th Five-Year Plan Period (No. 2006BAH02A03)the Program for Changjiang Scholars and Innovative Research Team in University of China (No. IRT0652)
文摘Querying XML data is a computationally expensive process due to the complex nature of both the XML data and the XML queries. In this paper we propose an approach to expedite XML query processing by caching the results of frequent queries. We discover frequent query patterns from user-issued queries using an efficient bottom-up mining approach called VBUXMiner. VBUXMiner consists of two main steps. First, all queries are merged into a summary structure named "compressed global tree guide" (CGTG). Second, a bottom-up traversal scheme based on the CGTG is employed to generate frequent query patterns. We use the frequent query patterns in a cache mechanism to improve the XML query performance. Experimental results show that our proposed mining approach outperforms the previous mining algorithms for XML queries, such as XQPMinerTID and FastXMiner, and that by caching the results of frequent query patterns, XML query performance can be dramatically improved.
基金Supported by the Natural Science Foundation ofJiangsu Province(BG2004034)
文摘Multidimensional data query has been gaining much interest in database research communities in recent years, yet many of the existing studies focus mainly on ten tralized systems. A solution to querying in Peer-to-Peer（P2P） environment was proposed to achieve both low processing cost in terms of the number of peers accessed and search messages and balanced query loads among peers. The system is based on a balanced tree structured P2P network. By partitioning the query space intelligently, the amount of query forwarding is effectively controlled, and the number of peers involved and search messages are also limited. Dynamic load balancing can be achieved during space partitioning and query resolving. Extensive experiments confirm the effectiveness and scalability of our algorithms on P2P networks.
文摘One way of achieving interoperability among heterogeneous, distributed DBMSs is through a multidatabase system. Recently, there is an increasing use of CORBA implementation in developing multidatabase systems. Panorama is a multidatabase system that has been implemented on the top of CORBA compliant namely VisiBroker. It aims to achieve interoperability among Oracle, Sybase and other different DBMSs through the registration of these DBMSs to Panorama and through the single global query language PanoSQL designed for this system. In this paper, we first introduce CORBA for the interoperability in multidatabase systems. Then, a general view for our designed multidatabase system, Panorama, has been given. In section four, we introduce the global query language PanoSQL designed to achieve interoperability among the different DBMSs implemented in Panorama. Then, as an example, we present the registration of Oracle to Panorama in order to achieve interoperability in this system. And finally, a conclusion and the future work for this system have been given.
基金supported in part by Royal Society YVolfson Research Merit Award WRM/R1/180014,ERC 652976,EPSRC EP/M025268/1,Shenzhen Institute of Computing Sciences,and Beijing Advanced Innovation Center for Big Data and Brain Computing.
文摘This work aims to reduce queries on big data to computations on small data,and hence make querying big data possible under bounded resources.A query Q is boundedly evaluable when posed on any big dataset D,there exists a fraction DQ of D such that Q(D)=Q(DQ),and the cost of identifying DQ is independent of the size of D.It has been shown that with an auxiliary structure known as access schema,many queries in relational algebra(RA)are boundedly evaluable under the set semantics of RA.This paper extends the theory of bounded evaluation to RAaggr,i.e.,RA extended with aggregation,under the bag semantics.(1)We extend access schema to bag access schema,to help us identify DQ for RAaggr queries Q.(2)While it is undecidable to determine whether an RAaggr query is boundedly evaluable under a bag access schema,we identify special cases that are decidable and practical.(3)In addition,we develop an effective syntax for bounded RAaggr queries,i.e.,a core subclass of boundedly evaluable RAaggr queries without sacrificing their expressive power.(4)Based on the effective syntax,we provide efficient algorithms to check the bounded evaluability of RAaggr queries and to generate query plans for bounded RAaggr queries.(5)As proof of concept,we extend PostgreSQL to support bounded evaluation.We experimentally verify that the extended system improves performance by orders of magnitude.
基金Supported by the Natural Science Foundation ofHubei Province(2005ABA235) Key Project of Science Research ofEducation Agency of Hubei Province (Z200511005)
文摘To enable accessing web information at semantic level, this paper develops a semantic query rewriting mechanism on peer to peer XISs with complex ontology mapping technology. It discusses the patterns of complex ontology mappings at first, and the ontology-based query mechanism in peer to peer environment. The extension of XML query algebra and XML query rewriting mechanism are dissussed in detail.
基金Supported by the Key Laboratory of Geo-Informatics of State Bureau of Surveying and Mapping (200626)
文摘In this paper, the method of tmderstanding GIS Chinese query based on CBR （case-based reasoning） is proposed. The CaseBase is designed on the grammar rule of Chinese query sentences, the cases that pick up the character of standard query language （SQL） and are expressed in form semantics. In retrieval, the concepts of target comparability, structure comparability and individual comparability are given. The algorithm of case retrieval searches first the case of structure comparability and then individual comparability. The SQL reasoning algorithm that first parses form semantics, then reasons on structure comparability, and finally reasons on individual comparability is realized. In the actual GIS, the structure comparability and individual comparability are tested respectively. The experiment results show that the strategy of CBR is correct and feasible. With the size of CaseBase increasing through studies, the CaseBase will eventually be perfected. The effect of retrieval and reasoning will become better and better.
基金Supported by the National Natural Science Foundation of China (60573095)the Program for New Century Excellent Talents at Univer-sity of China (NCET-04-0675)+2 种基金the National High Technology Research and Development Program of China (2006AA12Z210)Specialized Research Fund for the Doctoral Program of Higher Education of China (20050486024)State Key Laboratory of Software Engineering (SKLSE05-01)
文摘It can not provide dynamic view mechanism in previous dataspace information system. In this paper, the dynamic extendable view mechanism provided by object deputy model is proposed for personalized dataspace information system which can provide rich semantics and enough flexibility. The flexible inheritance avoids a lot of data redundancy. The cross class query mechanism allows users to find more related data based on complex relationships. The personalized dataspace service provides less storage space consumption and shorter query response time. The experiment result shows that our approach is more feasible and efficient than the traditional one.
文摘We developed a parallel object relational DBMS named PORLES. It uses BSP model as its parallel computing model, and monoid calculus as its basis of data model. In this paper, we introduce its data model, parallel query optimization, transaction processing system and parallel access method in detail.
基金National Major Scientific Instruments and Equipment Development Special Funds,China(No.2016YFF0103303)National Science and Technology Support Program,China(No.2014BAK02B03)
文摘This paper proposes a useful web-based system for the management and sharing of electron probe micro-analysis( EPMA)data in geology. A new web-based architecture that integrates the management and sharing functions is developed and implemented.Earth scientists can utilize this system to not only manage their data,but also easily communicate and share it with other researchers.Data query methods provide the core functionality of the proposed management and sharing modules. The modules in this system have been developed using cloud GIS technologies,which help achieve real-time spatial area retrieval on a map. The system has been tested by approximately 263 users at Jilin University and Beijing SHRIMP Center. A survey was conducted among these users to estimate the usability of the primary functions of the system,and the assessment result is summarized and presented.
基金the Program for New Century Excellent Talents in University (NCET-05-0288)the Specialized Research Fund for the Doctoral Program of Higher Education of China (20050145024)
文摘Description logics （DLs） play an important role in representing and reasoning domain knowledge. Conjunctive queries stemmed from the domain of relational databases, and have attracted more attentions in semantic Web recently. To acquire a tractable DL for query answering, DL-Lite is proposed. Due to the large amount of imprecision and uncertainty in the real world, it is essential to extend DLs to deal with these vague and imprecise information. We thus propose a new fuzzy DL f-DLR-Lite.n, which allows for the presence of n-ary relations and the occurrence of concept conjunction on the left land of inclusion axioms. We also suggest an improved fuzzy query language, which supports the presence of thresholds and user defined weights. We also show that the query answering algorithm over the extended DL is still FOL reducible and shows polynomial data complexity. DL f-DLR-Lite,n can make up for the disadvantages of knowledge representation and reasoning of classic DLs, and the enhanced query language expresses user intentions more precisely and reasonably.
文摘Time is an important dimension for information in the geographical information system. Data, such as the historical state of target property space and related events causing the state to be changed, should be saved as important files. This should be applied to property management. This paper designs and constructs a spatial temporal model, which is suitable to the property data changing management and spatial temporal query by analyzing the basic types and characteristics of property management spatial changing time and date. This model uses current and historical situational layers to organize and set up the relationship between current situation data and historical dates according to spatial temporal topological relations in property entities. By using Map Basic, housing property management and spatial query is realized.
基金Supported by the Chongqing Education Administration Program Foundation of China (No.KJ110516)the Chongqing Natural Science Foundation of China (No.cstc2011jjA40014, No.cstc2011A40028)
文摘Tag collision algorithm is a key issue for energy saving and throughput with Radio Frequency IDentification (RFID) system more popular in sensing infrastructure of covering wider area on a large scale. Exploiting low energy consumption strategy would enable longer operational life of tags and reader with battery energy supply. And improving throughput is required on a large scale to preserve the capability of the correct reception. Therefore, this paper proposes an enhanced anti-collision algorithm called Dynamic Slotted with Muting (DSM), which uses multiple slots within a frame per node in a binary tree and takes tag estimation function to optimize the number of slots, and adds a mute command to put identified tags silence. The performance of the proposed algorithm is analytically provided, and simulation results show that DSM saves more than 40% energy consumptions both at reader and tags, and improves more than 35% throughput compared to the existing algorithms. Thus our algorithm is demonstrated to perform efficient energy savings at reader and tags with throughput improvement.
基金supported by the“Human Resources Program in Energy Technology”of the Korea Institute of Energy Technology Evaluation and Planning(KETEP)and granted financial resources from the Ministry of Trade,Industry,and Energy,Korea(No.20204010600090).
文摘This research aims to enhance Clinical Decision Support Systems(CDSS)within Wireless Body Area Networks(WBANs)by leveraging advanced machine learning techniques.Specifically,we target the challenges of accurate diagnosis in medical imaging and sequential data analysis using Recurrent Neural Networks(RNNs)with Long Short-Term Memory(LSTM)layers and echo state cells.These models are tailored to improve diagnostic precision,particularly for conditions like rotator cuff tears in osteoporosis patients and gastrointestinal diseases.Traditional diagnostic methods and existing CDSS frameworks often fall short in managing complex,sequential medical data,struggling with long-term dependencies and data imbalances,resulting in suboptimal accuracy and delayed decisions.Our goal is to develop Artificial Intelligence(AI)models that address these shortcomings,offering robust,real-time diagnostic support.We propose a hybrid RNN model that integrates SimpleRNN,LSTM layers,and echo state cells to manage long-term dependencies effectively.Additionally,we introduce CG-Net,a novel Convolutional Neural Network(CNN)framework for gastrointestinal disease classification,which outperforms traditional CNN models.We further enhance model performance through data augmentation and transfer learning,improving generalization and robustness against data scarcity and imbalance.Comprehensive validation,including 5-fold cross-validation and metrics such as accuracy,precision,recall,F1-score,and Area Under the Curve(AUC),confirms the models’reliability.Moreover,SHapley Additive exPlanations(SHAP)and Local Interpretable Model-agnostic Explanations(LIME)are employed to improve model interpretability.Our findings show that the proposed models significantly enhance diagnostic accuracy and efficiency,offering substantial advancements in WBANs and CDSS.
