Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuri Kosharovsky

dblp:11/3728 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Data models and query languages · 52% Query processing and optimization · 48%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Query processing and optimization
query execution
0.112009
Query evaluation over probabilistic XML · VLDB J. 2009
Query processing and optimization
probabilistic query processing
0.112008
Query efficiency in probabilistic XML models · SIGMOD Conference 2008
Data models and query languages › uncertain data › probabilistic data
probabilistic XML
0.112008
Query efficiency in probabilistic XML models · SIGMOD Conference 2008
Data models and query languages › XML query languages
twig query
0.112008
Query efficiency in probabilistic XML models · SIGMOD Conference 2008
Data models and query languages › uncertain data
probabilistic data model
0.012009
Query evaluation over probabilistic XML · VLDB J. 2009

Methods — techniques the papers use, named apart from their topics

value-based semantics · 0.1p-document abstraction · 0.1object-based semantics · 0.1
YearPublicationVenuePosition
2009 Query evaluation over probabilistic XML
Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv
VLDB J.2
2008 Query efficiency in probabilistic XML models
abstract
Various known models of probabilistic XML can be represented as instantiations of abstract p-documents. Such documents have, in addition to ordinary nodes, distributional nodes that specify the probabilistic process of generating a random document. Within this abstraction, families of pdocuments, which are natural extensions and combinations of previous models, are considered. The focus is on efficiency of applying twig queries (with projection) to p-documents. A closely related issue is the ability to (efficiently) translate a given document of one family into another family. Furthermore, both of these tasks have two variants that correspond to the value-based and object-based semantics.
Benny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv
SIGMOD Conference2