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

Alexandru Chitea

dblp:54/2583 · 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 · 72% Graph data management · 28%

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

TopicWeightPapersLastEvidence papers
Graph data management › graph query
graph pattern query
0.112007
ESTER: efficient search on text, entities, and relations · SIGIR 2007
Information retrieval
query processing
0.112007
ESTER: efficient search on text, entities, and relations · SIGIR 2007
Information retrieval › search engines
semantic search
0.112007
ESTER: efficient search on text, entities, and relations · SIGIR 2007
Information retrieval
indexing
0.012007
ESTER: efficient search on text, entities, and relations · SIGIR 2007
Information retrieval › keyword search
prefix search
0.012007
ESTER: efficient search on text, entities, and relations · SIGIR 2007
YearPublicationVenuePosition
2007 ESTER: efficient search on text, entities, and relations
abstract
We present ESTER, a modular and highly efficient system for combined full-text and ontology search. ESTER builds on a query engine that supports two basic operations: prefix search and join. Both of these can be implemented very efficiently with a compact index, yet in combination provide powerful querying capabilities. We show how ESTER can answer basic SPARQL graph-pattern queries on the ontology by reducing them to a small number of these two basic operations. ESTER further supports a natural blend of such semantic queries with ordinary full-text queries. Moreover, the prefix search operation allows for a fully interactive and proactive user interface, which after every keystroke suggests to the user possible semantic interpretations of his or her query, and speculatively executes the most likely of these interpretations. As a proof of concept, we applied ESTER to the English Wikipedia, which contains about 3 million documents, combined with the recent YAGO ontology, which contains about 2.5 million facts. For a variety of complex queries, ESTER achieves worst-case query processing times of a fraction of a second, on a single machine, with an index size of about 4 GB.
Hannah Bast, Alexandru Chitea, Fabian M. Suchanek, Ingmar Weber
SIGIR2