网上购物系统数据库与数据仓库的比较分析

比较了数据库及数据仓库,通过网上购物系统平台的研究,分析了两者在数据信息处理中的异同,从而达到让网上购物更加完善、更加便捷地为用户服务的目的。     

高校资产管理系统的设计与研究

设计了适合衢州职业技术学院固定资产日常管理工作的资产管理系统.对该系统作了需求分析和详细设计,采用了ASP.NET框架技术和SQL Server后台数据库相结合的设计方法.系统基本实现了资产的登记、审核、查询、变更、统计、打印报表、上报数据等功能,有效地解决了资产管理工作的数据混乱、不准确、处理流程不规范等问题,有效地提高了管理人员的工作效率.     

中医方剂与图集的转换方法

中药复方数据挖掘研究是将我国丰富的中药信息资源和现代最新信息技术相结合的重要内容,它意味着基于中医理论,利用知识发现技术,对传统中药新药、中医组方理论及规律、中药作用机制、有效成分构效关系等多个方面进行全面、系统的研究。图作为一种经典的数据结构,被广泛用于复杂数据结构分析与建模。文章探讨了图建模技术并实现了中医方剂与图集的转换。     

海量数据库迁移与升级

目前数据库中数据越来越多,应用对数据库在线时间的要求也越来越高,使得数据库迁移和数据库升级成为了一件非常困难的事情.为此,介绍了几种迁移和升级的方法,用以实现以尽可能少的停机时间对TB级数据库完成数据库的迁移和升级.     

数字化校园综合查询服务平台的设计与研究

本文在对数字化校园中心共享数据库及公共数据交换平台的研究基础之上设计了一种综合查询服务平台架构及查询服务功能,同时分析了查询实现过程。     

Register allocation for write activity minimization on non-volatile main memory for embedded systems

Non-volatile memories are good candidates for DRAM replacement as main memory in embedded systems and they have many desirable characteristics. Nevertheless, the disadvantages of non-volatile memory co-exist with its advantages. First, the lifetime of some of the non-volatile memories is limited by the number of erase operations. Second, read and write operations have asymmetric speed or power consumption in non-volatile memory. This paper focuses on the embedded systems using non-volatile memory as main memory. We propose register allocation technique with re-computation to reduce the number of store instructions. When non-volatile memory is applied as the main memory, reducing store instructions will reduce write activities on non-volatile memory. To re-compute the spills effectively during register allocation, a novel potential spill selection strategy is proposed. During this process, live range splitting is utilized to split certain long live ranges such that they are more likely to be assigned into registers. In addition, techniques for re-computation overhead reduction is proposed on systems with multiple functional units. With the proposed approach, the lifetime of non-volatile memory is extended accordingly. The experimental results demonstrate that the proposed technique can efficiently reduce the number of store instructions on systems with non-volatile memory by 33% on average.     

Unseen users, unknown systems: Computer design for a scholar's dictionary

The Dictionary of Old English computing systems have provided access since the 1970s to a database of approximately three million running words. These systems, designed for a variety of machines and written in a variety of languages, have until recently been planned with computing center billing algorithms in mind. With personal workstations emphasis has shifted to building more elegant user interfaces and to providing the entire DOE database to editors around the world. While the shift from sequential files to random access files and the provision of extensive development tools have changed some of the design process, error checking and protection of the database against accidental intrusion have remained as central issues.Richard L. Venezky is Unidel Professor of Educational Studies and professor of Computer and Information Sciences at the University of Delaware. He was formerly professor and chair of Computer Sciences at the University of Wisconsin. His research interests include writing systems, literacy, knowledge representation, and computer-assisted instruction. Among his recent publications are The Subtle Danger: Reflections on the Literacy Abilities of America's Young Adults (Princeton, NJ: ETS, 1987), and Steps Towards a Modern History of American Reading Instruction (Review of Research in Education, 1986, vol. 13, 129–70).     

Supporting inconsistent rules in database systems

When a set of rules generates (conflicting) values for a virtual attribute of some tuple, the system must resolve the inconsistency and decide on a unique value that is assigned to that attribute. In most current systems, the conflict is resolved based on criteria that choose one of the rules in the conflicting set and use the value that it generated. There are several applications, however, where inconsistencies of the above form arise, whose semantics demand a different form of resolution. We propose a general framework for the study of the conflict resolution problem, and suggest a variety of resolution criteria, which collectively subsume all previously known solutions. With several new criteria being introduced, the semantics of several applications are captured more accurately than in the past. We discuss how conflict resolution criteria can be specified at the schema or the rule-module level. Finally, we suggest some implementation techniques based on rule indexing, which allow conflicts to be resolved efficiently at compile time, so that at run time only a single rule is processed.An earlier version of this work appeared under the title Conflict Resolution of Rules Assigning Values to Virtual Attributes inProceedings of the 1989 ACM-Sigmod Conference, Portland, OR, June 1989, pp. 205–214.Partially supported by the National Science Foundation under Grant IRI-9157368 (PYI Award) and by grants from DEC, HP, and AT&T.Partially supported by the National Science Foundation under Grant IRI-9057573 (PYI Award), IBM, DEC, and the University of Maryland Institute for Advanced Computer Studies (UMIACS).     

对SQL Server数据库的安全和管理策略探讨

自微软公司推出SQL Server关系数据库管理系统以来,其在越来越多的电子商务网站和企业信息平台中得以广泛使用。然而与之相关的信息安全问题也日益凸现和受到用户的密切关注。因此,为了保护SQL Server数据库避免来自各种途径的安全威胁,保障信息的安全,本文对其安全机制、安全策略和保障其安全的管理策略进行了探讨,提出了相应的解决措施和办法,以供参考。