Sciweavers

505 search results - page 11 / 101
» Efficient Temporal Join Processing Using Indices
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
14 years 7 months ago
Evaluating rank joins with optimal cost
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...
Karl Schnaitter, Neoklis Polyzotis
ESWS
2009
Springer
13 years 5 months ago
Applied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
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...
Jonas Tappolet, Abraham Bernstein
VLDB
1997
ACM
134views Database» more  VLDB 1997»
13 years 11 months ago
Spatial Joins Using R-trees: Breadth-First Traversal with Global Optimizations
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...
Yun-Wu Huang, Ning Jing, Elke A. Rundensteiner
ACL
2010
13 years 5 months ago
Temporal Information Processing of a New Language: Fast Porting with Minimal Resources
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...
Francisco Costa, António Branco
SAC
2006
ACM
14 years 1 months ago
Imprecise RDQL: towards generic retrieval in ontologies using similarity joins
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...
Abraham Bernstein, Christoph Kiefer