1552 search results - page 68 / 311 » Creating Database Queries by Demonstration |
126
Voted
ADC
2004
Springer
15 years 6 months ago
2004
Springer
Most modern database applications contain a significant amount of time dependent data and a substantial proportion of this data is now-relative, i.e. current now. While much resea...
198
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
103
click to vote
VLDB
1995
ACM
15 years 6 months ago
1995
ACM
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
203
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
This paper presents a principled framework for efficient processing of ad-hoc top-k (ranking) aggregate queries, which provide the k groups with the highest aggregates as results....
116
Voted
SIGMOD
1999
ACM
15 years 6 months ago
1999
ACM
We explore the execution of queries with client-site userdefined functions (UDFs). Many UDFs can only be executed at the client site, for reasons of scalability, security, confide...