Sciweavers

3368 search results - page 156 / 674
» The Complexity of Query Reliability
Sort
View
120
Voted
PODS
2010
ACM
242views Database» more  PODS 2010»
15 years 7 months ago
Certain answers for XML queries
The notion of certain answers arises when one queries incompletely specified databases, e.g., in data integration and exchange scenarios, or databases with missing information. W...
Claire David, Leonid Libkin, Filip Murlak
SIGMOD
1997
ACM
107views Database» more  SIGMOD 1997»
15 years 6 months ago
Range Queries in OLAP Data Cubes
A range query applies an aggregation operation over all selected cells of an OLAP data cube where the selection is speci ed by providing ranges of values for numeric dimensions. W...
Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ram...
DBPL
1995
Springer
106views Database» more  DBPL 1995»
15 years 6 months ago
On Impossibility of Decremental Recomputation of Recursive Queries in Relational Calculus and SQL
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
Guozhu Dong, Leonid Libkin, Limsoon Wong
AUSAI
2008
Springer
15 years 4 months ago
Exploiting Ontological Structure for Complex Preference Assembly
When a user is looking for a product recommendation they usually lack expert knowledge regarding the items they are looking for. Ontologies on the other hand are crafted by experts...
Gil Chamiel, Maurice Pagnucco
COMPGEOM
2005
ACM
15 years 4 months ago
The Visibility-Voronoi Complex and Its Applications
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...
Ron Wein, Jur P. van den Berg, Dan Halperin