Filters








9 Hits in 1.6 sec

Hyperset Approach to Semi-structured Databases [chapter]

Richard Molyneux, Vladimir Sazonov
2009 Lecture Notes in Computer Science  
We will briefly describe the recently implemented hyperset approach to semi-structured or Web-like and possibly distributed databases with the query system available online at http://www.csc. liv.ac.uk  ...  As this approach is crucially based on the bisimulation relation, the main stress in this paper is on its computation in the distributed case by using a so called bisimulation engine and local approximations  ...  Conclusion While the hyperset approach to semi-structured databases is very natural theoretically and even practically as example queries in [7, 15, 16] show, developing some efficient way of dealing  ... 
doi:10.1007/978-3-642-02843-4_10 fatcat:toy6qjgba5bvvjoczpb5oduriy

Hyperset Approach to Semi-structured Databases and the Experimental Implementation of the Query Language Delta [article]

Richard Molyneux
2009 arXiv   pre-print
This thesis presents practical suggestions towards the implementation of the hyperset approach to semi-structured databases and the associated query language Delta.  ...  This work can be characterised as part of a top-down approach to semi-structured databases, from theory to practice.  ...  This work was made possible by the scholarship awarded to me by the Department of Computer Science.  ... 
arXiv:0902.2504v1 fatcat:enibxpa2gjcxlk65vkbqcsrf5a

Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case

Agostino Dovier, Eugenio G. Omodeo, Alberto Policriti
1999 Applicable Algebra in Engineering, Communication and Computing  
Membership (definable as "d ∈ t = Def ( t with d ) ≈ t") meets the non-well-foundedness property characteristic of hyperset theory.  ...  A goal-driven algorithm for solving the corresponding unification problem is provided, it is proved to be totally correct, and exploited to show that the problem itself is NP-complete.  ...  We are grateful to Giorgio Levi, who encouraged us in pursuing to an end the research reported in this paper.  ... 
doi:10.1007/s002000050109 fatcat:f762ivabozhcpm4uzumaojorxa

The modeling in the course of technical systems investigation: some expansions of the graph theory usage

Alexander Sergeevich Geida
2014 Труды СПИИРАН  
Hyperset approach to semi-structured databases // Dataspace: Gurevich Y. The sequential ASM thesis.  ...  This expansion as the author of article hopes, will allow to simplify technical system (TS) modeling and research.  ... 
doi:10.15622/sp.17.12 fatcat:2fve7szc6vexnhblzmh4nwbizu

HYPERSET/WEB-LIKE DATABASES AND THE EXPERIMENTAL IMPLEMENTATION OF THE QUERY LANGUAGE DELTA - Current State of Affairs
english

2007 Proceedings of the Second International Conference on Software and Data Technologies   unpublished
The hyperset approach to WEB-like or semistructured databases is outlined.  ...  to be done.  ...  Such semi-structured data is represented as abstract sets of sets of sets, etc., even with the possibility of cycles.  ... 
doi:10.5220/0001343200290037 fatcat:dsmo6m4syvahrho6rhcser2xxe

Structuring primitives in the Callimachus component-based open hypermedia system

Manolis Tzagarakis, Dimitris Avramidis, Maria Kyriakopoulou, Monica M.C Schraefel, Michalis Vaitis, Dimitris Christodoulakis
2003 Journal of Network and Computer Applications  
To address the emergent requirements and to facilitate the development of structure servers, structure should be handled as a first class entity.  ...  We propose patterns for structure, called templates, that define the structural model upon which structure servers operate.  ...  His research interests include hypermedia models and services, structural computing, geographical databases and databases interoperability.  ... 
doi:10.1016/s1084-8045(02)00064-4 fatcat:72yh3ix2rvaf5ohgjxrqxtwrri

Linear ordering on graphs, anti-founded sets and polynomial time computability

Alexei Lisitsa, Vladimir Sazonov
1999 Theoretical Computer Science  
Acknowledgements The authors are grateful to the anonymous referee for many helpful comments and suggestions.  ...  Also note, that these definability results may be naturally considered in the framework of a set-theoretic approach to "nested" and "circular" semi-structured databases or to Web-like databases (WDB),  ...  databases; cf. the corresponding approach in [33, 23] .  ... 
doi:10.1016/s0304-3975(98)00312-0 fatcat:6gv3jzaxinfi5onice4lfkrr3m

Set Unification [article]

Agostino Dovier, Enrico Pontelli, Gianfranco Rossi
2005 arXiv   pre-print
This provides also the ability to classify different types of set unification problems. Unification algorithms are uniformly proposed to solve the unification problem in each of such classes.  ...  ., deductive databases, theorem proving, static analysis, rapid software prototyping. The various solutions proposed are spread across a large literature.  ...  Ranjan, all of whom we would like to thank.  ... 
arXiv:cs/0110023v2 fatcat:hcwwa75ubfemng2ooxq5mhtxru

Logics on data words

Ahmet Kara, Technische Universität Dortmund, Technische Universität Dortmund
2016
Finally, we analyse the model checking problem for such systems in the case that data logics are used to specify system requirements.  ...  Thus, data logics can be used to formulate requirements on such traces. We first study the expressivity and complexity of the satisfiability problem for these logics.  ...  A second well-known approach is to model system traces as partially ordered structures.  ... 
doi:10.17877/de290r-17260 fatcat:iuymcqt6tfdkxkxucec2atsfsm