Applying First Order Predicate to the Semantic Query of Chinese

This paper described an approach to make inferences on Chinese information using first order predicate logic, which could be used in the semantic query of Chinese. The predicates of the method were derived from the natural language using rule based LFT, the axiom set was generated by extracting lexicon knowledge from HowNet, and the first order predicate inferences were made through symbol connection of center words. After all these were done, the evaluation and possible improvements of the method were provided. The experiment result shows a higher precision rate than that traditional methods can reach.

An Efficient Algorithm for Query Transformation in Semantic Query Optimization

Semantic query optimization (SQO) is comparatively a recent approach for the transformation of given query into equivalent alternative query using matching rules in order to select an optimal query based on the costs of executing alternative queries. The key aspect of the algorithm proposed here is that previous proposed SQO techniques can be considered equally in the uniform cost model, with which optimization opportunities will not be missed. At the same time, the authors used the implication closure to guarantee that any matched rule will not be lost. The authors implemented their algorithm for the optimization of decomposed sub-query in local database in Multi-Database Integrator (MDBI), which is a multidatabase project. The experimental results verify that this algorithm is effective in the process of SQO.

A semantic query-based approach for management decision-making

Decision-making is one of the critical activities ofmanagement in business.However,decision support systems that support management decision-making activities lack the semantics involved in responding to semantic queries involving reasoning.We consider an ontology-based knowledge base that covers linked data about organizations,people and activities in a supply chain.In this paper,we explore how to effectively answer semantic queries to support management decision-making,where custom rules are employed for answering qualitative queries.We explore the ontological data representation and a similarity measure for data integration.We present a hybrid reasoning algorithm for answering qualitative queries.This algorithm adapts the reasoner such that,when proving a goal,it does a simple retrieval when it encounters trusted items,and backward-chaining over untrusted items.We provide a case study and evaluate the hybrid reasoning algorithm on scalability,query processing time and support for management decision-making.

Large Language Model Based Semantic Parsing for Intelligent Database Query Engine

With the rapid development of artificial intelligence, large language models (LLMs) have demonstrated remarkable capabilities in natural language understanding and generation. These models have great potential to enhance database query systems, enabling more intuitive and semantic query mechanisms. Our model leverages LLM’s deep learning architecture to interpret and process natural language queries and translate them into accurate database queries. The system integrates an LLM-powered semantic parser that translates user input into structured queries that can be understood by the database management system. First, the user query is pre-processed, the text is normalized, and the ambiguity is removed. This is followed by semantic parsing, where the LLM interprets the pre-processed text and identifies key entities and relationships. This is followed by query generation, which converts the parsed information into a structured query format and tailors it to the target database schema. Finally, there is query execution and feedback, where the resulting query is executed on the database and the results are returned to the user. The system also provides feedback mechanisms to improve and optimize future query interpretations. By using advanced LLMs for model implementation and fine-tuning on diverse datasets, the experimental results show that the proposed method significantly improves the accuracy and usability of database queries, making data retrieval easy for users without specialized knowledge.

The FAIR Data Point:Interfaces and Tooling

While the FAIR Principles do not specify a technical solution for'FAIRness',it was clear from the outset of the FAIR initiative that it would be useful to have commodity software and tooling that would simplify the creation of FAIR-compliant resources.The FAIR Data Point is a metadata repository that follows the DCAT(2)schema,and utilizes the Linked Data Platform to manage the hierarchical metadata layers as LDP Containers.There has been a recent flurry of development activity around the FAIR Data Point that has significantly improved its power and ease-of-use.Here we describe five specific tools—an installer,a loader,two Webbased interfaces,and an indexer-aimed at maximizing the uptake and utility of the FAIR Data Point.

Protecting personalized privacy against sensitivity homogeneity attacks over road networks in mobile services

Privacy preservation has recently received considerable attention for location-based mobile services. A lot of location cloaking approaches focus on identity and location protection, but few algorithms pay attention to prevent sensitive information disclosure using query semantics. In terms of personalized privacy requirements, all queries in a cloaking set, from some user＇s point of view, are sensitive. These users regard the privacy is breached. This attack is called as the sensitivity homogeneity attack. We show that none of the existing location cloaking approaches can effectively resolve this problem over road networks. We propose a （K, L, P）-anonymity model and a personalized privacy protection cloaking algorithm over road networks, aiming at protecting the identity, location and sensitive information for each user. The main idea of our method is first to partition users into different groups as anonymity requirements. Then, unsafe groups are adjusted by inserting relaxed conservative users considering sensitivity requirements. Finally, segments covered by each group are published to protect location information. The efficiency and effectiveness of the method are validated by a series of carefully designed experiments. The experimental results also show that the price paid for defending against sensitivity homogeneity attacks is small.