Results 1 to 10 of about 2,861,627 (269)
Structured data structures [PDF]
Communications of the ACM, 1974 Programming systems which permit arbitrary linked list structures enable the user to create complicated structures without sufficient protection. Deletions can result in unreachable data elements, and there is no guarantee that additions will be performed properly.
Ben Shneiderman, Peter Scheuermann
openaire +2 more sources
Data Structures for Mobile Data [PDF]
Journal of Algorithms, 1999 The authors present a set of novel data structures for the efficient maintenance of various continuous and discrete attributes of mobile data. A Kinetic Data Structure (KDS) maintains an attribute of interest in a system of geometric objects undergoing continuous motion.
Julien Basch +2 more
openaire +3 more sources
Oblivious Data Structures [PDF]
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014 We design novel, asymptotically more efficient data structures and algorithms for programs whose data access patterns exhibit some degree of predictability. To this end, we propose two novel techniques, a pointer-based technique and a locality-based technique.
Xiao Shaun Wang +6 more
openaire +2 more sources
ACM Transactions on Programming Languages and Systems, 1981 Text is not the only data that needs editing. For example, interactive debuggers edit data structures internal to running programs. This paper describes eds, a generalized editor that allows users to edit arbitrary data structures. Examples show eds maintaining simple databases, editing LISP S-expressions, debugging SNOBOL4 programs, and creating and ...
Christopher W. Fraser, A. A. Lopez
openaire +2 more sources
Gradually structured data [PDF]
Proceedings of the ACM on Programming Languages, 2021 Dynamically-typed languages offer easy interaction with ad hoc data such as JSON and S-expressions; statically-typed languages offer powerful tools for working with structured data, notably algebraic datatypes , which are a core feature of typed languages both functional and otherwise.
Stefan Malewski +2 more
openaire +2 more sources
Conjoint Data Mining of Structured and Semi-structured Data [PDF]
2008 Fourth International Conference on Semantics, Knowledge and Grid, 2008 With the knowledge management requirement growing, enterprises are becoming increasingly aware of the significance of interlinking business information across structured and semi-structured data sources. This problem has become more important with the growing amount of semi-structured data often found in XML repositories, web logs, biological databases,
Qi H. Pan +2 more
openaire +1 more source
SIAM Journal on Computing, 1991 The purpose of this paper is to analyze the maxima properties (value and position) of some data structures. Our theorems concern the distribution of the random variables. Previously known results usually dealt with the mean and sometimes the variance of these random variables. Many of our results rely on diffusion techniques.
Louchard, Guy +2 more
openaire +4 more sources
IEEE Journal of Selected Topics in Signal Processing, 2015 We present structured data fusion (SDF) as a framework for the rapid prototyping of knowledge discovery in one or more possibly incomplete data sets. In SDF, each data set—stored as a dense, sparse, or incomplete tensor—is factorized with a matrix or tensor decomposition.
Sorber, Laurent +2 more
openaire +1 more source
Data structure synthesis [PDF]
Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2016 All mainstream languages ship with libraries implementing lists, maps, sets, trees, and other common data structures. These libraries are sufficient for some use cases, but other applications need specialized data structures with different operations. For such applications, the standard libraries are not enough.
openaire +2 more sources
, 2010 We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data types are specified using relational algebra and functional dependencies; a novel fuse operation on relational indexes specifies where the underlying physical data structure
Hawkins, Peter +4 more
openaire +2 more sources