Open AccessEfficient Approximations of Conjunctive Queries
Author(s) -
Pablo Barceló,
Leonid Libkin,
Miguel Romero
Publication year - 2014
Publication title -
siam journal on computing
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 1.533
H-Index - 122
eISSN - 1095-7111
pISSN - 0097-5397
DOI - 10.1137/130911731
Subject(s) - conjunctive query , treewidth , homomorphism , bounded function , mathematics , class (philosophy) , approximations of π , boolean conjunctive query , closure (psychology) , spatial query , discrete mathematics , computer science , graph , database , web query classification , web search query , information retrieval , relational database , line graph , pathwidth , search engine , mathematical analysis , artificial intelligence , economics , market economy
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom