Eliyahu Safra

Learn More
Given two geographic databases, a fusion algorithm should produce all pairs of corresponding objects (i.e., objects that represent the same real-world entity). Four fusion algorithms, which only use locations of objects, are described and their performance is measured in terms of recall and precision. These algorithms are designed to work even when(More)
As systems are becoming ever larger and more complex, and as more stakeholders, typically from different disciplines, are involved throughout the system lifecycle, the challenge of overcoming the complexity inherent in systems development grows too. While a document-centric approach has been common practice, coping with the growing complexity of current(More)
When integrating geo-spatial datasets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). Algorithms for joining two datasets were studied in the past. This paper investigates integration of three datasets and proposes methods that can be easily generalized to any number of datasets.(More)
A route search is an enhancement of an ordinary geographic search, where instead of merely returning a set of entities, the result is a route that starts in a given location, ends in a specified location, and goes via entities that are relevant to the search. The input to the problem consists of several search queries, and each query defines a type of(More)
An uncertain geo-spatial dataset is a collection of geo-spatial objects that do not represent accurately real-world entities. Each object has a confidence value indicating how likely it is for the object to be correct. Uncertain data can be the result of operations such as imprecise integration, incorrect update or inexact querying. A k-route, over an(More)
In a <i>geographical route search</i>, given search terms, the goal is to find an <i>effective</i> route that <i>(1)</i> starts at a given location, <i>(2)</i> ends at a given location, and <i>(3)</i> travels via geographical entities that are relevant to the given terms. A route is effective if it does not exceed a given distance limit whereas the(More)
In integration of road maps modeled as road vector data, the main task is matching pairs of objects that represent, in different maps, the same segment of a real-world road. In an ad hoc integration, the matching is done for a specific need, and thus, is performed in real time, where only a limited preprocessing is possible. Usually, ad hoc integration is(More)