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

A DYNAMIC AND INTEGRATED CONCURRENCY-CONTROL FOR distributed databases

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1989年第3期7卷 364-374页

作者： PONS, JF VILAREM, JF Centre de Recherche en Informatique de Montpellier Universite de Montpellier II Montpellier France

An integrated approach to concurrency control adaptively allows classical pessimistic (two-phase locking) or optimistic (using certification) approaches. The principles for a distributed integrated method controlling both locking and optimistic transactions are defined. The implementation of these principles leads to a method for constructing the serialization order of transactions, using their conflicts. This dynamic construction prevents the systematic rejection of old (long) readers, as in the multiversion methods. On the other hand, applying Thomas' rule to control the write conflicts permits the presence of old (long) writers.< >

关键词： Concurrency control distributed databases Transaction databases Certification Passive optical networks Optimization methods Centralized control Data structures Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Enabling Encrypted Boolean Queries in Geographically distributed databases

引用

IEEE TRANSACTIONS ON PARALLEL AND distributed SYSTEMS 2020年第3期31卷 634-646页

作者： Yuan, Xu Yuan, Xingliang Zhang, Yihe Li, Baochun Wang, Cong Univ Louisiana Lafayette Sch Comp & Informat Lafayette LA 70504 USA Monash Univ Fac Informat Technol Clayton Vic 3800 Australia Univ Toronto Dept Elect & Comp Engn Toronto ON M5S Canada City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

The persistent growth of big data applications has being raising new challenges in managing large volumes of datasets with high scalability, confidentiality protection, and flexible types of search queries. In this paper, we propose a secure design to disassemble the private dataset with the aim to store them across geographically distributed servers while supporting secure multi-client Boolean queries. In this design, the data owner encrypts the private database with the searchable index attributes. The encrypted dataset will be disassembled and distributed evenly across multiple servers by leveraging the property of a distributed index framework. By constructing an encryption structure, generating search tokens, and enabling parallel query, we show how the proposed design performs the secure while efficient Boolean search. These queries are not only limited to those initiated by the data owner but also can be extended to support multiple authorized clients, where each client is allowed to access a necessary part of the private database. In this stage, we advocate a non-interactive authorization scheme where data owner is not required to stay online to process the query request. Moreover, the query operation can be executed in parallel, which significantly improves the search efficiency. We formally characterize the leakage profile, which allow us to follow the existing security analysis method to demonstrate that our system can guarantee data confidentiality and query privacy. To validate our protocol, we implement a system prototype and evaluate the efficiency of our construction. Through experimental results, we demonstrate the effectiveness of our protocol in terms of data outsourcing time and Boolean query time.

关键词： Servers distributed databases Cloud computing Indexes Encryption Data privacy Searchable symmetric encryption multi-client data access key-value stores Boolean query

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving association rule mining over distributed databases using genetic algorithm

引用

NEURAL COMPUTING & APPLICATIONS 2013年第1期22卷 S351-S364页

作者： Keshavamurthy, Bettahally N. Khan, Asad M. Toshniwal, Durga Indian Inst Technol Dept Elect & Comp Engn Roorkee Uttarakhand India

Privacy preservation in distributed database is an active area of research. With the advancement of technology, massive amounts of data are continuously being collected and stored in distributed database applications. Indeed, temporal associations and correlations among items in large transactional datasets of distributed database can help in many business decision-making processes. One among them is mining frequent itemset and computing their association rules, which is a nontrivial issue. In a typical situation, multiple parties may wish to collaborate for extracting interesting global information such as frequent association, without revealing their respective data to each other. This may be particularly useful in applications such as retail market basket analysis, medical research, academic, etc. In the proposed work, we aim to find frequent items and to develop a global association rules model based on the genetic algorithm (GA). The GA is used due to its inherent features like robustness with respect to local maxima/minima and domain-independent nature for large space search technique to find exact or approximate solutions for optimization and search problems. For privacy preservation of the data, the concept of trusted third party with two offsets has been used. The data are first anonymized at local party end, and then, the aggregation and global association is done by the trusted third party. The proposed algorithms address various types of partitions such as horizontal, vertical, and arbitrary.

关键词： Privacy preservation distributed databases Genetic algorithm Association rules mining Trusted third-party computation

来源：评论

学校读者我要写书评

暂无评论

QUERYING distributed databases ON LOCAL AREA NETWORKS

引用

PROCEEDINGS OF THE IEEE 1987年第5期75卷 563-572页

作者： HEVNER, AR YAO, SB Database Systems Research Center College of Business and Management University of Maryland College Park MD USA

distributed databases on local area networks present additional considerations for query optimization over databases on geographically distributed, point-to-point networks. This paper surveys and evaluates the state of current research on distributed query optimization for local area networks. A classification taxonomy is presented and used to analyze the proposed query-optimization algorithms. The unique features of each algorithm are highlighted and a qualitative comparison of the algorithms is given. Future research directions are discussed.

关键词： distributed databases Local area networks Query processing Data communication Database systems Protocols Spatial databases Cost function Microcomputers Network topology

来源：评论

学校读者我要写书评

暂无评论

A framework and test-suite for assessing approaches to resolving heterogeneity in distributed databases

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2000年第7期42卷 505-515页

作者： El-Khatib, HT Williams, MH MacKinnon, LM Marwick, DH Heriot Watt Univ Dept Comp & Elect Engn Edinburgh EH14 4AS Midlothian Scotland

