Sciweavers

1846 search results - page 50 / 370
» Generating query substitutions
Sort
View
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
13 years 7 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
ICDE
2009
IEEE
140views Database» more  ICDE 2009»
14 years 9 months ago
Predicting Multiple Metrics for Queries: Better Decisions Enabled by Machine Learning
One of the most challenging aspects of managing a very large data warehouse is identifying how queries will behave before they start executing. Yet knowing their performance charac...
Archana Ganapathi, Harumi A. Kuno, Umeshwar Dayal,...
SSD
2007
Springer
171views Database» more  SSD 2007»
14 years 1 months ago
Transformation of Continuous Aggregation Join Queries over Data Streams
We address continuously processing an aggregation join query over data streams. Queries of this type involve both join and aggregation operations, with windows specified on join ...
Tri Minh Tran, Byung Suk Lee
ICST
2010
IEEE
13 years 6 months ago
When BDDs Fail: Conformance Testing with Symbolic Execution and SMT Solving
—Model-based testing is a well known technique that allows one to validate the correctness of software with respect to its model. If a lot of data is involved, symbolic technique...
Elisabeth Jöbstl, Martin Weiglhofer, Bernhard...
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
14 years 7 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin