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

Bjorn Jarisch

dblp:55/5371 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none

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

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

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
1 paper
Information retrieval · 100%

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

TopicWeightPapersLastEvidence papers
Information retrieval › search engines
desktop search
0.112007
Bringing Precision to Desktop Search: A Predicate-based Desktop Search Architecture · ICDE 2007
Information retrieval › search engines
structured data search
0.012007
Bringing Precision to Desktop Search: A Predicate-based Desktop Search Architecture · ICDE 2007

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

implicit predicates · 0.1
YearPublicationVenuePosition
2007 Bringing Precision to Desktop Search: A Predicate-based Desktop Search Architecture
abstract
Google and other products have revolutionized the way we search for information on the Internet, Intranet, and on our desktop. However, the current generation of search products does not exploit the structure and semantics of data, as defined by application programs (e.g., Word or Excel) that generate the data. This paper shows how search technology can be enhanced with implicit predicates, in order to take into account the structure and semantics defined by applications. Better search results are produced with tolerable performance overhead, while at the same time maintaining the simplicity of the keyword search interface.
Jens Dittrich, Cristian Duda, Bjorn Jarisch, Donald Kossmann, Marcos Antonio Vaz Salles
ICDE3