Results 11 to 20 of about 144,330 (264)
Techniques for Inverted Index Compression [PDF]
ACM Computing Surveys, 2020 The data structure at the core of large-scale search engines is the inverted index , which is essentially a collection of sorted integer sequences called inverted lists . Because of the many documents indexed by such engines and stringent performance requirements imposed by the heavy load of ...
Pibiri G. E., Venturini R.
openaire +4 more sources
Journal of Sustainable Construction Materials and Technologies, 2022 Correlations between compression index and atterberg limits found in the literature are very important for preliminary estimation. These equations are usually interpreted based on the R-square parameter and classified according to the conditions of the ...
Sirin Ozkan Ipek, Kaveh Dehghanıan
doaj +1 more source
Compressing relations and indexes [PDF]
Proceedings 14th International Conference on Data Engineering, 2002 We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially effective for records with many low to medium cardinality fields and numeric fields. In addition, this new technique supports very fast decompression.
Jonathan Goldstein +2 more
openaire +1 more source
Application of ANFIS Adaptive System to Estimate the Potential Consolidation of Clay Soils [PDF]
مجله مدل سازی در مهندسی, 2016 The consolidation phenomenon occurs in the construction of structures on saturated clay soils which in effect this phenomenon the soil particles is compressed.
javad ahadiyan, فاطمه بهروزی
doaj +1 more source
Universal compressed text indexing [PDF]
Theoretical Computer Science, 2019 The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes based on dictionary compression, a rich and heterogeneous family that exploits text repetitions in different ways. For each such compression scheme, several different indexing solutions have been proposed in the last two decades.
Navarro, Gonzalo, Prezza, Nicola
openaire +5 more sources
Mechanical properties of RoadyesTM-modified loess
Yantu gongcheng xuebao, 2023 The loess is structural and difficult to compact. How to solve the problem of loess compaction has always been a challenging technical problem in treatment of loess site foundation.
LI Hongru 1, 2, ZHAO Weilong 1, 2, NAN Zhongkai 1, 2
doaj +1 more source
Compressed Index for Dictionary Matching [PDF]
Data Compression Conference (dcc 2008), 2008 The past few years have witnessed several exciting results on compressed representation of a string T that supports efficient pattern matching, and the space complexity has been reduced to |T| Hk (T) + o (|T| log sigma) bits, where Hk(T) denotes the kth-order empirical entropy of T, and sigma is the size of the alphabet.
Wing-Kai Hon +4 more
openaire +2 more sources
Revista Brasileira de Ciência do Solo, 2006 O conteúdo de água do solo e os sistemas de manejo podem promover alterações em seus parâmetros de compressibilidade. O objetivo deste trabalho foi estudar os efeitos do conteúdo de água e de sistemas de manejo com cana-de-açúcar no grau de compactação e
Apolino José Nogueira da Silva +1 more
doaj +1 more source
Revista Brasileira de Ciência do Solo, 2008 O conhecimento das relações entre propriedades físicas e mecânicas do solo pode contribuir no desenvolvimento de funções de pedotransferência, que permitam estimar outras propriedades do solo de difícil mensuração.
Luis Eduardo Akiyoshi Sanches Suzuki +3 more
doaj +1 more source
Compressed Indexing for Consecutive Occurrences
CoRR, 2023 The fundamental question considered in algorithms on strings is that of indexing, that is, preprocessing a given string for specific queries. By now we have a number of efficient solutions for this problem when the queries ask for an exact occurrence of a given pattern $P$.
Pawel Gawrychowski +3 more
openaire +5 more sources