TY - JOUR
T1 - A logical query language for hypermedia systems
AU - Beeri, Catriel
AU - Kornatzky, Yoram
PY - 1994/3
Y1 - 1994/3
N2 - Hypermedia systems store interlinked collections of information of various media such as text, image, voice and animation. Such interlinked collections of information, called hyperdocuments, generalize conventional paper documents by directly representing the conceptual structure of the information, a graph whose nodes represent information chunks and whose links represent the organizational structure of the information. The search capabilities of current hypermedia systems are limited to retrieving individual nodes and links based on predicates on their local attributes and contents. To support sophisticated applications and user-tailored views of a hyperdocument, we need a query language able to retrieve parts of a hyperdocument based on a specification of their structure. We present a logical query language permitting the formulation of such structural queries over hyperdocuments. The language is based on prepositional modal logic and admits a simple and efficient implementation over available hypermedia storage systems. While the language is propositional, it includes a general notion of quantifier of the form appropriate for hyperdocument graphs; quantifiers are used for expressing assertions of the form: "For most paths from the current node, claim X holds.".
AB - Hypermedia systems store interlinked collections of information of various media such as text, image, voice and animation. Such interlinked collections of information, called hyperdocuments, generalize conventional paper documents by directly representing the conceptual structure of the information, a graph whose nodes represent information chunks and whose links represent the organizational structure of the information. The search capabilities of current hypermedia systems are limited to retrieving individual nodes and links based on predicates on their local attributes and contents. To support sophisticated applications and user-tailored views of a hyperdocument, we need a query language able to retrieve parts of a hyperdocument based on a specification of their structure. We present a logical query language permitting the formulation of such structural queries over hyperdocuments. The language is based on prepositional modal logic and admits a simple and efficient implementation over available hypermedia storage systems. While the language is propositional, it includes a general notion of quantifier of the form appropriate for hyperdocument graphs; quantifiers are used for expressing assertions of the form: "For most paths from the current node, claim X holds.".
UR - http://www.scopus.com/inward/record.url?scp=0002548490&partnerID=8YFLogxK
U2 - 10.1016/0020-0255(94)90046-9
DO - 10.1016/0020-0255(94)90046-9
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0002548490
SN - 0020-0255
VL - 77
SP - 1
EP - 37
JO - Information Sciences
JF - Information Sciences
IS - 1-2
ER -