skip to main content
10.1145/1244381.1244394acmconferencesArticle/Chapter ViewAbstractPublication PagespepmConference Proceedingsconference-collections
Article

Efficient implementation of tuple pattern based retrieval

Published: 15 January 2007 Publication History

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.

References

[1]
American National Standards Institute, Inc. Role-based access control. ANSI INCITS 395--2004.
[2]
F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. López, and G. Puebla. The Ciao Prolog system. Reference Manual. The Ciao System Documentation Series. TR CLIP3/97.1.10. School of Computer Science, Technical University of Madrid (UPM), August 2004.
[3]
J. Cai, P. Facon, F. Henglein, R. Paige, and E. Schonberg. Type analysis and data structure selection. In Constructing Programs From Specifications, pages 126--164. North-Holland, 1991.
[4]
N. Carriero and D. Gelernter. Linda in context. Communications of the ACM, 32(4):444--458, 1989.
[5]
S. Choenni, H. M. Blanken, and T. Chang. On the selection of secondary indices in relational databases. Data and Knowledge Engineering, 11(3):207-, 1993.
[6]
S. Dawson, C. R. Ramakrishnan, S. Skiena, and T. Swift. Principles and practice of unification factoring. ACM Transactions on Programming Languages and Systems (TOPLAS), 18(5):528--563, 1996.
[7]
D. F. Ferraiolo, R. Sandhu, S. Gavrila, D. R. Kuhn, and R. Chandramouli. Proposed NIST standard for role-based access control. ACM Transactions on Information Systems Security, 4(3):224--274, 2001.
[8]
F. L. Fessant and L. Maranget. Optimizing pattern matching. In ICFP '01: Proceedings of the 6th ACM SIGPLAN International Conference on Functional Programming, pages 26--37, New York, NY, USA, 2001. ACM Press.
[9]
M. R. Frank, E. Omiecinski, and S. B. Navathe. Adaptive and automated index selection in RDBMS. In Extending Database Technology, pages 277--292, 1992.
[10]
S. M. Freudenberger, J. T. Schwartz, and M. Sharir. Experience with the SETL optimizer. ACM Transactions on Programming Languages and Systems, 5(1):26--45, 1983.
[11]
Y. A. Liu, T. Rothamel, F. Yu, S. D. Stoller, and N. Hu. Parametric regular path queries. In PLDI '04: Proceedings of the ACM SIGPLAN 2004 conference on Programming Language Design and Implementation, pages 219--230, New York, NY, USA, 2004. ACM Press.
[12]
Y. A. Liu and S. D. Stoller. From datalog rules to efficient programs with time and space guarantees. In PPDP '03: Proceedings of the 5th ACM SIGPLAN international conference on Principles and Practice of Declarative Programming, pages 172--183, New York, NY, USA, 2003. ACM Press.
[13]
R. Paige and S. Koenig. Finite differencing of computable expressions. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(3):402--454, 1982.
[14]
G. Priyalakshmi. Generating efficient programs for solving relational database queries. Master's thesis, Stony Brook University, August 2004.
[15]
E. Schonberg, J. T. Schwartz, and M. Sharir. Automatic data structure selection in SETL. In POPL '79: Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 197--210. ACM Press, 1979.
[16]
E. Schonberg, J. T. Schwartz, and M. Sharir. An automatic technique for selection of data representations in SETL programs. ACM Transactions on Programming Languages and Systems (TOPLAS), 3(2):126--143, 1981.
[17]
J. T. Schwartz. Automatic data structure choice in a language of very high level. In POPL '75: Proceedings of the 2nd ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 36--40. ACM Press, 1975.
[18]
M. Sharir. Some observations concerning formal differentiation of set theoretic expressions. ACM Transactions on Programming Languages and Systems (TOPLAS), 4(2): 196--225, 1982.
[19]
T. L. Swift. Evaluation of Normal Logic Programs. PhD thesis, Stony Brook University, December 1994.
[20]
G. Wilson. Linda-like systems and their implementation. Technical Report 91-13, Edinburgh Parallel Computing Centre, June 1991.
[21]
P. Wyckoff, S. W. McLaughry, T. J. Lehman, and D. A. Ford. T. Spaces. IBM Systems Journal, 37(3):454--474, 1998.

Cited By

View all
  • (2018)Logic programming applicationsDeclarative Logic Programming10.1145/3191315.3191326(519-548)Online publication date: 1-Sep-2018
  • (2018)Declarative Logic ProgrammingundefinedOnline publication date: 1-Sep-2018
  • (2012)An introduction to data representation synthesisCommunications of the ACM10.1145/2380656.238067755:12(91-99)Online publication date: 1-Dec-2012
  • Show More Cited By

Index Terms

  1. Efficient implementation of tuple pattern based retrieval

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        PEPM '07: Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
        January 2007
        180 pages
        ISBN:9781595936202
        DOI:10.1145/1244381
        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 15 January 2007

        Permissions

        Request permissions for this article.

        Check for updates

        Qualifiers

        • Article

        Conference

        PEPM07
        Sponsor:

        Acceptance Rates

        Overall Acceptance Rate 66 of 120 submissions, 55%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)0
        • Downloads (Last 6 weeks)0
        Reflects downloads up to 03 Mar 2025

        Other Metrics

        Citations

        Cited By

        View all
        • (2018)Logic programming applicationsDeclarative Logic Programming10.1145/3191315.3191326(519-548)Online publication date: 1-Sep-2018
        • (2018)Declarative Logic ProgrammingundefinedOnline publication date: 1-Sep-2018
        • (2012)An introduction to data representation synthesisCommunications of the ACM10.1145/2380656.238067755:12(91-99)Online publication date: 1-Dec-2012
        • (2011)Data representation synthesisProceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/1993498.1993504(38-49)Online publication date: 4-Jun-2011
        • (2011)Data representation synthesisACM SIGPLAN Notices10.1145/1993316.199350446:6(38-49)Online publication date: 4-Jun-2011
        • (2010)Data structure fusionProceedings of the 8th Asian conference on Programming languages and systems10.5555/1947873.1947893(204-221)Online publication date: 28-Nov-2010
        • (2010)Graph queries through datalog optimizationsProceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming10.1145/1836089.1836093(25-34)Online publication date: 26-Jul-2010
        • (2010)Data Structure FusionProgramming Languages and Systems10.1007/978-3-642-17164-2_15(204-221)Online publication date: 2010
        • (2008)Generating incremental implementations of object-set queriesProceedings of the 7th international conference on Generative programming and component engineering10.1145/1449913.1449923(55-66)Online publication date: 19-Oct-2008

        View Options

        Login options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        Figures

        Tables

        Media

        Share

        Share

        Share this Publication link

        Share on social media