Sciweavers

1552 search results - page 68 / 311
» Creating Database Queries by Demonstration
Sort
View
ADC
2004
Springer
88views Database» more  ADC 2004»
15 years 1 months ago
An Efficient Method for Indexing Now-relative Bitemporal data
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...
Bela Stantic, Sankalp Khanna, John Thornton
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
15 years 11 months ago
Designing and Evaluating an XPath Dialect for Linguistic Queries
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...
Steven Bird, Yi Chen, Susan B. Davidson, Haejoong ...
VLDB
1995
ACM
96views Database» more  VLDB 1995»
15 years 1 months ago
The Fittest Survives: An Adaptive Approach to Query Optimization
Traditionally, optimizers are “programmed” to optimize queries following a set of buildin procedures. However, optimizers should be robust to its changing environment to gener...
Hongjun Lu, Kian-Lee Tan, Son Dao
SIGMOD
2006
ACM
110views Database» more  SIGMOD 2006»
15 years 10 months ago
Supporting ad-hoc ranking aggregates
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....
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas
SIGMOD
1999
ACM
107views Database» more  SIGMOD 1999»
15 years 2 months ago
Client-Site Query Extensions
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...
Tobias Mayr, Praveen Seshadri