496 search results - page 17 / 100 » Efficient Implementation of Semantic Relations in Lexical Da... |
BTW
2005
Springer
14 years 1 months ago
2005
Springer
: User-defined data types such as intervals require specialized access methods to be efficiently searched and queried. As database implementors cannot provide appropriate index str...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We consider the problem of mapping data in peer-topeer data-sharing systems. Such systems often rely on the use of mapping tables listing pairs of corresponding values to search f...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
The increasing use of temporal and spatial data in presentday relational systems necessitates an efficient support of joins on interval-valued attributes. Standard join algorithms...
SIGMOD
2001
ACM
14 years 7 months ago
2001
ACM
Virtually all proposals for querying XML include a class of query we term "containment queries". It is also clear that in the foreseeable future, a substantial amount of...