Sciweavers

525 search results - page 26 / 105
» On Query Algebras for Probabilistic Databases
Sort
View
ICDE
2007
IEEE
134views Database» more  ICDE 2007»
16 years 28 days ago
Efficient Top-k Query Evaluation on Probabilistic Data
Modern enterprise applications are forced to deal with unreliable, inconsistent and imprecise information. Probabilistic databases can model such data naturally, but SQL query eva...
Christopher Re, Nilesh N. Dalvi, Dan Suciu
ADBIS
2007
Springer
130views Database» more  ADBIS 2007»
15 years 1 months ago
Graphical Querying of Multidimensional Databases
This paper provides an answer-oriented multidimensional analysis environment. The approach is based on a conceptual point of view. We define a conceptual model that represents data...
Franck Ravat, Olivier Teste, Ronan Tournier, Gille...
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
15 years 12 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 4 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
ICDE
2005
IEEE
107views Database» more  ICDE 2005»
15 years 5 months ago
Search Experiment of Business-Rule by Dynamic Constraint Algebra
Abstract Although e-commerce is becoming popular, product rules, which describe various conditions such as prices, applicability, and discount conditions are still expressed in nat...
Rui Kimura, Takayuki Shiga, Mizuho Iwaihara