Filters








1,281 Hits in 3.5 sec

Security of new generation computing systems

Li Xu, Elisa Bertino, Yi Mu
2013 Concurrency and Computation  
a special double-trapdoor chameleon hash function is used.  ...  The security reduction is tight, and the scheme is free of chameleon hashing.  ... 
doi:10.1002/cpe.3128 fatcat:k5fgqbtdx5g77fmx6z5rtszuwi

A survey of P2P multidimensional indexing structures [article]

Ewout Bongers, Johan Pouwelse
2015 arXiv   pre-print
Traditional databases have long since reaped the benefits of multidimensional indexes. Numerous proposals in the literature describe multidimensional index designs for P2P systems.  ...  Several proposals for P2P multidimensional indexes are reviewed and analyzed. Znet and VBI-tree are the most promising from a technical standpoint.  ...  By using locality preserving hashes the Multi-Attribute Addressable Network (MAAN) [4] aims to do just that. With locality preserving hashing, dimensions are directly mapped to a linear space.  ... 
arXiv:1507.05501v1 fatcat:lf5zbvnklnda7ofjrkgyhrs3au

Combinatorics for computer science

2003 Computers and Mathematics with Applications  
Suggestions on how to use this book.Study guide for Part I: Linear order. Study guide for Part II: Graphs, trees, and recursion. Part I: Linear order. 1. Basic concepts for linear order. 2.  ...  Equality, comparison, and hash codes. 20.9. The utility class collections. 20.10. Choosing the right collection class or map class. 21. Input and output. 21.1.  ... 
doi:10.1016/s0898-1221(03)90069-1 fatcat:qez3ttftcbgy5onwxayexsta3m

Multikey, extensible hashing for relational databases

K.L. Kelley, M. Rusinkiewicz
1988 IEEE Software  
Our preliminary evaluation indicates that for many queries the performance of multikey, extensible hashing is no worse than that of indexed sequential filesand in uly 1988 Kelleyis nowwith IBM'sSystemsIntegration  ...  n important feature of modern database systems is the data inde-A pendence that lets users access information without regard for how the data is organized and accessed in secondary storage.  ...  In our approach we use the multikey scheme to implement an implicit multidimensional array scheme.  ... 
doi:10.1109/52.17804 fatcat:tvpenv7xw5an7ajvvp7lz7dusi

Page 3946 of Mathematical Reviews Vol. , Issue 92g [page]

1992 Mathematical Reviews  
way, called ‘hashing with lazy deletion’.  ...  Summary: “We propose a formal model of concurrency control in object bases.  ... 

Capsule Reviews

2005 Computer journal  
This rejection rule is exploited in the given hashing algorithm. An estimation of the performance of the hashing algorithm is given.  ...  The number of required access can be reduced if the values of a hash function are stored in the main memory, the records of a database are stored in an external memory and a working memory is used for  ...  In these models synchronized concurrent access can be enabled in a pipelined fashion.  ... 
doi:10.1093/comjnl/bxh069 fatcat:7mgwvsfdbnc3tjhkyvjhr3w7by

DEVELOPMENT AND RESEARCH OF CRYPTOGRAPHIC HASH FUNCTIONS BASED ON TWO-DIMENSIONAL CELLULAR AUTOMATA

Yuliya Tanasyuk, Sergey Ostapov
2018 Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska  
To perform pseudorandom permutation in round transformation function several combinations of CA rules 30, 54, 86, 150 and 158 have been proposed.  ...  The developed hashing mechanism provides effective parallel processing, ensures good statistical and scattering properties, enables one to obtain hash of a varying length and reveals strong avalanche effect  ...  In order to enhance performance, selected rules were applied to the entire rows concurrently, rather than to single bits.  ... 
doi:10.5604/01.3001.0010.8638 fatcat:xsu7c2tv4jctlfbvzntu3ntzb4

Multidimensional access methods

Volker Gaede, Oliver Günther
1998 ACM Computing Surveys  
More than ten years of spatial database research have resulted in a great variety of multidimensional access methods to support such operations. We give an overview of that work.  ...  Search operations in databases require special support at the physical level.  ...  Unlike multidimensional extendible hashing, multidimensional linear hashing uses no or only a very small directory.  ... 
doi:10.1145/280277.280279 fatcat:ov5vnh5finf3lmaakusnullphy

