检索结果-内蒙古大学图书馆

3rd International Symposium on Intelligent Information Technology and Security Informatics

作者： Deng, Huifang Kang, Haiyan South China Univ Technol Sch Comp Sci & Engn Guangzhou 51006 Guangdong Peoples R China

ISBN: (纸本)9780769540207

In this paper, ONS (Object Naming System) architecture is studied, and the necessity of high performance RFID code resolving service is discussed. Then, ONS distributed network architecture is proposed, along with ONS-based distributed database, synchronous query, storage and calculation using ID as a primary key. High performance RFID coding resolving service system is designed and implemented. The simulation is done for the testing. The experimental results show that our model gained significant performance improvement and achieved millisecond-level time-consuming in resolution.

关键词： ONS distributed database EPC code resolution high-performing resolution network service

来源：评论

学校读者我要写书评

暂无评论

Indexing distributed and Heterogeneous Resources

Indexing Distributed and Heterogeneous Resources

引用

International Conference on U- and E-Service, Science and Technology

作者： Chromiak, Michal Stencel, Krzysztof Subieta, Kazimierz Marie Curie Sklodowska Univ Inst Comp Sci Lublin Poland Univ Warsaw Inst Informat Warsaw Poland Polish Japanese Inst Informat Technol Warsaw Poland Polish Acad Sci Inst Comp Sci Warsaw Poland

ISBN: (纸本)9783642176432

Indexing virtually integrated distributed, heterogeneous and defragmented resources is a serious challenge that so far was not even considered in the database literature. However, it is difficult to imagine that very large integrated resources (millions or billions of objects) can be processed without indexes. This paper presents the pioneering approach to solve the problem. Our idea is based on SBQL object-oriented virtual updatable views that are implemented in the ODRA system. SBQL views have full algorithmic power concerning mapping of stored objects into virtual ones and full algorithmic power in mapping updates addressing virtual objects into updates of stored objects. An important concept that allows to achieve that is called virtual identifier. Virtual identifiers can be used as non-key values in indexes. Because an integrator of distributed, heterogeneous and defragmented resources can be implemented as an SBQL view, it is possible to use its virtual identifiers to create any indexes addressing such resources. The paper presents the motivation for the research, explains the idea of SBQL views and presents the idea of such an index.

关键词： object-oriented database query language ODRA SBQL distributed database heterogeneous database query optimization index updatable view

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of the Earthquake Precursor Network Running Monitoring Software based on C/S Structure

Design and Implementation of the Earthquake Precursor Networ...

引用

6th International Conference on Wireless Communications, Networking and Mobile Computing (WICOM)

作者： Wang Jianguo Su Meiyan Zhao Guomin Liu Chungui Zhang Mingdong Wang Dahong Gao Xun Earthquake Adm Tianjin Municipal Tianjin 300201 Peoples R China Guilin Seism Stat Guilin Peoples R China Datong Univ Dept Comp Sci Datong Peoples R China

ISBN: (纸本)9781424437092

first, we introduce the design principles of the function of Tianjin earthquake precursor network running monitoring software;second, we have developed the software by using the precursor instrument communication technology, the distributed database read-write technology and data quality monitoring methods. The software regularly and automatically monitor network equipment status, data report situation, and abnormal data. It achieves the automatic detection and alarm function for the precursor instruments and observation data. The application of the software improves data quality and work efficiency.

关键词： C/S Structure Earthquake Precursor Network distributed database Monitoring and Alarming

来源：评论

学校读者我要写书评

暂无评论

A Multipurpose Global Passport Solution using IPv6

A Multipurpose Global Passport Solution using IPv6

引用

3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT)

作者： Murugesan, Raja Kumar Ramadass, Sureswaran Univ Sains Malaysia Natl Adv IPv6 Ctr NAv6 Minden 11800 Pulau Pinang Malaysia

ISBN: (纸本)9781424455379

