Attributed data for CHR indexing

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing indexing strategies for ground terms, based on hash tables, incur considerable performance overhead, especially when frequently computing hash values for large terms. In this paper we (1) propose attributed data, a new data representation for ground terms inspired by attributed variables, that avoids the overhead of hash-table indexing, (2) describe program analysis and transformation techniques that make attributed data more effective, and (3) provide experimental results that establish the usefulness of our approach. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sarna-Starosta, B., & Schrijvers, T. (2009). Attributed data for CHR indexing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 357–371). https://doi.org/10.1007/978-3-642-02846-5_30

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free