NDLI: A probabilistic approach to the problem of automatic selection of data representations

Please wait, while we are loading the content...

Let-floating: moving bindings to give faster programs

A reflection on call-by-value

Functional back-ends within the lambda-sigma calculus

Lag, drag, void and use—heap profiling and space-efficient compilation revisited

Static and dynamic partitioning of pointers as links and threads

Storage use analysis and its applications

The role of lazy evaluation in amortized data structures

Deriving structural hylomorphisms from recursive definitions

Analysis and caching of dependencies

Optimality and inefficiency: what isn't a cost model of the lambda calculus?

Inductive, coinductive, and pointed types

A new look at pattern matching in abstract data types

Simplifying subtyping constraints

Complexity of kernel Fun subtype checking

The semantics of Scheme with future

First-class synchronization barriers

pHluid: the design of a parallel functional language implementation on workstations

Cogen in six lines

A probabilistic approach to the problem of automatic selection of data representations

A theory of weak bisimulation for core CML

A provable time and space efficient implementation of NESL

Synchronous Kahn networks

Enriching the lambda calculus with contexts: toward a theory of incremental program construction

Sharing code through first-class environments

Mixin modules

A probabilistic approach to the problem of automatic selection of data representations

Content Provider	ACM Digital Library
Author	Chuang, Tyng-Ruey Hwang, Wen L.
Abstract	The designs and implementations of efficient aggregate data structures have been important issues in functional programming. It is not clear how to select a good representation for an aggregate when access patterns to the aggregate are highly variant, or even unpredictable. Previous approaches rely on compile--time analyses or programmer annotations. These methods can be unreliable because they try to predict a program's behavior before it is executed.We propose a probabilistic approach, which is based on Markov processes, for automatic selection of data representations. The selection is modeled as a random process moving in a graph with weighted edges. The proposed approach employs coin tossing at run--time to help choosing a suitable data representation. The transition probability function used by the coin tossing is constructed in a simple and common way from a measured cost function. We show that, under this setting, random selections of data representations can be quite effective. The probabilistic approach is used to implement bag aggregates, and the performance results are compared to those of deterministic selection strategies.
Starting Page	190
Ending Page	200
Page Count	11
File Format	PDF
ISBN	0897917707
DOI	10.1145/232627.232648
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1996-06-15
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A probabilistic approach to the problem of automatic selection of data representations

A Probabilistic Approach to the Problem of Automatic Selection of Data Representations (1996)

A Probabilistic Approach to the Problem of Automatic Selection of Data Representations (1996)

A bayesian approach for automatic algorithm selection.

A model-based approach to the non-unique oligonucleotide probe selection problem

Probabilistic indexing: a statistical approach to the library problem

A hybrid probabilistic/connectionist approach to automatic text tagging.

A probabilistic solution to the selection and fusion problem in distributed information retrieval

Probabilistic effects in data selection (1999)

A probabilistic approach to the problem of automatic selection of data representations

Similar Documents

A probabilistic approach to the problem of automatic selection of data representations

A Probabilistic Approach to the Problem of Automatic Selection of Data Representations (1996)

A Probabilistic Approach to the Problem of Automatic Selection of Data Representations (1996)

A bayesian approach for automatic algorithm selection.

A model-based approach to the non-unique oligonucleotide probe selection problem

Probabilistic indexing: a statistical approach to the library problem

A hybrid probabilistic/connectionist approach to automatic text tagging.

A probabilistic solution to the selection and fusion problem in distributed information retrieval

Probabilistic effects in data selection (1999)

A probabilistic approach to the problem of automatic selection of data representations