4081 search results - page 298 / 817 » Metaprogramming for Relational Databases |
188
click to vote
DBPL
1991
Springer
15 years 10 months ago
1991
Springer
We propose a programming paradigm that tries to get close to both the semantic simplicity of relational algebra, and the expressive power of unrestricted programming languages. It...
252
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been o...
295
click to vote
ICDE
2009
IEEE
16 years 8 months ago
2009
IEEE
Most recommendation methods are `hard-wired' into the system and they support only fixed recommendations. The purpose of this demo is to show the expressivity of flexible reco...
180
click to vote
DEXAW
2006
IEEE
16 years 22 days ago
2006
IEEE
The concepts of bipolar queries and queries with preferences are studied. Various interpretations of the former, recently defined by Dubois and Prade, are discussed. The latter w...
176
Voted
DBPL
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...