Back to Results
First PageMeta Content
Model theory / Finite model theory / Programming paradigms / Conjunctive query / Database theory / FO / Linear temporal logic / Datalog / First-order logic / Theoretical computer science / Mathematical logic / Mathematics


Querying Schemas With Access Restrictions Michael Benedikt Pierre Bourhis Clemens Ley
Add to Reading List

Document Date: 2012-03-24 02:44:30

Open Document

File Size: 279,34 KB

Share Result on Facebook

City

Istanbul / /

Company

X. We / ACS / /

Country

Turkey / /

Currency

pence / USD / /

/

Facility

UK michael.benedikt@cs.ox.ac.uk Oxford University / Querying Schemas With Access Restrictions Michael Benedikt Pierre Bourhis Clemens Ley Oxford University / /

IndustryTerm

web interface / online music / level algorithm / online music site / Web data source / verification algorithms / containment algorithm / Web forms / web form accessing data / query processor / Web-based data-source / web user / Web form / Web telephone directory / brute-force algorithm / Web-based datasource / temporal operator / Web services / /

OperatingSystem

XP / /

Organization

VLDB Endowment / Oxford University / /

Person

Ai / Ii / Ai / Aautomata / Michael Benedikt Pierre Bourhis Clemens Ley / /

Position

natural automaton model for access paths / lower-level automaton model / /

Product

CheckIncDep / /

ProgrammingLanguage

Datalog / /

ProvinceOrState

Pennsylvania / /

Technology

cellular telephone / following algorithm / brute-force algorithm / PSPACE algorithm / relational database / verification algorithms / query processor / high-level algorithm / containment algorithm / /

SocialTag