The problem of connecting together a number of different databases to produce an integrated information system has attracted a considerable amount of attention over the years and various approaches have been developed to handle this. However, the general problem of gathering related information from a number of existing heterogeneous databases is complex because of the differences in representation and meaning of data in different data sets. Many different approaches have been described to resolve this problem, and some prototype systems built. However, it is difficult to compare the effectiveness of different approaches and prototypes. This paper is aimed at addressing the specific issue of assessing the generality of different approaches. To this end it presents a framework for classifying the differences between data in different databases and a test-suite which can be used to evaluate and compare the extent to which different approaches handle different aspects of this heterogeneity. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： distributed databases linking databases heterogeneous databases

来源：评论

学校读者我要写书评

暂无评论

Knowledge discovery by probabilistic clustering of distributed databases

引用

DATA & KNOWLEDGE ENGINEERING 2005年第2期54卷 189-210页

作者： McClean, S Scotney, B Morrow, P Greer, K Univ Ulster Sch Comp & Informat Engn Coleraine BT52 1SA Londonderry North Ireland

Clustering of distributed databases facilitates knowledge discovery through learning of new concepts that characterise common features and differences between datasets. Hence, general patterns can be learned rather than restricting learning to specific databases from which rules may not be generalisable. We cluster databases that hold aggregate count data on categorical attributes that have been classified according to homogeneous or heterogeneous classification schemes. Clustering of datasets is carried out via the probability distributions that describe their respective aggregates. The homogeneous case is straightforward. For heterogeneous data we investigate a number of clustering strategies, of which the most efficient avoid the need to compute a dynamic shared ontology to homogenise the classification schemes prior to clustering. (c) 2004 Elsevier B.V. All rights reserved.

关键词： distributed databases probabilistic clustering aggregates dynamic shared ontology

来源：评论

学校读者我要写书评

暂无评论

A low-cost checkpointing technique for distributed databases

引用

distributed AND PARALLEL databases 2001年第3期10卷 241-268页

作者： Lin, JL Dunham, MH So Methodist Univ Dept Comp Sci & Engn Dallas TX 75275 USA

For distributed databases, checkpointing is used to ensure an efficient way to perform global reconstruction. However, the need for global reconstruction is infrequent. Most current checkpointing approaches for distributed databases are too expensive during run time. Some of them allow the checkpointing process to run in parallel with normal transactions at the cost of more data and resource contention, which in turn causes longer response time for normal transactions. Thus, an efficient way to checkpoint distributed databases is needed to avoid degrading the system performance. This paper presents a low-cost solution, called Loosely Synchronized Local Fuzzy Checkpointing (LSLFC), to these problems. LSLFC supports global reconstruction, and our performance study shows that LSLFC has little overhead during run time.

关键词： distributed databases checkpointing fuzzy checkpoint global reconstruction

来源：评论

学校读者我要写书评

暂无评论

AN ALGORITHM FOR CONCURRENCY-CONTROL AND RECOVERY IN REPLICATED distributed databases

引用

ACM TRANSACTIONS ON DATABASE SYSTEMS 1984年第4期9卷 596-615页

作者： BERNSTEIN, PA GOODMAN, N Sequoia Systems Inc.

In a one-copy distributed database, each data item is stored at exactly one site. In a replicated database, some data items may be stored at multiple sites. The main motivation is improved reliability: by storing important data at multiple sites, the DBS can operate even though some sites have *** paper describes an algorithm for handling replicated data, which allows users to operate on data so long as one copy is “available.” A copy is “available” when (i) its site is up, and (ii) the copy is not out-of-date because of an earlier *** algorithm handles clean, detectable site failures, but not Byzantine failures or network partitions.

关键词： continuous operation distributed databases replicated databases Serializability transaction processing

来源：评论

学校读者我要写书评

暂无评论

CONTROL ARCHITECTURE FOR NEXT-GENERATION COMMUNICATION-NETWORKS BASED ON distributed databases

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 1989年第3期7卷 418-423页

作者： MURAKAMI, K KATOH, M Fujitsu Laboratories Limited Kawasaki Japan

Intelligent routing control is defined as the process in which the network interrogates the databases containing the relationships between logical numbers, such as personal or information identifiers, and physical addresses in the transport network to find the terminal having the information required to process a user request. The routing control system presented uses distributed databases, each of which manages a switching system and all of which are connected through high-speed signalling networks separate from the transport network. If the requested physical address cannot be found in one database, search requests are distributed at the same time to all other databases. For up to 100 million subscribers, the routing control system can find a physical address within 1 s when each database uses ten memories accessed at 200 ns with an interdatabase linkage speed of 14 Mb/s.< >

关键词： Communication system control Next generation networking Communication networks Routing distributed databases Control systems Intelligent control Deductive databases Intelligent networks Switching systems

来源：评论

学校读者我要写书评

暂无评论

PARALLEL CYCLE DETECTION IN distributed databases

引用

INFORMATION SYSTEMS 1990年第5期15卷 555-566页

作者： SCHALL, E Institut für Informatik Freie Universität Berlin Nestorstraβe 8–9 D-1000 Berlin 31 F.R.G.

A deadlock detection algorithm is presented, by which each node in a network can decide locally whether a deadlock exists. Besides the problem of deadlock detection, we also take into account the problem of cycle detection in graphs distributed over several nodes. This problem arises in several locking protocols like the RAC-locking protocol in a distributed environment. The proposed algorithm is based on the idea of sending relevant paths of the wait-for graph by broadcast messages to each other node requiring only one physical transmission. In order to detect deadlocks only locally each node collects all paths sent in a local graph. As this graph has to be equal within all nodes a protocol has been developed which is responsible for ensuring equality. Finally, we determine the overhead caused by this protocol within the network. Besides, we also propose a broadcast two-phase commit protocol exploiting the facility of a broadcast message.

关键词： distributed deadlock detection multiversion locking distributed databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：