San Francisco / Metz / Seattle / Tucson / Dallas / Marianske Lazne / Boulder / Paris / Berlin / Cannes / Crete / Cambridge / Chicago / San Jose / /
Company
Knowledge Base Systems / Oracle / HYPERTREE DECOMPOSITIONS We / Let us / Computer Science Press / /
Country
France / United States / Canada / Greece / Czech Republic / / /
EntertainmentAwardEvent
Cannes / /
Facility
Vienna University of Technology / To shed / Prentice Hall / University of Amsterdam / University of Toronto / /
IndustryTerm
parallel algorithms / real world applications / backtrack-bounded search / polynomial-time algorithm / typical query answering algorithms / search problem / real-world applications / database management systems / polynomial time algorithm / view-based query processing / linear-time algorithms / larger search space / search space / /
OperatingSystem
Windows XP Professional / /
Organization
University of Toronto / Toronto / Department of Computer Science / University of Amsterdam / Vienna University of Technology / /
Person
Leonid Libkin / Max Theorem / Gianluigi Greco / Georg Gottlob / J. Van Benthem / Morgan Kaufmann / Francesco Scarcello / Nicola Leone / Van Benthem / Alfredo Mazzitelli / /
Query Answering Exploiting Structural Properties∗ Francesco Scarcello DEIS, Universita` della Calabria, Italy