基于概念图的用户兴趣查询扩展模型的研究

查询扩展是信息检索技术研究的一个重要组成部分。目前的查询扩展是基于统一的用户模型,没有考虑到用户的个人兴趣,这对查询扩展的精确度造成了一定的影响。分析了产生这种问题的原因,提出了基于概念图的用户兴趣扩展模型,通过该模型来有效提高查询扩展的精确度。实验显示,该方法能有效提高查询的查全率和查准率。     

Web检索查询意图分类技术综述

查询分类是近年来信息检索领域的研究热点,并且在很多领域得到了广泛地关注。主要讨论根据查询的意图进行分类的研究工作,从查询分类的诞生背景、关键技术、所使用的分类方法和评价方法方面进行综述评论,提出了查询意图分类面临的问题和挑战。认为缺乏权威的评测标准、在大规模数据集上的未经全面测试的性能、如何准确地获取查询的特征以及如何证明分类体系的完备性和独立性是目前查询意图分类研究的关键问题。     

基于Oracle分布式数据库的查询优化

随着信息和网络技术的发展,分布式数据库得到了广泛的发展,其中Oracle分布式数据库在企业管理中得到了极大的应用。为了能够更好地提高企业的竞争力,对Oracle分布式数据库的查询进行优化成为必要。从介绍Oracle分布式数据库的两种基本结构出发,重点介绍了几种不同的Oracle分布式数据库的查询优化方法及其SQL语句的实现,并且通过试验对优化方法的性能进行了测试,然后通过数据的对比体现出了查询优化前后的差别,最后给出了可能影响查询优化性能的因素。     

非一致性数据库的多关系聚集查询重写

基于非一致性关系数据库的选择连接查询技术,提出了基于非一致性数据库多个关系上的聚集查询重写方法。该聚集查询重写方法先通过查询出多关系上的一致性结果,然后进行分组聚集,返回聚集表达范围边界值。实验采用TPC-H策支持基准进行性能研究,结果表明重写查询比初始查询的执行时间要长,但还是可以接受的,因此该方法是有效的。     

XQuery的应用分析

XML查询语言XQuery是导航语言XPath的扩展,它是一种语法简单灵活且表现力强大的功能性语言。XQuery与XML数据结构有内在的联系,可以方便地编写业务逻辑,并且本质上就可以操作XML数据。本文对XQuery发展状况的进行了概要介绍,通过查询语言XQuery的主要概念,及XQuery语言在数据查询、转换等方面的应用分析,对XML文档查询语言的实际应用情况作出讨论。     

一种哈希表快速查找的改进方法

哈希表由于其速度快的优点在数据查询中有着广泛的应用。本文在结合冲突解决机制和数据元素被查找的先验概率的基础上,提出了一种提高哈希表查找效率的优化方法,并对该方法在链地址法处理哈希冲突的情况下进行了理论分析,与原哈希表方法相比,该方法降低了冲突时执行查询的查找长度,从而使查询响应时间更短。最后对该方法进行行了实例验证,实验结果表明,新方法是有效并且简便的。     

A new methodology for query answering in default logics via structure-oriented theorem proving

We present a new approach to query answering in default logics. The basic idea is to treat default rules as classical implications along with some qualifying conditions restricting the use of such rules while query answering. We accomplish this by taking advantage of the conception of structure-oriented theorem proving provided by Bibel's connection method. We show that the structure-sensitive nature of the connection method allows for an elegant characterization of proofs in default logic. After introducing our basic method for query answering in default logics, we present a corresponding algorithm and describe its implementation. Both the algorithm and its implementation are obtained by slightly modifying an existing algorithm and an existing implementation of the standard connection method. In turn, we give a couple of refinements of the basic method that lead to conceptually different algorithms. The approach turns out to be extraordinarily qualified for implementations by means of existing automated theorem proving techniques. We substantiate this claim by presenting implementations of the various algorithms along with some experimental analysis.Even though our method has a general nature, we introduce it in the first part of this paper with the example of constrained default logic. This default logic is tantamount to a variant due to Brewka, and it coincides with Reiter's default logic and a variant due to ukaszewicz on a large fragment of default logic. Accordingly, our exposition applies to these instances of default logic without any modifications.     

