The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
On effective multi-dimensional indexing for strings
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Production Matching for Large Learning Systems
Production Matching for Large Learning Systems
Making the Pyramid Technique Robust to Query Types and Workloads
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Reordering query and rule patterns for query answering in a rete-based inference engine
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
Hi-index | 0.00 |
This paper describes the implementation of an indexing mechanism on a Rete-based reasoner working with ontological data in order to optimize memory consumption of the reasoner. This newly introduced indexing mechanism is known as the Pyramid Technique [1]. Our work organizes three dimensional ontological data in a way that works efficiently with this indexing mechanism and it constructs a subset of the querying scheme of the Pyramid Technique that supports querying ontological data. This work also implements an optimization on the Pyramid Technique. Finally, it discusses the performance analysis of the reasoner in terms of time and memory consumptions.