Ride-hailing(e.g.,DiDi andUber)has become an important tool formodern urban mobility.To improve the utilization efficiency of ride-hailing vehicles,a novel query method,called Approachable k-nearest neighbor(A-kNN),ha...Ride-hailing(e.g.,DiDi andUber)has become an important tool formodern urban mobility.To improve the utilization efficiency of ride-hailing vehicles,a novel query method,called Approachable k-nearest neighbor(A-kNN),has recently been proposed in the industry.Unlike traditional kNN queries,A-kNN considers not only the road network distance but also the availability status of vehicles.In this context,even vehicles with passengers can still be considered potential candidates for dispatch if their destinations are near the requester’s location.The V-Treebased query method,due to its structural characteristics,is capable of efficiently finding k-nearest moving objects within a road network.It is a currently popular query solution in ride-hailing services.However,when vertices to be queried are close in the graph but distant in the index,the V-Tree-based method necessitates the traversal of numerous irrelevant subgraphs,which makes its processing of A-kNN queries less efficient.To address this issue,we optimize the V-Tree-based method and propose a novel index structure,the Path-Accelerated V-Tree(PAV-Tree),to improve query performance by introducing shortcuts.Leveraging this index,we introduce a novel query optimization algorithm,PAVA-kNN,specifically designed to processA-kNNqueries efficiently.Experimental results showthat PAV-A-kNNachieves query times up to 2.2–15 times faster than baseline methods,with microsecond-level latency.展开更多
Time-series databases(TSDBs)are essential for managing large-scale time-series data in fields like finance,IoT,and agriculture.However,traditional query optimization methods,such as dynamic programming,struggle with h...Time-series databases(TSDBs)are essential for managing large-scale time-series data in fields like finance,IoT,and agriculture.However,traditional query optimization methods,such as dynamic programming,struggle with high computational complexity and inaccurate cost estimates.This paper proposes a novel query optimization module for TSDBs using reinforcement learning(RL),specifically Deep Q-Networks(DQN)and Double Deep Q-Networks(DDQN).These algorithms dynamically learn optimal join orders based on query workloads and connection costs.Experiments show that RL-based methods achieve better optimization performance and stability compared to traditional heuristics,especially under complex cost models.This work highlights the potential of RL in improving query optimization for TSDBs.展开更多
In order to protect the privacy of the query user and database,some QKD-based quantum private query(QPQ)protocols were proposed.One example is the protocol proposed by Zhou et al,in which the user makes initial quantu...In order to protect the privacy of the query user and database,some QKD-based quantum private query(QPQ)protocols were proposed.One example is the protocol proposed by Zhou et al,in which the user makes initial quantum states and derives the key bit by comparing the initial quantum state and the outcome state returned from the database by ctrl or shift mode,instead of announcing two non-orthogonal qubits as others which may leak part secret information.To some extent,the security of the database and the privacy of the user are strengthened.Unfortunately,we find that in this protocol,the dishonest user could be obtained,utilizing unambiguous state discrimination,much more database information than that is analyzed in Zhou et al's original research.To strengthen the database security,we improved the mentioned protocol by modifying the information returned by the database in various ways.The analysis indicates that the security of the improved protocols is greatly enhanced.展开更多
聚焦于中小型企业,深入探讨借助Excel Power Query工具批量生成记账凭证的方法。通过分析中小型企业记账凭证处理的现状,对比手工录入的会计电算化记账方式(以下简称手工录账)与借助Excel Power Query批量生成记账凭证的模式,阐述Excel ...聚焦于中小型企业,深入探讨借助Excel Power Query工具批量生成记账凭证的方法。通过分析中小型企业记账凭证处理的现状,对比手工录入的会计电算化记账方式(以下简称手工录账)与借助Excel Power Query批量生成记账凭证的模式,阐述Excel Power Query在数据处理各环节的应用优势,详细介绍应用该工具批量生成记账凭证的具体步骤,并结合实际案例展示其应用效果。展开更多
实验室开放管理已成了信息化时代高校实验教学改革的重要内容。本文利用B/S体系架构和LINQ to SQL技术,设计并实现实验室网上预约管理系统。该系统为高效的实验室管理提供了平台,能有效地平衡各实验室的利用率,减轻实验室管理人员的工作...实验室开放管理已成了信息化时代高校实验教学改革的重要内容。本文利用B/S体系架构和LINQ to SQL技术,设计并实现实验室网上预约管理系统。该系统为高效的实验室管理提供了平台,能有效地平衡各实验室的利用率,减轻实验室管理人员的工作,使实验室的开放管理水平和服务水平推上了一个新的台阶。展开更多
LI NQ是Visual Studio 2008中的一组功能,提供了一种用于在不同类型的数据源中查询和更新数据的统一编程模型。使用对象关系设计器创建LI NQ to SQL类。通过LinqDataSource数据源控件和GridView数据绑定控件进行数据连接和绑定。实现了...LI NQ是Visual Studio 2008中的一组功能,提供了一种用于在不同类型的数据源中查询和更新数据的统一编程模型。使用对象关系设计器创建LI NQ to SQL类。通过LinqDataSource数据源控件和GridView数据绑定控件进行数据连接和绑定。实现了在ASP.NET中使用LI NQto SQL技术对SQLServer数据库进行数据访问。展开更多
为了适应小区物业业务管理扩展及服务的需求,本文利用B/S体系架构和LINQ to SQL技术,设计并实现了小区物业管理系统.该系统为高效的物业管理提供了信息化平台,减轻了物业管理人员的工作.文中简要概括了该系统的系统结构、开发模式及核...为了适应小区物业业务管理扩展及服务的需求,本文利用B/S体系架构和LINQ to SQL技术,设计并实现了小区物业管理系统.该系统为高效的物业管理提供了信息化平台,减轻了物业管理人员的工作.文中简要概括了该系统的系统结构、开发模式及核心功能.开发实践证明,基于LINQ的数据库访问编程模型简单快捷,降低了编程难度,提高了编程效率.展开更多
To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,al...To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.展开更多
Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal ba...Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.展开更多
基金supported by the Special Project of Henan Provincial Key Research,Development and Promotion(Key Science and Technology Program)under Grant 252102210154in part by the National Natural Science Foundation of China under Grant 62403437.
文摘Ride-hailing(e.g.,DiDi andUber)has become an important tool formodern urban mobility.To improve the utilization efficiency of ride-hailing vehicles,a novel query method,called Approachable k-nearest neighbor(A-kNN),has recently been proposed in the industry.Unlike traditional kNN queries,A-kNN considers not only the road network distance but also the availability status of vehicles.In this context,even vehicles with passengers can still be considered potential candidates for dispatch if their destinations are near the requester’s location.The V-Treebased query method,due to its structural characteristics,is capable of efficiently finding k-nearest moving objects within a road network.It is a currently popular query solution in ride-hailing services.However,when vertices to be queried are close in the graph but distant in the index,the V-Tree-based method necessitates the traversal of numerous irrelevant subgraphs,which makes its processing of A-kNN queries less efficient.To address this issue,we optimize the V-Tree-based method and propose a novel index structure,the Path-Accelerated V-Tree(PAV-Tree),to improve query performance by introducing shortcuts.Leveraging this index,we introduce a novel query optimization algorithm,PAVA-kNN,specifically designed to processA-kNNqueries efficiently.Experimental results showthat PAV-A-kNNachieves query times up to 2.2–15 times faster than baseline methods,with microsecond-level latency.
基金supported by Sichuan Science and Technology Program(2024YFHZ0161).
文摘Time-series databases(TSDBs)are essential for managing large-scale time-series data in fields like finance,IoT,and agriculture.However,traditional query optimization methods,such as dynamic programming,struggle with high computational complexity and inaccurate cost estimates.This paper proposes a novel query optimization module for TSDBs using reinforcement learning(RL),specifically Deep Q-Networks(DQN)and Double Deep Q-Networks(DDQN).These algorithms dynamically learn optimal join orders based on query workloads and connection costs.Experiments show that RL-based methods achieve better optimization performance and stability compared to traditional heuristics,especially under complex cost models.This work highlights the potential of RL in improving query optimization for TSDBs.
基金supported by the National Key R&D Program of China(Grant No.2022YFC3801700)the National Natural Science Foundation of China(Grant No.62472052)Xinjiang Production and Construction Corps Key Laboratory of Computing Intelligence and Network Information Security(Grant No.CZ002702-3)。
文摘In order to protect the privacy of the query user and database,some QKD-based quantum private query(QPQ)protocols were proposed.One example is the protocol proposed by Zhou et al,in which the user makes initial quantum states and derives the key bit by comparing the initial quantum state and the outcome state returned from the database by ctrl or shift mode,instead of announcing two non-orthogonal qubits as others which may leak part secret information.To some extent,the security of the database and the privacy of the user are strengthened.Unfortunately,we find that in this protocol,the dishonest user could be obtained,utilizing unambiguous state discrimination,much more database information than that is analyzed in Zhou et al's original research.To strengthen the database security,we improved the mentioned protocol by modifying the information returned by the database in various ways.The analysis indicates that the security of the improved protocols is greatly enhanced.
文摘聚焦于中小型企业,深入探讨借助Excel Power Query工具批量生成记账凭证的方法。通过分析中小型企业记账凭证处理的现状,对比手工录入的会计电算化记账方式(以下简称手工录账)与借助Excel Power Query批量生成记账凭证的模式,阐述Excel Power Query在数据处理各环节的应用优势,详细介绍应用该工具批量生成记账凭证的具体步骤,并结合实际案例展示其应用效果。
文摘LI NQ是Visual Studio 2008中的一组功能,提供了一种用于在不同类型的数据源中查询和更新数据的统一编程模型。使用对象关系设计器创建LI NQ to SQL类。通过LinqDataSource数据源控件和GridView数据绑定控件进行数据连接和绑定。实现了在ASP.NET中使用LI NQto SQL技术对SQLServer数据库进行数据访问。
文摘为了适应小区物业业务管理扩展及服务的需求,本文利用B/S体系架构和LINQ to SQL技术,设计并实现了小区物业管理系统.该系统为高效的物业管理提供了信息化平台,减轻了物业管理人员的工作.文中简要概括了该系统的系统结构、开发模式及核心功能.开发实践证明,基于LINQ的数据库访问编程模型简单快捷,降低了编程难度,提高了编程效率.
基金Weaponry Equipment Pre-Research Foundation of PLA Equipment Ministry (No. 9140A06050409JB8102)Pre-Research Foundation of PLA University of Science and Technology (No. 2009JSJ11)
文摘To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.
基金The National Natural Science Foundation of China(No.61070170)the Natural Science Foundation of Higher Education Institutions of Jiangsu Province(No.11KJB520017)Suzhou Application Foundation Research Project(No.SYG201238)
文摘Aiming at the problem that only some types of SPARQL （ simple protocal and resource description framework query language） queries can be answered by using the current resource description framework link traversal based query execution （RDF-LTE） approach, this paper discusses how the execution order of the triple pattern affects the query results and cost based on concrete SPARQL queries, and analyzes two properties of the web of linked data, missing backward links and missing contingency solution. Then three heuristic principles for logic query plan optimization, namely, the filtered basic graph pattern （FBGP） principle, the triple pattern chain principle and the seed URIs principle, are proposed. The three principles contribute to decrease the intermediate solutions and increase the types of queries that can be answered. The effectiveness and feasibility of the proposed approach is evaluated. The experimental results show that more query results can be returned with less cost, thus enabling users to develop the full potential of the web of linked data.