An efficient processing of a chain join with the minimum communication cost in distributed database systems

This paper investigates the optimization problem when executing a join in a distributed database environment. The minimization of the communication cost for sending data through links has been adopted as an optimization criterion. We explore in this paper the approach of judiciously using join operations as reducers in distributed query processing. In general, this problem is computationally intractable. A restriction of the execution of a join in a pre-defined combinatorial order leads to a possible solution in polynomial time. An algorithm for a chain query computation has been proposed in [21]. The time complexity of the algorithm isO(m ² n ²+m ³ n), wheren is the number of sites in the network, andm is the number of relations (fragments) involved in the join. In this paper, we firstly present a proof of the intuitively well understood fact—that the eigenorder of a chain join will be the best pre-defined combinatorial order to implement the algorithm in [21]. Secondly, we show a sufficient and necessary condition for a chain query with the eigenordering to be a simple query. For the process of the class of simple queries, we show a significant reduction of the time complexity fromO(m ² n ²+m ³ n) toO(mn+m ²). It is encouraging that, in practice, the most frequent queries belong to the category of simple queries. Editor: Peter Apers     

Web Page Recommendation Using Distributional Recurrent Neural Network

In the data retrieval process of the Data recommendation system, the matching prediction and similarity identification take place a major role in the ontology. In that, there are several methods to improve the retrieving process with improved accuracy and to reduce the searching time. Since, in the data recommendation system, this type of data searching becomes complex to search for the best matching for given query data and fails in the accuracy of the query recommendation process. To improve the performance of data validation, this paper proposed a novel model of data similarity estimation and clustering method to retrieve the relevant data with the best matching in the big data processing. In this paper advanced model of the Logarithmic Directionality Texture Pattern (LDTP) method with a Metaheuristic Pattern Searching (MPS) system was used to estimate the similarity between the query data in the entire database. The overall work was implemented for the application of the data recommendation process. These are all indexed and grouped as a cluster to form a paged format of database structure which can reduce the computation time while at the searching period. Also, with the help of a neural network, the relevancies of feature attributes in the database are predicted, and the matching index was sorted to provide the recommended data for given query data. This was achieved by using the Distributional Recurrent Neural Network (DRNN). This is an enhanced model of Neural Network technology to find the relevancy based on the correlation factor of the feature set. The training process of the DRNN classifier was carried out by estimating the correlation factor of the attributes of the dataset. These are formed as clusters and paged with proper indexing based on the MPS parameter of similarity metric. The overall performance of the proposed work can be evaluated by varying the size of the training database by 60%, 70%, and 80%. The parameters that are considered for performance analysis are Precision, Recall, F1-score and the accuracy of data retrieval, the query recommendation output, and comparison with other state-of-art methods.     

嵌入路网图模型的自动驾驶场景描述语言

深度学习的快速发展带动着自动驾驶技术的迅速进步.深度学习感知模型在识别准确率逐步提升的同时,也存在鲁棒性和可靠性不足等隐患,需要在大量场景下进行充分测试以确保达到可接受的安全标准.基于场景的仿真测试是自动驾驶技术的核心和关键,如何描述和生成多样化仿真测试场景是需要解决的关键问题之一.场景描述语言能够描述自动驾驶场景并在虚拟环境中实例化场景获取仿真数据,但现有的场景描述语言大都缺少对于场景道路结构的高层抽象和描述.提出路网属性图来表示路网中抽象出的实体及他们的关系,并设计能简洁描述场景路网结构的语言SceneRoad. SceneRoad可以基于描述的场景道路结构特征构建路网特征查询图.这样,在路网中搜索符合描述的场景道路特征的问题被抽象为路网图上的子图匹配问题,该问题可用VF2算法求解.进一步地,将SceneRoad作为扩展集成到Scenic场景描述语言中.使用拓展后的语言随机生成大量多样的静态场景并构建仿真数据集.仿真数据集的统计信息表明生成的场景具有丰富的场景多样性.不同感知模型在真实和仿真数据集上的训练测试结果表明,模型在两个数据集上的表现呈正相关,意味着模型在仿真数据集上的评估...