This paper proposes to use a single unique global identity for every entity especially mankind, used for multiple purposes requiring only one IPv6 address to identify the entity. The IPv6 address assigned to a human entity can be used to identify the individual and coupled with the individuals biometric identity can access to the individuals records in a file stored in a distributed server. The IPv6 address assigned to an individual can be used to identify an individual, access an individuals personal record, medical record, locate the individual, communicate with the individual, perform transactions such as banking, debit or credit cards facilities, income tax, employment provident fund, pension, driving license, etc in a controlled manner.

关键词： IPv6 distributed database security RFID Global Unicast IPv6 address

来源：评论

学校读者我要写书评

暂无评论

Improved Integrity Constraints Checking in distributed databases by Exploiting Local Checking

引用

Journal of Computer Science & Technology 2009年第4期24卷 665-674页

作者： Ali A.Alwan Hamidah Ibrahim Nur Izura Udzir Department of Computer Science Faculty of Computer Science and Information TechnologyUniversiti Putra Malaysia 43400 SerdangMalaysia

Most of the previous studies concerning checking the integrity constraints in distributed database derive simplified forms of the initial integrity constraints with the sufficiency property, since the sufficient test is known to be cheaper than the complete test and its initial integrity constraint as it involves less data to be transferred across the network and can always be evaluated at the target site （single site）. Their studies are limited as they depend strictly on the assumption that an update operation will be executed at a site where the relation specified in the update operation is located, which is not always true. Hence, the sufficient test, which is proven to be local test by previous study, is no longer appropriate. This paper proposes an approach to checking integrity constraints in a distributed database by utilizing as much as possible the local information stored at the target site. The proposed approach derives support tests as an alternative to the existing complete and sufficient tests proposed by previous researchers with the intention to increase the number of local checking regardless the location of the submitted update operation. Several analyses have been performed to evaluate the proposed approach, and the results show that support tests can benefit the distributed database, where local constraint checking can be achieved.

关键词： distributed database integrity constraint checking integrity constraint integrity test

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Tuple Matching in distributed databases

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2009年第12期21卷 1767-1782页

作者： Sang, Yingpeng Shen, Hong Tian, Hui Univ Adelaide Sch Comp Sci Adelaide SA 5005 Australia Univ Adelaide Sch Math Sci Adelaide SA 5005 Australia

We address the problems of Privacy-Preserving Duplicate Tuple Matching (PPDTM) and Privacy-Preserving Threshold Attributes Matching (PPTAM) in the scenario of a horizontally partitioned database among N parties, where each patty holds a private share of the database's tuples and all tuples have the same set of attributes. In PPDTM, each party determines whether its tuples have any duplicate on other parties' private databases. In PPTAM, each party determines whether all attribute values of each tuple appear at least a threshold number of times in the attribute unions. We propose protocols for the two problems using additive homomorphic cryptosystem based on the subgroup membership assumption, e.g., Paillier's and EIGamal's schemes. By analysis on the total numbers of modular exponentiations, modular multiplications and communication bits, with a reduced computation cost which dominates the total cost, by trading off communication cost, our PPDTM protocol for the semihonest model is superior to the solution derivable from existing techniques in total cost. Our PPTAM protocol is superior in both computation and communication costs. The efficiency improvements are achieved mainly by using random numbers instead of random polynomials as existing techniques for perturbation, without causing successful attacks by polynomial interpolations. We also give detailed constructions on the required zero-knowledge proofs and extend our two protocols to the malicious model, which were previously unknown.

关键词： Privacy preservation distributed database secure computation zero-knowledge proof

来源：评论

学校读者我要写书评

暂无评论

Online recovery of a distributed database from malicious attack

Online recovery of a distributed database from malicious att...

引用

10th International database Engineering and Applications Symposium (IDEAS 2006)

作者： Chakraborty, A. Garg, M. K. Majumdar, A. K. Sural, S. Indian Inst Technol Dept Comp Sci & Engn Kharagpur 721302 W Bengal India Indian Inst Technol Sch Informat Technol Kharagpur 721302 W Bengal India