A Generic Framework for Internet-Based Interactive Applications of High-Resolution 3-D Medical Image Data

Danzhou Liu, K.A. Hua, K. Sugaya
2008 IEEE Transactions on Information Technology in Biomedicine  
Furthermore, in order to better support concurrent accesses and to improve the average response time, we also propose techniques for efficient query processing, incremental transmission, and client sharing  ...  with remote high-resolution 3-D medical image data for many concurrent users.  ...  Hilbert curve [12] - [15] is a space filling technique that maps a multidimensional data space into a 1-D data space; that is, it defines a linear order to visit every data bucket in the 3-D space exactly  ... 
doi:10.1109/titb.2008.923770 pmid:18779076 fatcat:ho2zgqzg6vc6vpe3njegstrx6q

Page 2646 of Mathematical Reviews Vol. , Issue 2001D [page]

2001 Mathematical Reviews  
Clarkson, Nearest neighbor queries in metric spaces (609-617 (electronic)); Piotr Indyk, Rajeev Motwani, Prabhakar Raghavan and San- tosh Vempala, Locality-preserving hashing in multidimensional spaces  ...  external memory (extended abstract) (540-548 electronic)); Noam Nisan and Ziv Bar-Yossef, Pointer jumping requires concurrent read (549-558 (electronic)); James Aspnes, Lower bounds for distributed coin-flipping  ... 

Geographical Asynchronous Information Access for Distributed Systems [article]

Ali Elouafiq, Redouan Abid
2014 arXiv   pre-print
In this paper, we present GAIA, a novel model for retrieving and managing correlated geo-localized data in the cloud environment.  ...  The other models have a linear efficiency of O(n). The presented model is designed from the ground up to support GIS and is designed to suit both cloud and parallel computing.  ...  Also, this method can improve Quad trees, R-trees, or R+trees for multidimensional data retrieval.  ... 
arXiv:1406.2644v1 fatcat:h3xgy4higvdn5irs2iwogf74qi

A scalable, efficient scheme for evaluation of stencil computations over unstructured meshes

James King, Robert M. Kirby
2013 Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13  
and concurrent execution.  ...  Stencil computations are a common class of operations that appear in many computational scientific and engineering applications.  ...  Solutions are often evaluated at a set of points extracted from the mesh which form a multidimensional grid.  ... 
doi:10.1145/2503210.2503214 dblp:conf/sc/0007K13 fatcat:nycucp7l2fbvtm2qbm53wkol5u

Data-Parallel Hashing Techniques for GPU Architectures [article]

Brenton Lessley
2018 arXiv   pre-print
Hash tables are one of the most fundamental data structures for effectively storing and accessing sparse data, with widespread usage in domains ranging from computer graphics to machine learning.  ...  This study surveys the state-of-the-art research on data-parallel hashing techniques for emerging massively-parallel, many-core GPU architectures.  ...  In PSH, a minimal perfect hash function and table are constructed over a sparse set of multidimensional spatial data, while simultaneously ensuring locality of reference and coherence among hashed points  ... 
arXiv:1807.04345v1 fatcat:hjqikv3wjfgahavy3lbweolhh4

The grid file: An adaptable, symmetric multi-key file structure [chapter]

J. Nievergelt, H. Hinterberger, K. C. Sevcik
1981 Lecture Notes in Computer Science  
They manifest various deficiencies in particular for multikey access to highly dynamic files.  ...  We discuss in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.  ...  This is a multidimensional generalization of Litwin's linear hashing [16] , and relates to the grid file as linear hashing relates to extendible hashing [6] -the correspondence between regions (grid  ... 
doi:10.1007/3-540-10885-8_45 fatcat:kj4n3qk6ofegheoaakiyto54bu

The Grid File: An Adaptable, Symmetric Multikey File Structure

J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik
1984 ACM Transactions on Database Systems  
They manifest various deficiencies in particular for multikey access to highly dynamic files.  ...  We discuss in detail the design decisions that led to the grid file, present simulation results of its behavior, and compare it to other multikey access file structures.  ...  This is a multidimensional generalization of Litwin's linear hashing [16] , and relates to the grid file as linear hashing relates to extendible hashing [6] -the correspondence between regions (grid  ... 
doi:10.1145/348.318586 fatcat:hzlg2b7ebjavjbyk2cxugnzdxi
« Previous Showing results 1 — 15 out of 1,281 results