Sciweavers

4961 search results - page 391 / 993
» Homomorphism-Homogeneous Relational Structures
Sort
View
AAAI
2007
15 years 7 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
ORDER
2006
128views more  ORDER 2006»
15 years 4 months ago
Algebras Defined from Ordered Sets and the Varieties they Generate
We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by the...
Joel Berman, Willem J. Blok
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 5 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
DAARC
2007
Springer
120views Algorithms» more  DAARC 2007»
15 years 11 months ago
Empirically Assessing Effects of the Right Frontier Constraint
In a questionnaire study the effects of discourse structural information on resolving inter-sentential anaphora were investigated. The Right Frontier Constraint, first proposed by ...
Anke Holler, Lisa Irmen
COMPSAC
2010
IEEE
15 years 2 months ago
A Consistency Model for Identity Information in Distributed Systems
In distributed IT systems, replication of information is commonly used to strengthen the fault tolerance on a technical level or the autonomy of an organization on a business level...
Thorsten Höllrigl, Jochen Dinger, Hannes Hart...