505 search results - page 11 / 101 » Efficient Temporal Join Processing Using Indices |
PODS
2008
ACM
15 years 11 months ago
2008
ACM
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
131
click to vote
ESWS
2009
Springer
14 years 9 months ago
2009
Springer
Many applications operate on time-sensitive data. Some of these data are only valid for certain intervals (e.g., job-assignments, versions of software code), others describe tempor...
VLDB
1997
ACM
15 years 3 months ago
1997
ACM
R-tree based spatial join is useful because of both its superior performance and the wide spread implementation of R-trees. We present a new R-tree join method called BFRJ (Breadt...
ACL
2010
14 years 9 months ago
2010
We describe the semi-automatic adaptation of a TimeML annotated corpus from English to Portuguese, a language for which TimeML annotated data was not available yet. In order to va...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
Traditional semantic web query languages support a logicbased access to the semantic web. They offer a retrieval (or reasoning) of data based on facts. On the traditional web and...