Another look at automatic text-retrieval systems
Communications of the ACM
Neptune: a hypertext system for CAD applications
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
On designing intelligent hypertext systems for information management in software engineering
HYPERTEXT '87 Proceedings of the ACM conference on Hypertext
Database abstractions: aggregation and generalization
ACM Transactions on Database Systems (TODS)
IFO: a formal semantic database model
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Cognoter: theory and practice of a colab-orative tool
CSCW '86 Proceedings of the 1986 ACM conference on Computer-supported cooperative work
Contexts: a partitioning concept for hypertext
CSCW '86 Proceedings of the 1986 ACM conference on Computer-supported cooperative work
SNAP: A Graphics-based Schema Manager
Proceedings of the Second International Conference on Data Engineering
Proceedings of the 1980 workshop on Data abstraction, databases and conceptual modeling
Design, implementation, and evaluation of a Revision Control System
ICSE '82 Proceedings of the 6th international conference on Software engineering
A network-based approach to text handling for the on-line scientific community
A network-based approach to text handling for the on-line scientific community
Integrated hypertext and program understanding tools
IBM Systems Journal
Personalized information structures
SIGDOC '93 Proceedings of the 11th annual international conference on Systems documentation
On designing intelligent hypertext systems for information management in software engineering
HYPERTEXT '87 Proceedings of the ACM conference on Hypertext
Proceedings of the sixteenth ACM conference on Hypertext and hypermedia
| Hi-index | 0.00 |
Abstraction is the means by which information can be stored and retrieved from an information structure at different levels of detail and from different perspectives. As such, abstraction mechanisms in hypertext are interesting to study and evaluate. In this paper we study the abstraction mechanisms in hypertext from a theoretical perspective. Abstractions then become various first-order logic formulae. Specifically we consider abstractions: sets, sequences, aggregations, generalizations, revisions, and information structures. Interesting results of this work are the definition of level of generality of a hypertext node, the demonstration of revision histories as a partial order, and the notion of compatible-similar nodes. Also defined in this paper is the notion of primitive hypertexts versus application hypertexts, and the usage of attributes of nodes (illustrated by the use of keywords) across various abstractions. An illustration of the concepts is given using the contexts mechanism suggested by Delisle and Schwartz [DS87].