Efficient implementation of tuple pattern based retrieval

Tom Rothamel; Yanhong A. Liu

doi:10.1145/1244381.1244394

Efficient implementation of tuple pattern based retrieval

Tom Rothamel
, Yanhong A. Liu

Computer Science

Stony Brook University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

9 Scopus citations

Abstract

Tuple pattern based retrieval is a language construct that matches a tuple pattern against a set of tuples to retrieve components of those tuples. This high-level abstraction allows programs to be written more easily and clearly than otherwise. This paper describes a clean and automatic method for transforming tuple pattern based retrievals into efficient implementations. The paper also presents two systems that implement the method, and describes successful experience and experiments in generating efficient implementations for graph algorithms, program analysis, security, and other applications.

Original language	English
Title of host publication	PEPM 2007
Subtitle of host publication	Proceedings of the Workshop on Partial Evaluation and Program Manipulation
Pages	81-90
Number of pages	10
DOIs	https://doi.org/10.1145/1244381.1244394
State	Published - 2007
Event	2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation - Nice, France Duration: Jan 15 2007 → Jan 16 2007

Publication series

Name	Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Conference

Conference	2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation
Country/Territory	France
City	Nice
Period	01/15/07 → 01/16/07

Access to Document

10.1145/1244381.1244394

Cite this

@inproceedings{7b9a963f67994955ba6d998623bd5380,

title = "Efficient implementation of tuple pattern based retrieval",

abstract = "Tuple pattern based retrieval is a language construct that matches a tuple pattern against a set of tuples to retrieve components of those tuples. This high-level abstraction allows programs to be written more easily and clearly than otherwise. This paper describes a clean and automatic method for transforming tuple pattern based retrievals into efficient implementations. The paper also presents two systems that implement the method, and describes successful experience and experiments in generating efficient implementations for graph algorithms, program analysis, security, and other applications.",

author = "Tom Rothamel and Liu, \{Yanhong A.\}",

year = "2007",

doi = "10.1145/1244381.1244394",

language = "English",

isbn = "1595936203",

series = "Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation",

pages = "81--90",

booktitle = "PEPM 2007",

note = "2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation ; Conference date: 15-01-2007 Through 16-01-2007",

}

Rothamel, T & Liu, YA 2007, Efficient implementation of tuple pattern based retrieval. in PEPM 2007: Proceedings of the Workshop on Partial Evaluation and Program Manipulation. Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 81-90, 2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation, Nice, France, 01/15/07. https://doi.org/10.1145/1244381.1244394

Efficient implementation of tuple pattern based retrieval. / Rothamel, Tom; Liu, Yanhong A.
PEPM 2007: Proceedings of the Workshop on Partial Evaluation and Program Manipulation. 2007. p. 81-90 (Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient implementation of tuple pattern based retrieval

AU - Rothamel, Tom

AU - Liu, Yanhong A.

PY - 2007

Y1 - 2007

N2 - Tuple pattern based retrieval is a language construct that matches a tuple pattern against a set of tuples to retrieve components of those tuples. This high-level abstraction allows programs to be written more easily and clearly than otherwise. This paper describes a clean and automatic method for transforming tuple pattern based retrievals into efficient implementations. The paper also presents two systems that implement the method, and describes successful experience and experiments in generating efficient implementations for graph algorithms, program analysis, security, and other applications.

AB - Tuple pattern based retrieval is a language construct that matches a tuple pattern against a set of tuples to retrieve components of those tuples. This high-level abstraction allows programs to be written more easily and clearly than otherwise. This paper describes a clean and automatic method for transforming tuple pattern based retrievals into efficient implementations. The paper also presents two systems that implement the method, and describes successful experience and experiments in generating efficient implementations for graph algorithms, program analysis, security, and other applications.

UR - https://www.scopus.com/pages/publications/35348855707

U2 - 10.1145/1244381.1244394

DO - 10.1145/1244381.1244394

M3 - Conference contribution

AN - SCOPUS:35348855707

SN - 1595936203

SN - 9781595936202

T3 - Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

SP - 81

EP - 90

BT - PEPM 2007

T2 - 2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation

Y2 - 15 January 2007 through 16 January 2007

ER -

Efficient implementation of tuple pattern based retrieval

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this