Sciweavers

1679 search results - page 19 / 336
» Pointcuts as Functional Queries
Sort
View
PODS
2010
ACM
205views Database» more  PODS 2010»
14 years 15 days ago
Positive higher-order queries
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
Michael Benedikt, Gabriele Puppis, Huy Vu
ICALP
2001
Springer
13 years 12 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
PVLDB
2008
118views more  PVLDB 2008»
13 years 6 months ago
Efficient top-k processing over query-dependent functions
We study the efficient evaluation of top-k queries over data items, where the score of each item is dynamically computed by applying an item-specific function whose parameter valu...
Lin Guo, Sihem Amer-Yahia, Raghu Ramakrishnan, Jay...
ER
2010
Springer
129views Database» more  ER 2010»
13 years 6 months ago
Specifying Aggregation Functions in Multidimensional Models with OCL
Multidimensional models are at the core of data warehouse systems, since they allow decision makers to early define the relevant information and queries that are required to satis...
Jordi Cabot, Jose-Norberto Mazón, Jes&uacut...
VLDB
1987
ACM
104views Database» more  VLDB 1987»
13 years 11 months ago
Magic Functions: A Technique to Optimize Extended Datalog Recursive Programs
Severalmethodshavebeenproposedto compile recursive Datalog programs. The most well-known perform a rewriting of rules using MAGIC or PROBLEM predicates in order to push selections...
Georges Gardarin