Filters








6,602 Hits in 7.2 sec

A text compression scheme that allows fast searching directly in the compressed file

Udi Manber
1997 ACM Transactions on Information Systems  
By reducing the size of a text file in a special way, we reduce the time it takes to search through it. Our scheme improves the speed of string matching and we also save space in the process.  ...  A new text compression scheme is presented in this paper. The main purpose of this scheme is to speed up string matching by searching the compressed file directly.  ...  Acknowledgements Thanks to Dan Hirschberg, Richard Ladner, Martin Tompa, and Sun Wu for helpful discussions, and to Jan Sanislo for help in improving the code.  ... 
doi:10.1145/248625.248639 fatcat:v5p7onocnfcrxivmvzkczrwfue

A text compression scheme that allows fast searching directly in the compressed file [chapter]

Udi Manber
1994 Lecture Notes in Computer Science  
By reducing the size of a text file in a special way, we reduce the time it takes to search through it. Our scheme improves the speed of string matching and we also save space in the process.  ...  A new text compression scheme is presented in this paper. The main purpose of this scheme is to speed up string matching by searching the compressed file directly.  ...  Acknowledgements Thanks to Dan Hirschberg, Richard Ladner, Martin Tompa, and Sun Wu for helpful discussions, and to Jan Sanislo for help in improving the code.  ... 
doi:10.1007/3-540-58094-8_10 fatcat:4h2tcigdcrc23mbaseklqoawne

A fast and secure framework for over-the-air wireless software download using reconfigurable mobile devices

B. Bing
2006 IEEE Communications Magazine  
This article covers two key system design issues: delta compression and security.  ...  With dynamic OTA download, mobile devices can connect to any type of wireless network, download the required radio software, and reconfigure on demand.  ...  Mitola and Z. Zvonar for their helpful advice, and to Dr. Alex Gelman of the Panasonic Princeton Laboratory for his support.  ... 
doi:10.1109/mcom.2006.1668420 fatcat:wogst4z2tfewhblio4sgrsborq

Fast and flexible word searching on compressed text

Edleno Silva de Moura, Gonzalo Navarro, Nivio Ziviani, Ricardo Baeza-Yates
2000 ACM Transactions on Information Systems  
They allow a large number of variations over the basic word and phrase search capability, such as sets of characters, arbitrary regular expressions, and approximate matching.  ...  The compression scheme uses a semistatic word-based model and a Huffman code where the coding alphabet is byte-oriented rather than bit-oriented.  ...  A first text compression scheme that allowed direct searching on compressed text was proposed by Manber [1997] .  ... 
doi:10.1145/348751.348754 fatcat:gtwbmlqconbn5jz3le3ptj4fmm

Fast searching on compressed text allowing errors

Edleno Silva de Moura, Gonzalo Navarro, Nivio Ziviani, Ricardo Baeza-Yates
1998 Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '98  
We present a fast compression and decompression scheme for natural language texts that allows efficient and flexible string matching by searching the compressed text directly.  ...  The searching algorithm allows a large number of variations of the exact and approximate compressed string matching problem, such as phrases, ranges, complements, wild cards and arbitrary regular expressions  ...  Acknowledgements We wish to acknowledge the helpful comments of Berthier Ribeiro-Neto and the many fruitful discussions with Mar- [BMN+93] cio D.  ... 
doi:10.1145/290941.291013 dblp:conf/sigir/MouraNZB98 fatcat:lwmninhsczezxgkir3txt3fh6a

Speeding up Natural Language Text Search using Compression

Majed AbuSafiya
2021 International Journal of Advanced Computer Science and Applications  
Another issue is the overhead that is required to compress P and T, but it was found that the proposed compression algorithm is so fast such that its run-time can be paid for and still save text search  ...  Relying on this assumption, a letter, in T or P, is encoded into a single byte instead of the two-byte unicode which shortens the string on which a text search algorithm works.  ...  ACKNOWLEDGMENT All praise and gratitude be to Allah, all mighty, for guiding me and giving me the knowledge and strength to accomplish this work.  ... 
doi:10.14569/ijacsa.2021.0120452 fatcat:6h24iihbvjbptesifq2hqqxzky

Indexes and Computation over Compressed Structured Data (Dagstuhl Seminar 13232)

Sebastian Maneth, Gonzalo Navarro, Marc Herbstritt
2013 Dagstuhl Reports  
It focuses on algorithms for sequence analysis (string algorithms), but also covers genome rearrangement problems and phylogenetic reconstruction methods.  ...  The aim was to bring together researchers from various research directions of compression and indexing of structured data.  ...  This is a natural extension of the well-known encoding range-maxima query problem, where only the position of the maximum in A[i..j] is sought, and finds applications in document retrieval and ranking.  ... 
doi:10.4230/dagrep.3.6.22 dblp:journals/dagstuhl-reports/ManethN13 fatcat:b35at6erjbe63hvelnqnrt4jle

