Zobrazeno 1 - 10
of 140
pro vyhledávání: '"Yehoshua Sagiv"'
Publikováno v:
ACM Transactions on the Web. 11:1-32
This article investigates the problem of geosocial similarity among users of online social networks, based on the locations of their activities (e.g., posting messages or photographs). Finding pairs of geosocially similar users or detecting that two
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::990acc71ce4cf40320dcf61e5d482898
https://doi.org/10.1145/3054951
https://doi.org/10.1145/3054951
Publikováno v:
International Journal of Geographical Information Science. 27:114-153
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::38bfbc7c7c40697096668715ad7aff75
https://doi.org/10.1080/13658816.2012.667104
https://doi.org/10.1080/13658816.2012.667104
Publikováno v:
Proceedings of the VLDB Endowment. 4:1028-1039
Lawler-Murty's procedure is a general tool for designing algorithms for enumeration problems (i.e., problems that involve the production of a large set of answers in ranked order), which naturally arise in database management. Lawler-Murty's procedur
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d3c24ecb74497e1d7f4d53ee68299011
https://doi.org/10.14778/3402707.3402739
https://doi.org/10.14778/3402707.3402739
Publikováno v:
Proceedings of the VLDB Endowment. 3:117-128
A route search is an enhancement of an ordinary geographic search. Instead of merely returning a set of entities, the result is a route that goes via entities that are relevant to the search. The input to the problem consists of several search querie
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4d9bb7acc2b129025b20c6439e2c4e17
https://doi.org/10.14778/1920841.1920861
https://doi.org/10.14778/1920841.1920861
Publikováno v:
International Journal of Geographical Information Science. 24:69-106
When integrating geo-spatial data sets, a join algorithm is used for finding sets of corresponding objects (i.e., objects that represent the same real-world entity). This article investigates location-based join algorithms for integration of several
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0059bd61f8da7d93a3fe81a1a77cad1
https://doi.org/10.1080/13658810802275560
https://doi.org/10.1080/13658810802275560
Publikováno v:
The VLDB Journal
The VLDB Journal, Springer, 2009
The VLDB Journal, 2009
The VLDB Journal, Springer, 2009
The VLDB Journal, 2009
Various known models of probabilistic XML can be represented as instantiations of the abstract notion of p-documents. In addition to ordinary nodes, p-documents have distributional nodes that specify the possible worlds and their probabilistic distri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca5d3bcfac918d59e3219bfc706f7156
https://doi.org/10.1007/s00778-009-0146-1
https://doi.org/10.1007/s00778-009-0146-1
Autor:
Yehoshua Sagiv, Benny Kimelfeld
Publikováno v:
ACM SIGMOD Record. 37:69-77
We survey recent results on modeling and querying probabilistic XML data. The literature contains a plethora of probabilistic XML models [2, 13, 14, 18, 21, 24, 27], and most of them can be represented by means of p-documents [18] that have, in addit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e000e7db882984706afec51c6afd4538
https://doi.org/10.1145/1519103.1519115
https://doi.org/10.1145/1519103.1519115
Publikováno v:
Journal of Computer and System Sciences. 74(7):1147-1159
This paper investigates a graph enumeration problem, called the maximal P-subgraphs problem, where P is a hereditary or connected-hereditary graph property. Formally, given a graph G, the maximal P-subgraphs problem is to generate all maximal induced
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c74eb720f87f406ee2dd8ce0e37d45f
Autor:
Yehoshua Sagiv, Benny Kimelfeld
Publikováno v:
Information Systems. 33:335-359
Various approaches for keyword search in different settings (e.g., relational databases and XML) actually deal with the problem of enumerating K-fragments. For a given set of keywords K, a K-fragment is a subtree T of the given data graph, such that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6096a9618cfbe9744f805985807fecf4
https://doi.org/10.1016/j.is.2008.01.002
https://doi.org/10.1016/j.is.2008.01.002
Autor:
Yehoshua Sagiv, Konstantin Golenberg
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319444055
A data graph is a convenient paradigm for supporting keyword search that takes into account available semantic structure and not just textual relevance. However, the problem of constructing data graphs that facilitate both efficiency and effectivenes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d20543ff035e03e764a29cea34ee1397
https://doi.org/10.1007/978-3-319-44406-2_33
https://doi.org/10.1007/978-3-319-44406-2_33
