97 Hits in 2.1 sec

Current practice in the evaluation of multikey search algorithms

C. M. Eastman
1983 SIGIR Forum  
Current Practice Current practice in the evaluation of multikey search algorithms was examined by surveying the approaches to evaluation used in articles published in selected archival journals which publish  ...  All papers appearing in those journals during this five year period which were about the description, use, or evaluation of multikey search algorithms were selected.  ...  Veni Mad~avan, "Performance evaluation of attribute-based tree organization", ACM TODS, Vol 5, NO i, Mar 1980, pp69-87.  ... 
doi:10.1145/1013230.511823 fatcat:52offt6ghbh4vf5ruvc4chpbiq

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.  ...  The expected number of bucket accesses required for thejoin algorithm is 3,248 and 33 1 for files 1 and 2, respectively, significantly less than Experimental evaluation Multikey, extensible hashing  ... 
doi:10.1109/52.17804 fatcat:tvpenv7xw5an7ajvvp7lz7dusi

Cache-conscious sorting of large sets of strings with dynamic tries

Ranjan Sinha, Justin Zobel
2005 ACM Journal of Experimental Algorithmics  
Ongoing changes in computer performance are affecting the efficiency of string sorting algorithms.  ...  The size of main memory in typical computers continues to grow, but memory accesses require increasing numbers of instruction cycles, which is a problem for the most efficient of the existing string-sorting  ...  In the context of burst tries, and in work completed more recently, we have evaluated the effect of varying parameters.  ... 
doi:10.1145/1005813.1041517 fatcat:xdyz5k3ib5ctplt3kfmpv7vzuq

The Grid File: An Adaptable, Symmetric Multikey File Structure

J. Nievergelt, Hans Hinterberger, Kenneth C. Sevcik
1984 ACM Transactions on Database Systems  
This leads to the notions of a grid partition of the search space and of a grid directory, which are the keys to a dynamic file structure called the grid file.  ...  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.  ...  Willinger for writing an early version of the simulation program, and to the following people for communicating to us their experiences about ongoing implementations of the grid file: K.  ... 
doi:10.1145/348.318586 fatcat:hzlg2b7ebjavjbyk2cxugnzdxi

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

J. Nievergelt, H. Hinterberger, K. C. Sevcik
1981 Lecture Notes in Computer Science  
This leads to the notions of a grid partition of the search space and of a grid directory, which are the keys to a dynamic file structure called the grid file.  ...  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.  ...  Willinger for writing an early version of the simulation program, and to the following people for communicating to us their experiences about ongoing implementations of the grid file: K.  ... 
doi:10.1007/3-540-10885-8_45 fatcat:kj4n3qk6ofegheoaakiyto54bu

Bibliometrics of Machine Learning Research Using Homomorphic Encryption

Zhigang Chen, Gang Hu, Mengce Zheng, Xinxia Song, Liqun Chen
2021 Mathematics  
The analysis results show that China, the US, and India have generated almost half of all the research contributions in HEML.  ...  The results show a relative increase in the number of papers published each year that involve both homomorphic cryptography and machine learning.  ...  Introduction Machine learning algorithms based on deep neural networks are gaining increasing attention as a breakthrough in the development of artificial intelligence, which is the mainstream of current  ... 
doi:10.3390/math9212792 fatcat:6gqytapiibdvfbn64wl7ou5sqi

An implicit data structure for searching a multikey table in logarithmic time

Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
1991 Journal of computer and system sciences (Print)  
The theoretical tools we develop also yield a more practical way to halve the number of memory references used in obvious non-implicit solutions to the multikey table problem.  ...  We describe an implicit data structure for storing n k-key records, which supports searching for a record, under any key, in the asymptotically optimal search time O(lg n).  ...  ACKNOWLEDGMENTS The authors thank Eli Upfal for bringing together the clusters of California and New York authors, who were originally working independently on the same problem.  ... 
doi:10.1016/0022-0000(91)90022-w fatcat:52hmweufp5bgti4mv5tssqdsxe

Computer Network Confidential Information Security Based on Big Data Clustering Algorithm

Weigang Liu, Jun Ye
2022 Wireless Communications and Mobile Computing  
Attacks on network systems are becoming more and more common, the current state of increasingly sophisticated attack methods, the emergence of intrusion prevention technology is the inevitable result of  ...  In order to ensure the security of computer network confidential information, the authors propose a semisupervised clustering intrusion detection algorithm.  ...  In order to evaluate the performance of intrusion detection methods, the experiment adopts detection rate and false alarm rate as the metrics of algorithm performance.  ... 
doi:10.1155/2022/4927504 fatcat:kuyiqteooncktpk23eezkfxbte

Applicability of Homomorphic Encryption and CryptDB in Social and Business Applications: Securing Data Stored on the Third Party Servers while Processing through Applications