Encoding and Compression for the Devices Profile for Web Services

Guido Moritz, Dirk Timmermann, Regina Stoll, Frank Golatowski
2010 2010 IEEE 24th International Conference on Advanced Information Networking and Applications Workshops  
We determined 18 message types in the scenario and compressed and encoded all messages by using existing schemes and tools.  ...  A big challenge when deploying further application layer network protocols on top of 6LoWPAN is the message size of existing -mostly XML based -protocols which does not meet the resource requirements of  ...  ACKNOWLEDGMENT This work has been achieved in the ITEA2 project uSERVICE and OSAmI and has been funded by the German Federal Ministry of Education and Research under contract numbers 01|S0902F and 01|S08003I  ... 
doi:10.1109/waina.2010.91 dblp:conf/aina/MoritzTSG10 fatcat:shuncmgszrf7bcq7j6iaaq7vku

Compressing Sets and Multisets of Sequences [article]

Christian Steinruecken
2014 arXiv   pre-print
A multiset can be encoded na\"ively by simply storing its elements in some sequential order, but then information is wasted on the ordering.  ...  Multisets are a generalisation of sets where members are allowed to occur multiple times.  ...  The author would like to thank David MacKay, Zoubin Ghahramani and Jossy Sayir and anonymous reviewers for helpful feedback.  ... 
arXiv:1401.6410v1 fatcat:ocpt3nayvbgbtmi3by46f2qbj4

Compressed Matching in Dictionaries

Shmuel T. Klein, Dana Shapira
2011 Algorithms  
XMill achieves better compression than Gzip and runs at about the same speed. Another known online compressor is XMLPPM [7], based on a modification of the PPM2 compression scheme.  ...  Obviously, these auxiliary files create a storage problem on their own, and thus are kept in compressed form.  ...  In this section we present a pattern matching algorithm working on a POM file which has been compressed using a binary Fibonacci code.  ... 
doi:10.3390/a4010061 fatcat:cbzwe7dwrng3xpurrr4edgma7i

Compressing sets and multisets of sequences

Christian Steinruecken
2014 2014 Data Compression Conference  
A multiset can be encoded naïvely by simply storing its elements in some sequential order, but then information is wasted on the ordering.  ...  Multisets are a generalisation of sets where members are allowed to occur multiple times.  ...  This work was supported by EPSRC Grant EP/I036575 and a Google Research Award.  ... 
doi:10.1109/dcc.2014.89 dblp:conf/dcc/Steinruecken14 fatcat:x4g2ijbgdrgj5k5h3mqkucew5i

Compressing Sets and Multisets of Sequences

Christian Steinruecken
2015 IEEE Transactions on Information Theory  
A multiset can be encoded naïvely by simply storing its elements in some sequential order, but then information is wasted on the ordering.  ...  Multisets are a generalisation of sets where members are allowed to occur multiple times.  ...  This work was supported by EPSRC Grant EP/I036575 and a Google Research Award.  ... 
doi:10.1109/tit.2015.2392093 fatcat:bgbpdnp6hrd25l5bat63tqx7pq

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.  ...  LZRS'77 is perfectly backward-compatible with LZ'77, that is, a file compressed with our error-resistant LZRS'77 can still be decompressed by a generic LZ'77 decoder.  ...  The resulting algorithm, called LZS'77, allows one to embed some bits of another binary string .  ... 
doi:10.1109/tit.2007.894689 fatcat:ex4gmg22dngdrk7w7ddbrwddv4

A comparison of BWT approaches to string pattern matching

Andrew Firth, Tim Bell, Amar Mukherjee, Don Adjeroh
2005 Software, Practice & Experience  
Furthermore, we introduce a technique to improve the search times of Binary Search, Suffix Arrays and q-grams by 22% on average, as well as reduce the memory requirement of the latter two by 40% and 31%  ...  Additionally, when only counting the occurrences of a pattern, or when locating the positions of a small number of matches, it is the fastest algorithm.  ...  If instead we wish to perform approximate matching, the size of the q-grams depends on the allowable distance between the pattern and a matching string.  ... 
doi:10.1002/spe.669 fatcat:vzwkjaht3jfnvoywkznlxynspu

Millau: an encoding format for efficient representation and exchange of XML over the Web

Marc Girardot, Neel Sundaresan
2000 Computer Networks  
We also describe some applications of XML-based remote procedure calls and client-server applications based on Millau that take advantage of the compression and streaming technology defined by the system  ...  XML data, large or small, with or without associated schema, will be exchanged between increasing number of applications running on diverse devices.  ...  We would also like to thank Anita Huang and Sami Rollins who reviewed this paper and helped improve the final version.  ... 
doi:10.1016/s1389-1286(00)00051-7 fatcat:ys5ijp63ojadxlu7wkan2u7nz4
« Previous Showing results 1 — 15 out of 6,602 results