Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
303
Rainbow Table Optimization for Password Recovery
"... Abstract—As users become increasingly aware of the need to adopt strong password, it also brings challenges to digital forensics investigators due to the password protection of potential evidence data. In this paper, we discuss existing password recovery methods and present a design of a time-memory ..."
Abstract
- Add to MetaCart
that we are able to optimize the rainbow table performance through an improvement of up to 26.13 % in terms of password recovery success rate, and an improvement of up to 28.57 % in terms of storage conservation, compared to the original rainbow tables.
Rainbow: Multi-XQuery Optimization Using Materialized XML Views
- In SIGMOD Demo
, 2003
"... ger XAT Table SQL Query XQuery XQuery Update Global Query Optimizer File System Network Native XML Storage Storage Manager RDBMS Figure 1: Architecture of the Rainbow System. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted ..."
Abstract
-
Cited by 21 (9 self)
- Add to MetaCart
ger XAT Table SQL Query XQuery XQuery Update Global Query Optimizer File System Network Native XML Storage Storage Manager RDBMS Figure 1: Architecture of the Rainbow System. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted
Optimization storage of Frequency table in Universal Combinatorial Coding
"... Abstract—Universal combinatorial coding is a unique coding. It is based on the principle of permutation and combination. It has the multiple coding features and has a wide variety of applications. The sequence is handled by universal combinatorial coding and the result includes the ordinal, the freq ..."
Abstract
- Add to MetaCart
. The experiment shows that the frequency table storage method advanced in this paper can improve storage efficiency and save the coding information space. Keywords- universal combinatorial coding; frequency table; compression; Optimization; statistics I.
Tolerating Multiple Failures in RAID Architectures with Optimal Storage and Uniform Declustering
- In Proceedings of the 24th International Symposium on Computer Architecture
, 1996
"... We present Datum, a novel method for tolerating multiple disk failures in disk arrays. Datum is the first known method that can mask any given number of failures, requires an optimal amount of redundant storage space, and spreads reconstruction accesses uniformly over disks in the presence of failur ..."
Abstract
-
Cited by 51 (6 self)
- Add to MetaCart
We present Datum, a novel method for tolerating multiple disk failures in disk arrays. Datum is the first known method that can mask any given number of failures, requires an optimal amount of redundant storage space, and spreads reconstruction accesses uniformly over disks in the presence
Jena property table implementation
- In SSWS
, 2006
"... A common approach to providing persistent storage for RDF is to store statements in a three-column table in a relational database system. This is commonly referred to as a triple store. Each table row represents one RDF statement. For RDF graphs with frequent patterns, an alternative storage scheme ..."
Abstract
-
Cited by 43 (0 self)
- Add to MetaCart
A common approach to providing persistent storage for RDF is to store statements in a three-column table in a relational database system. This is commonly referred to as a triple store. Each table row represents one RDF statement. For RDF graphs with frequent patterns, an alternative storage scheme
DualTable: A Hybrid Storage Model for Update Optimization in Hive
"... Hive is the most mature and prevalent data warehouse tool provid-ing SQL-like interface in the Hadoop ecosystem. It is successfully used in many Internet companies and shows its value for big data processing in traditional industries. However, enterprise big data processing systems as in Smart Grid ..."
Abstract
- Add to MetaCart
data manipulation efficiently and Hive on HBase suffers from poor query performance even though it can support faster data manipulation. In this paper, we propose a hybrid storage model called Du-alTable, which combines the efficient streaming reads of HDFS and the random write capability of HBase
DualTable: A Hybrid Storage Model for Update Optimization in Hive
"... Abstract—Hive is the most mature and prevalent data ware-house tool providing SQL-like interface in the Hadoop ecosys-tem. It is successfully used in many Internet companies and shows its value for big data processing in traditional industries. However, enterprise big data processing systems as in S ..."
Abstract
- Add to MetaCart
extension adopts same data storage format on HDFS, the update performance problem is not solved. In this paper, we propose a hybrid storage model called DualTable, which combines the efficient streaming reads of HDFS and the random write capability of HBase. Hive on DualTable provides better data
Query Optimization Techniques for Partitioned Tables
"... Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. From their traditional use in improving query performance, partitioning strategies have evolved into a powerful mechanism to improve the overall manageability of database sys ..."
Abstract
-
Cited by 9 (3 self)
- Add to MetaCart
systems. Table partitioning simplifies administrative tasks like data loading, removal, backup, statistics maintenance, and storage provisioning. Query language extensions now enable applications and user queries to specify how their results should be partitioned for further use. However, query
Join Optimization Techniques for Partitioned Tables
"... Table partitioning splits a table into smaller parts that can be accessed, stored, and maintained independent of one another. The main use of partitioning used to be in reducing the time to access large base tables in parallel systems. Partitioning has evolved into a powerful mechanism to improve th ..."
Abstract
- Add to MetaCart
to specify how derived tables should be partitioned. However, query optimization techniques have not kept pace with the rapid advances in usage and user control of table partitioning. We address this gap by developing new techniques to generate efficient plans for SQL queries involving multiway joins over
TETRIS-HASHING or Optimal Table Compression
"... In this paper, we present a new method for mapping a static set of n keys, each an integer between 0 and N \Gamma 1, into a hash table of size n without any collision. Our data structure requires only an additional array of n integers, each less than n, and achieves a worst case lookup time of O(1). ..."
Abstract
- Add to MetaCart
). This method is based on a randomized compression scheme, and it finds a minimal perfect hash function in average time O(n). Our concept can be easily adapted for dynamic key sets. Then, the hash table has no longer minimal size but the storage location remains very small. Because of its simplicity our
Results 1 - 10
of
303