Kurra Mallaiah, S. Ramachandram
2014 International Journal of Computer Applications  
Similarly, in case of Elgamal algorithm 1.72, 1.6, 11.7 and 8.9 times for multiplication operation; in case of RSA algorithm 1.79, 1.5, 3.48 and 1.5 times for multiplication operation and in case of Benaloh  ...  In case of Paillier Algorithm the overhead is 17, 15, 22 and 12 times for addition operation and 278, 399,518 and 346 times for multiplication operation respectively.  ...  A ciphertext resulting from a multikey evaluation can be jointly decrypted using the secret keys of all the users involved in the computation. This scheme is based on the NTRU. 4 .  ... 
doi:10.5120/17487-7999 fatcat:ifdcjq46yfafrguuj4hxvwb26q

Discovering and exploiting keyword and attribute-value co-occurrences to improve P2P routing indices

Sebastian Michel, Matthias Bender, Nikos Ntarmos, Peter Triantafillou, Gerhard Weikum, Christian Zimmer
2006 Proceedings of the 15th ACM international conference on Information and knowledge management - CIKM '06  
Together with the coarse granularity of per-peer summaries, which are mandated for scalability, this limitation may lead to poor search result quality.  ...  Experimental studies with Gnutella and Web data demonstrate the viability and the trade-offs of the approaches.  ...  In practice, the user-perceived improvements can be even higher than shown in the figures, because the distribution of queries observed in the real-world query logs of the Gnutella dataset are highly skewed  ... 
doi:10.1145/1183614.1183643 dblp:conf/cikm/MichelBNTWZ06 fatcat:lmjspbodn5c43kosmgk3da7hpy

New techniques for best-match retrieval

Dennis Shasha, Tsong-Li Wang
1990 ACM Transactions on Information Systems  
Some empirical results are presented which illustrate the effectiveness of our scheme, and its performance relative to previous algorithms.  ...  A best-match query is to find the objects in the file that are closest (according to some (dis)similarity measure) to a given target.  ...  We wish to thank Jill Mesirov of Thinking Machines, who provided the proteins and their pairwise distances used for performing some of the experiments.  ... 
doi:10.1145/96105.96111 fatcat:apz4ruir4vaqzfzmjypmn4muoe

How to Find Short RC4 Colliding Key Pairs [chapter]

Jiageng Chen, Atsuko Miyaji
2011 Lecture Notes in Computer Science  
The main contribution of this paper is proposing an efficient searching algorithm which can successfully find 22-byte colliding key pairs, which are by far the shortest colliding key pairs ever found.  ...  The principle that how the two different keys can achieve a collision is well known by investigating the key scheduling algorithm of RC4.  ...  Acknowledgements This work is inspired by the previous work of Mitsuru Matsui, and the authors wish to thank him for his invaluable comments.  ... 
doi:10.1007/978-3-642-24861-0_3 fatcat:t4vpnwqudvfwfbh4nsow2m4loy

Using Linearly-Homomorphic Encryption to Evaluate Degree-2 Functions on Encrypted Data

Dario Catalano, Dario Fiore
2015 Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security - CCS '15  
taken over all the algorithms' random choices.  ...  Somewhat interestingly, in this case we can boost a linearly-homomorphic scheme to support the evaluation of any degree-2 polynomial while achieving full compactness. ← KeyGen(1 λ ), for all f ∈ F and  ...  In particular, none of the currently available number-theoretic cryptosystems is known to meet such requirements.  ... 
doi:10.1145/2810103.2813624 dblp:conf/ccs/CatalanoF15 fatcat:6uybxcitrzb57a7zlatt6albo4

Multiparty Homomorphic Machine Learning with Data Security and Model Preservation

Fengtian Kuang, Bo Mi, Yang Li, Yuan Weng, Shijie Wu
2021 Mathematical Problems in Engineering  
Thanks to the hardness of the conjugate search problem (CSP) and discrete logarithm problem (DLP), the confidentiality of training data and system model can be reduced to well-studied security assumptions  ...  In terms of efficiency, since all messages are coded as low-dimensional matrices, the expansion rates with regard to storage and computation overheads are linear compared to plaintext implementation without  ...  makes the scheme practical in cloud environments.  ... 
doi:10.1155/2021/6615839 doaj:08d509509d17496fa119f5f5e24948ac fatcat:6wcwcnstfrdcxikyrmoqcnkiba

Spatial reallocation of global gridded climate datasets [chapter]

Kathrin Anne Meier, Hans Hinterberger, Hans Gilgen
1994 Lecture Notes in Computer Science  
Global climatological data are often evaluated in grids with perpendicular boundaries in a cylinder projection of the longitude and latitude circles of the earth.  ...  Each dataset is organized in a di erent grid, according to the authors's preferences.  ...  Acknowledgments The authors are grateful to Patrick L udi for programming large parts of gft/1 and his assistance in applying the program and Lorenzo Hutter for writing an early version of the sdr program  ... 
doi:10.1007/3-540-58795-0_38 fatcat:n43tzffmyjfj7esoymbyezdttm
« Previous Showing results 1 — 15 out of 97 results