On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.     

基于VB的学生信息管理系统的设计

在VB6.0环境下,通过连接Access2000数据库,建立了一个学生管理系统。在这个系统里,可以实现学生学号,姓名,年龄,联系方式,照片等各种信息的录入,精确查找,模糊查找,更新,删除等操作。从程序的界面设计到源代码,都做了详尽的说明,适合初学者快速掌握信息管理系统开发的步骤。     

利用客户端脚本实现复合查询的新思路

本文主要针对目前网站上常用的查询系统所存在的某些常见问题而提出了一种新的查询设计思路,这种新的设计思路主要是在客户端利用JavaScript脚本语言对用户设置的查询条件进行预处理,让用户设置的条件以两种形式出现在系统中,一种形式方便方便用户阅读和理解,另一种形式用于真正的数据查询;此外,通过脚本语言将用户设置的查询条件保存于页面上列表中,用户可以随意组合现有的条件形成更为复杂的查询条件;同时用户也可以在列表中随意选择某个条件执行数据查询。     

ModBUS协议通讯的应用

ModBUS协议具有侦错能力强、数据传输量大、实时性好等特点，因而成为目前自控领域使用非常广泛的通讯语言．本文通过一个应用实例介绍如何利用微机编程实现在线通讯ModBUS消息环的工作过程．在可视化语言环境下完成地址域、功能代码域、数据域的分配及CRC校验，从而实现计算机与远程控制单元数据传输。     

Efficient Evaluation of Monitoring Top-t Most Influential Places

The continuous top-t most influential place (CTtMIP)query is defined formally and solved efficiently in this paper.A CTtMIP query continuously monitors the t places with the maximum influence from the ...     

后端数据库机系统联接操作的优化策略

本文研究了后端数据库机系统的二元联接优化策略。首先给出了衡量查询效率的优化指标,并提出了一个通用后端数据库系统模型,其次介绍了二元联接优化的模型和算法。最后,在TDM系统上分析了该算法,证明确实能改善系统的查询效率。     

SQL查询语句优化方法的研究

介绍RDBMS优化器的执行策略和分析了影响SQL查询效率的因素的基础上 ,提出了优化SQL查询效率的基本方法 ,以提高数据库查询的执行效率。     

A Distributed Query Protocol in Wireless Sensor Networks

In wireless sensor networks, query execution over a specific geographical region is an essential function for collecting sensed data. However, sensor nodes deployed in sensor networks have limited battery power. Hence, the minimum number of connected sensor nodes that covers the queried region in a sensor network must be determined. This paper proposes an efficient distributed protocol to find a subset of connected sensor nodes to cover the queried region. Each node determines whether to be a sensing node to sense the queried region according to its priority. The proposed protocol can efficiently construct a subset of connected sensing nodes and respond the query request to the sink node. In addition, the proposed protocol is extended to solve the k-coverage request. Simulation results show that our protocol is more efficient and has a lower communication overhead than the existing protocol.     

基于hadoop的大规模查询日志分析模型设计

日志分析对于在用户搜索领域有着很重要的意义,目前的日志分析系统有着不少弊端,比如：海量数据无法处理、离线处理模式、处理时延长等。对日志数据采用分级归档,可以实现大数据的分级优化处理。本文通过提出在一种基于Hadoop的大数据日志分析模型,并对其业务处理流程以及功能架构进行深入分析,实验结果反映出该系统扩展性强、海量数据处理能力卓越、满足在线处理等,具有良好的可行性和有效性。