Abstract. k-ary trees are a fundamental data structure in many textprocessing algorithms (e.g., text searching). The traditional pointer-based representation of trees is space cons...
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
Local tag structures have become frequent through Web 2.0: Users "tag" their data without specifying the underlying semantics. Every user annotates items in an individual...
In self-adaptive systems, metadata about resources in the system (e.g., services, nodes) must be dynamically published, updated, and discarded. Current adaptive middleware approach...
Johannes Oudenstad, Romain Rouvoy, Frank Eliassen,...
This paper presents the rationale, objectives and advances of an on-going project (the DesPho-APaDy project funded by the French National Agency of Research) which aims to provide...