In this paper we consider the problem of recovery from committed malicious transactions in distributed databases. We define several useful dependency relations among transactions and based on them present an online re... 详细信息

ISBN: (纸本)9780769525778

关键词： distributed database Damage Assessment Online Recovery transaction dependency graph

来源：评论

学校读者我要写书评

暂无评论

Fast algorithm for mining global frequent itemsets based on distributed database

Fast algorithm for mining global frequent itemsets based on ...

引用

1st International Conference on Rough Sets and Knowledge Technology (RSKT 2006)

作者： He, Bo Wang, Yue Yang, Wu Chen, Yuan ChongQing Inst Technol Sch Comp Sci & Engn Chongqing 400050 Peoples R China

ISBN: (纸本)3540362975

There were some traditional algorithms for mining global frequent itemsets. Most of them adopted Apriori-like algorithm frameworks. This resulted a lot of candidate itemsets, frequent database scans and heavy communication traffic. To solve these problems, this paper proposes a fast algorithm for mining global frequent itemsets, namely the FMGFI algorithm. It can easily get the global frequency for any itemsets from the local FP-tree and require far less communication traffic by the searching strategies of top-down and bottom-up. It effectively reduces existing problems of most algorithms for mining global frequent itemsets. Theoretical analysis and experimental results suggest that the FMGFI algorithm is fast and effective.

关键词： global frequent itemsets distributed database FP-tree FP-growth

来源：评论

学校读者我要写书评

暂无评论

A New Design for Open and Scalable Collaboration of Independent databases in Digitally Connected Enterprises

引用

JOURNAL OF THE ASSOCIATION FOR INFORMATION SYSTEMS 2010年第7期11卷 367-393页

作者： Levermore, David M. Babin, Gilbert Hsu, Cheng Boeing Co Seattle WA 98124 USA HEC Montreal Dept Informat Technol Montreal PQ Canada Rensselaer Polytech Inst Troy NY USA

"Digitally connected enterprises" refers to e-business, global supply chains, and other new business designs of the Knowledge Economy;all of which require open and scalable information supply chains across independent enterprises. Connecting proprietarily designed and controlled enterprise databases in these information supply chains is a critical success factor for them. Previous connection designs tend to rely on "hard-coded" regimes, which do not respond well to disruptions (including changes and failures), and do not afford these enterprises sufficient flexibility to join simultaneously in multiple supply chain regimes and share information for the benefit of all. The paper develops a new design: It combines matchmaking with global database query, and thereby supports the interoperation of independent databases to form on-demand information supply chains. The design provides flexible (re) configuration to decrease the impact of disruption, and proactive control to increase collaboration and information sharing. More broadly, the papers results contribute to a new Information System design method for massively extended enterprises, and facilitate new business designs using digital connections at the level of databases.

关键词： Information Supply Chain Information System Design Information Matching and Collaboration distributed database Digital Connections Scaling

来源：评论

学校读者我要写书评

暂无评论

A Multipurpose Global Passport Solution using IPv6

A Multipurpose Global Passport Solution using IPv6

引用

2010 3rd IEEE International Conference on Computer Science and Information Technology—ICCSIT 2010

作者： Raja Kumar Murugesan Sureswaran Ramadass National Advanced IPv6 Centre（NAv6） Universiti Sains Malaysia 11800 Minden Pulau PinangMalaysia

This paper proposes to use a single unique global identity for every entity especially mankind,used for multiple purposes requiring only one IPv6 address to identify the *** IPv6 address assigned to a human entity can be used to identify the individual and coupled with the individuals biometric identity can access to the individuals records in a file stored in a distributed *** IPv6 address assigned to an individual can be used to identify an individual,access an individuals personal record,medical record,locate the individual,communicate with the individual,perform transactions such as banking,debit or credit cards facilities,income tax,employment provident fund,pension,driving license,etc in a controlled manner.

关键词： IPv6 distributed database security RFID Global Unicast IPv6 address

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：