228 search results - page 30 / 46 » Relational queries over interpreted structures |
145
click to vote
SGAI
2004
Springer
15 years 9 months ago
2004
Springer
We exploit the combinatorial structure of conceptual graphs in order to obtain faster execution time when computing projection, which is a core generalisation-specialisation relat...
153
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
239
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
167
click to vote
ICDE
2002
IEEE
15 years 9 months ago
2002
IEEE
Soon, much of the data exchanged over the Internet will be encoded in XML, allowing for sophisticated filtering and content-based routing. We have built a filtering engine called ...
148
click to vote
SIGMOD
2003
ACM
16 years 4 months ago
2003
ACM
Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding ...