The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Fast discovery of association rules
Advances in knowledge discovery and data mining
File Structures
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
The RD-Tree: a structure for processing partial-MAX/MIN Queries in OLAP
Information Sciences—Applications: An International Journal
Logical Scaling in Formal Concept Analysis
ICCS '97 Proceedings of the Fifth International Conference on Conceptual Structures: Fulfilling Peirce's Dream
CEM - A Conceptual Email Manager
ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Browsing Semi-structured Web Texts Using Formal Concept Analysis
ICCS '01 Proceedings of the 9th International Conference on Conceptual Structures: Broadening the Base
Analyzing an Email Collection Using Formal Concept Analysis
PKDD '99 Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery
SQL Tuning
Towards generic pattern mining
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Custom asymmetric page split generalized index search trees and formal concept analysis
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
From concepts to concept lattice: a border algorithm for making covers explicit
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
FCA-based browsing and searching of a collection of images
ICCS'06 Proceedings of the 14th international conference on Conceptual Structures: inspiration and Application
Hi-index | 0.00 |
The paper provides evidence that spatial indexing structures offer faster resolution of Formal Concept Analysis queries than B-Tree/Hash methods. We show that many Formal Concept Analysis operations, computing the contingent and extent sizes as well as listing the matching objects, enjoy improved performance with the use of spatial indexing structures such as the RD-Tree. Speed improvements can vary up to eighty times faster depending on the data and query. The motivation for our study is the application of Formal Concept Analysis to Semantic File Systems. In such applications millions of formal objects must be dealt with. It has been found that spatial indexing also provides an effective indexing technique for more general purpose applications requiring scalability in Formal Concept Analysis systems. The coverage and benchmarking are presented with general applications in mind.