Results 31 to 40 of about 37,788,190 (381)
Multi-Dimensional Data Compression and Query Processing in Array Databases
In recent times, the production of multidimensional data in various domains and their storage in array databases has witnessed a sharp increase; this rapid growth in data volumes necessitates compression in array databases.
Minsoo Kim, Hyubjin Lee, Yon Dohn Chung
doaj +1 more source
ALGORITHMS AND DATA STRUCTURE LIBRARIES FOR JAVA [PDF]
This paper is dedicated to the comparison of different libraries of algorithms and data structures for the Java language. Within the paper currently available and relevant libraries are analyzed and compared.
Patrik PERHAC, Slavomir SIMONAK
doaj +1 more source
Dynamic Range Majority Data Structures [PDF]
Given a set $P$ of coloured points on the real line, we study the problem of answering range $\alpha$-majority (or "heavy hitter") queries on $P$. More specifically, for a query range $Q$, we want to return each colour that is assigned to more than an ...
A. Andersson+12 more
core +1 more source
Partially persistent search trees with transcript operations [PDF]
When dictionaries are persistent, it is natural to introduce a transcript operation which reports the status changes for a given key over time. We discuss when and how a time and space efficient implementation of this operation can be provided.
Kim S. Larsen
doaj +1 more source
Probabilistic Data Structures in Adversarial Environments
Probabilistic data structures use space-efficient representations of data in order to (approximately) respond to queries about the data. Traditionally, these structures are accompanied by probabilistic bounds on query-response errors.
David Clayton+2 more
semanticscholar +1 more source
Seaborn: Statistical Data Visualization
seaborn is a library for making statistical graphics in Python. It provides a high-level interface to matplotlib and integrates closely with pandas data structures. Functions in the seaborn library expose a declarative, dataset-oriented API that makes it
Michael L. Waskom
semanticscholar +1 more source
Concurrent Data Structures Linked in Time [PDF]
Arguments about correctness of a concurrent data structure are typically carried out by using the notion of linearizability and specifying the linearization points of the data structure's procedures.
Banerjee, Anindya+3 more
core +3 more sources
Sketching and Sublinear Data Structures in Genomics
Large-scale genomics demands computational methods that scale sublinearly with the growth of data. We review several data structures and sketching techniques that have been used in genomic analysis methods.
G. Marçais+3 more
semanticscholar +1 more source
Compressed Data Structures for Dynamic Sequences [PDF]
We consider the problem of storing a dynamic string $S$ over an alphabet $\Sigma=\{\,1,\ldots,\sigma\,\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\mathrm{access}(i,S ...
A. Gupta+14 more
core +1 more source
Structure-Aware Language Model Pretraining Improves Dense Retrieval on Structured Data [PDF]
This paper presents Structure Aware Dense Retrieval (SANTA) model, which encodes user queries and structured data in one universal embedding space for retrieving structured data. SANTA proposes two pretraining methods to make language models structure-aware and learn effective representations for structured data: 1) Structured Data Alignment, which ...
arxiv