With the system becoming more complex and workloads becoming more fluctuating, it is very hard for DBA to quickly analyze performance data and optimize the system, self optimization is a promising technique. A data mi...
详细信息
The paper describes the details of using J-SIM in main memory database parallel recovery simulation. In update intensive main memory database systems, I/O is still the dominant performance bottleneck. A proposal of pa...
详细信息
The paper describes the details of using J-SIM in main memory database parallel recovery simulation. In update intensive main memory database systems, I/O is still the dominant performance bottleneck. A proposal of parallel recovery scheme for large-scale update intensive main memory database systems is presented. Simulation provides a faster way of evaluating the new idea compared to actual system implementation. J-SIM is an open source discrete time simulation software package. The simulation implementation using J-SIM is elaborated in terms of resource modeling, transaction processing system modeling and workload modeling. Finally, with simulation results analyzed, the effectiveness of the parallel recovery scheme is verified and the feasibility of J-SIM's application in main memory database system simulation is demonstrated.
database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partit...
详细信息
ISBN:
(纸本)9781605586502
database-as-a-Service (DAS) is an emerging database management paradigm wherein partition based index is an effective way to querying encrypted data. However, previous research either focuses on one-dimensional partition or ignores multidimensional data distribution characteristic, especially sparsity and locality. In this paper, we propose Cluster based Onion Partition (COP), which is designed to decrease both false positive and dead space at the same time. Basically, COP is composed of two steps. First, it partition covered space level by level, which is like peeling of onion;second, at each level, a clustering algorithm based on local density is proposed to achieve local optimal secure partition. Extensive experiments on real dataset and synthetic dataset show that COP is a secure multidimensional partition with much less efficiency loss than previous top down or bottom up counterparts. Copyright 2009 ACM.
This paper addresses the problem of fault-tolerant many-to-one routing in static wireless networks with asymmetric links, which is important in both theoretical and practical aspects. The problem is to find a minimum ...
详细信息
Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advanta...
详细信息
Based on the analysis of problems and difficulties in apparel quotation system, this paper puts forward the combination of BPM and SOA as a new idea for analysis of apparel quotation system, according to their advantages in business goals and requirements analysis, and the corresponding services' definition, extraction, optimization and integration. Through the combination, system flexibility, rapidity and accuracy could be achieved. The establishment of Service Repository according to the business requirements, is a crucial part in the architecture, however there are no definite rules for service extraction. In this paper, the detailed activities and steps, as well as a specific establishment case is illustrated. At last, architecture based on BPM and SOA for the apparel trade quotation is put forward, and its composition and implement are also analyzed.
Based on the analysis of quote business processes, as well as the characteristics of SOA, a quotation system is brought forward based on SOA for apparel international trade, in order to enhance the Quote's diversi...
详细信息
Traditional web database cache techniques have a major disadvantage, namely poor data freshness, because they employ an asynchronous data refresh strategy. A novel web database cache, DB Façade, is proposed in th...
详细信息
In this paper, a rapid resynchronization method using intent logs is suggested for replication In-memory databases supporting mobile communication applications. Both the identifiers of unsynchronized segments and the ...
详细信息
Top-k queries in uncertain databases are quite popular and useful due to its wide application usage. However, compared to Top-k in traditional databases, queries over uncertain database are more complicated because of...
详细信息
Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these sy...
详细信息
ISBN:
(纸本)9781605584874
Social bookmarking systems and their emergent information structures, known as folksonomies, are increasingly important data sources for Semantic Web applications. A key question for harvesting semantics from these systems is how to extend and adapt traditional notions of similarity to folksonomies, and which measures are best suited for applications such as navigation support, semantic search, and ontology learning. Here we build an evaluation framework to compare various general folksonomy-based similarity measures derived from established information-theoretic, statistical, and practical measures. Our framework deals generally and symmetrically with users, tags, and resources. For evaluation purposes we focuson similarity among tags and resources, considering different ways to aggregate annotations across users. After comparing how tag similarity measures predict user-created tag relations, we provide an external grounding by user-validated semantic proxies based on WordNet and the Open Directory. We also investigate the issue of scalability. We find that mutual information with distributional micro-aggregation across users yields the highest accuracy, but is not scalable;per-user projection with collaborative aggregation provides the best scalable approach via incremental computations. The results are consistent across resource and tag similarity. Copyright is held by the International World Wide Web Conference Committee (IW3C2).
暂无评论