Filters








3,164 Hits in 3.9 sec

Compressed Communication Complexity of Longest Common Prefixes [chapter]

Philip Bille, Mikko Berggreen Ettienne, Roberto Grossi, Inge Li Gørtz, Eva Rotenberg
2018 Lecture Notes in Computer Science  
We consider the communication complexity of fundamental longest common prefix (Lcp) problems.  ...  Compressed Communication Complexity of Longest Common Prefixes 3 at a server. To efficiently handle many queries we want to reduce both communication and rounds for each search.  ...  The Lcp problem has a pulic-coin randomized O(lg ℓ)-round communication protocol with O(lg ℓ) communication complexity, where ℓ is the length of the longest common prefix between A and B.  ... 
doi:10.1007/978-3-030-00479-8_7 fatcat:fxnjrpo27jeuphf65xqp77wkwm

Compressed Communication Complexity of Hamming Distance [article]

Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 arXiv   pre-print
[SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a compressed form, i.e., represented by the Lempel-Ziv  ...  We consider the communication complexity of the Hamming distance of two strings. Bille et al.  ...  [2] were the first to consider the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a compressed form, i.e., represented  ... 
arXiv:2103.03468v2 fatcat:k5xitiu7a5gl3m47nv62fxo53y

Compressed Communication Complexity of Hamming Distance

Shiori Mitsuya, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
2021 Algorithms  
[SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a compressed form, i.e., represented by the Lempel-Ziv  ...  We consider the communication complexity of the Hamming distance of two strings. Bille et al.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/a14040116 fatcat:4dx5utm6ejfh3hwxrh35tq7tt4

String Indexing with Compressed Patterns [article]

Philip Bille and Inge Li Gørtz and Teresa Anna Steiner
2021 arXiv   pre-print
This captures the common client-server scenario, where a client submits a query and communicates it in compressed form to a server.  ...  In this paper we consider the basic variant where the pattern is given in compressed form and the goal is to achieve query time that is fast in terms of the compressed size of the pattern.  ...  Longest Common Prefix For two strings S and S , the longest common prefix of S and S , denoted lcp(S, S ), is the maximum j ∈ {0, . . . , min (|S|, |S |)} such that S [0, j] = S [0, j].  ... 
arXiv:1909.11930v4 fatcat:2zi5r4eukrea3dmkbnzxjjq4pm

Error Resilient LZ'77 Data Compression: Algorithms, Analysis, and Experiments

Stefano Lonardi, Wojciech Szpankowski, Mark Daniel Ward
2007 IEEE Transactions on Information Theory  
We analyze the number of longest matches in such a scheme and prove that it follows the logarithmic series distribution with mean 1=h (plus some fluctuations), where h is the source entropy.  ...  We propose a joint source-channel coding algorithm capable of correcting some errors in the popular Lempel-Ziv'77 (LZ'77) scheme without introducing any measurable degradation in the compression performance  ...  It compresses phrases by consecutively replacing the longest prefix of the noncompressed portion of a file with a pointer and the length of the prefix.  ... 
doi:10.1109/tit.2007.894689 fatcat:ex4gmg22dngdrk7w7ddbrwddv4

String Indexing with Compressed Patterns

Philip Bille, Inge Li Gørtz, Teresa Anna Steiner, Markus Bläser, Christophe Paul
2020 Symposium on Theoretical Aspects of Computer Science  
This captures the common client-server scenario, where a client submits a query and communicates it in compressed form to a server.  ...  In this paper we consider the basic variant where the pattern is given in compressed form and the goal is to achieve query time that is fast in terms of the compressed size of the pattern.  ...  Longest Common Prefix For two strings S and S , the longest common prefix of S and S , denoted lcp(S, S ), is the maximum j ∈ {0, . . . , min (|S|, |S |)} such that S [0, j] = S [0, j].  ... 
doi:10.4230/lipics.stacs.2020.10 dblp:conf/stacs/BilleGS20 fatcat:73nxlfr54rbtfiik6grnjkgp6i

On fast address-lookup algorithms

H.H.-Y. Tzeng, T. Przygienda
1999 IEEE Journal on Selected Areas in Communications  
A self-contained problem of considerable practical and theoretical interest is the longest-prefix lookup operation, perceived as one of the decisive bottlenecks.  ...  The growth of the Internet and its acceptance has sparkled keen interest in the research community in respect to many apparent scaling problems for a large infrastructure based on IP technology.  ...  ACKNOWLEDGMENT The authors would like to acknowledge the valuable comments from anonymous reviewers that improved the depth and structure of this paper.  ... 
doi:10.1109/49.772436 fatcat:ydivubanarbmri4mlfsmcejaim

Scalable, memory efficient, high-speed IP lookup algorithms

R. Sangireddy, N. Futamura, S. Aluru, A.K. Somani
2005 IEEE/ACM Transactions on Networking  
One of the central issues in router performance is IP address lookup based on longest prefix matching.  ...  Experimental results using the MAE-West router with 29 487 prefixes show that the Elevator-Stairs algorithm gives an average throughput of 15.7 Million lookups per second (Mlps) using 459 KB of memory,  ...  Cheah, Department of Electrical and Computer Engineering, Iowa State University, for assisting in carrying out simulation work as a support to the analytical study on address lookup algorithms.  ... 
doi:10.1109/tnet.2005.852878 fatcat:yscpuyoribhhngbhcvhdzxax2y

Compact location encodings for scalable Internet routing

Feng Wang, Lixin Gao, Xiaozhe Shao, Hiroaki Harai, Kenji Fujikawa
2015 2015 IEEE Conference on Computer Communications (INFOCOM)  
We provide time and space complexity analysis, and present experimental results evaluating the performance of our encoding method.  ...  It shows that the proposed encoding method can achieve a good compression factor without degrading packet-forwarding performance.  ...  (in terms of nodes) of the longest prefix.  ... 
doi:10.1109/infocom.2015.7218435 dblp:conf/infocom/WangGSHF15 fatcat:7lhexbp7kfb4jnhsmot6fajuxy

Scalable Name Lookup in NDN Using Effective Name Component Encoding

Yi Wang, Keqiang He, Huichen Dai, Wei Meng, Junchen Jiang, Bin Liu, Yan Chen
2012 2012 IEEE 32nd International Conference on Distributed Computing Systems  
Furthermore, we analyze the memory consumption and time complexity of NCE.  ...  name prefix matching and design a fast and incremental update mechanism which satisfies the special requirements of NDN forwarding process, namely to insert, modify, and delete name prefixes frequently  ...  Hash Chain uses an incremental hashing function to compress common prefixes length and minimize collisions between prefixes. Z. Zhou et al.  ... 
doi:10.1109/icdcs.2012.35 dblp:conf/icdcs/WangHDMJLC12 fatcat:yrupz74r2fcjbfakamlw2e3dzq

Suffix tree construction algorithms on modern hardware

Dimitris Tsirogiannis, Nick Koudas
2010 Proceedings of the 13th International Conference on Extending Database Technology - EDBT '10  
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms.  ...  Furthermore, several compression techniques are applied to effectively trade space for cache performance.  ...  The edge label of this node is the longest common prefix (lcp) of the corresponding suffixes.  ... 
doi:10.1145/1739041.1739075 dblp:conf/edbt/TsirogiannisK10 fatcat:ij42ym6cabf7fng5usnmof5w2y

DwarfCode: A Performance Prediction Tool for Parallel Applications

Weizhe Zhang, Albert M. K. Cheng, Jaspal Subhlok
2016 IEEE transactions on computers  
In order to generate such a benchmark, two major challenges are to reduce the time complexity of trace merging and repeat compression algorithms.  ...  More importantly, we put forward a novel repeat compression algorithm, whose time complexity is O(nlogn).  ...  Babak Behzad at the University of Illinois at Urbana-Champaign for insightful discussion about the paper revision.  ... 
doi:10.1109/tc.2015.2417526 fatcat:jx5zt2ozw5dnviw62ihxuue6zy

A Survey of Recent IP Lookup Schemes [chapter]

V. Srinivasan, G. Varghese
2000 IFIP Advances in Information and Communication Technology  
IP address lookup is challenging because it requires a longest matching prefix lookup.  ...  In particular we consider binary search on prefixes, binary search on prefix lengths, LC-tries, controlled prefix expansion and Lulea tries. We consider both software and hardware environments.  ...  This reduces database size, but at the cost of requiring a more complex lookup called longest matching prefix. It also requires a more complex update procedure when prefixes are added and deleted.  ... 
doi:10.1007/978-0-387-35580-1_3 fatcat:sqpuwgwbjrai3ac5cexicedpnu

Using the Sadakane Compressed Suffix Tree to Solve the All-Pairs Suffix-Prefix Problem

Maan Haj Rachid, Qutaibah Malluhi, Mohamed Abouelhoda
2014 BioMed Research International  
The all-pairs suffix-prefix matching problem is a basic problem in string processing. It has an application in the de novo genome assembly task, which is one of the major bioinformatics problems.  ...  Our sequential and parallel algorithms are optimized by exploiting features of the Sadakane compressed index data structure.  ...  The statements made herein are solely the responsibility of the authors.  ... 
doi:10.1155/2014/745298 pmid:24834435 pmcid:PMC4009283 fatcat:p3bk5q44yng25ivkj2l4xi5fuy

Hashed Patricia Trie: Efficient Longest Prefix Matching in Peer-to-Peer Systems [chapter]

Sebastian Kniesburges, Christian Scheideler
2011 Lecture Notes in Computer Science  
In this paper we address the problem of longest prefix matching and present an efficient data structure called hashed Patricia trie.  ...  The design of efficient search structures for peer-to-peer systems has attracted a lot of attention in recent years.  ...  advantages of Patricia tries and hash tables in order to support prefix search in worst-case logarithmic hash table accesses w.r.t. the input length, which results in an efficient DHT-based prefix search  ... 
doi:10.1007/978-3-642-19094-0_18 fatcat:w7lyfkptcfhvnlqi4dzmsmolqi
« Previous Showing results 1 — 15 out of 3,164 results