Custom asymmetric page split generalized index search trees and formal concept analysis

Authors:
Ben Martin;Peter Eklund
Affiliations:
School of Computer Science and Software Engineering, The University of Wollongong, Wollongong, NSW, Australia;School of Computer Science and Software Engineering, The University of Wollongong, Wollongong, NSW, Australia
Venue:
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
Year:
2007

Citing 13
Cited 1

Semantic file systems

SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Implementation of extended indexes in POSTGRES

ACM SIGIR Forum
Fast discovery of association rules

Advances in knowledge discovery and data mining
File Structures

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
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
A Logical Generalization of Formal Concept Analysis

ICCS '00 Proceedings of the Linguistic on Conceptual Structures: Logical Linguistic, and Computational Issues
Generalized Search Trees for Database Systems

VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Asymmetric page split generalized index search trees for formal concept analysis

ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
Spatial indexing for scalability in FCA

ICFCA'06 Proceedings of the 4th 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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the scalability of applying Formal Concept Analysis to large data sets. In particular we present enhancements based on an existing spatial data structure, the RD-Tree, to better support both specific use with Formal Concept Analysis as well as generic multidimensional applications. Our experiments are motivated by the application of Formal Concept Analysis to a virtual filesystem [11,20,16]. In particular the libferris [1] Semantic File System.