Sciweavers

5055 search results - page 677 / 1011
» Relative Timing
Sort
View
VLDB
2005
ACM
165views Database» more  VLDB 2005»
16 years 7 days ago
Semantic Adaptation of Schema Mappings when Schemas Evolve
Schemas evolve over time to accommodate the changes in the information they represent. Such evolution causes invalidation of various artifacts depending on the schemas, such as sc...
Cong Yu, Lucian Popa
VLDB
2005
ACM
121views Database» more  VLDB 2005»
16 years 7 days ago
Online Estimation For Subset-Based SQL Queries
The largest databases in use today are so large that answering a query exactly can take minutes, hours, or even days. One way to address this problem is to make use of approximati...
Chris Jermaine, Alin Dobra, Abhijit Pol, Shantanu ...
VLDB
2005
ACM
115views Database» more  VLDB 2005»
16 years 7 days ago
KLEE: A Framework for Distributed Top-k Query Algorithms
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
Sebastian Michel, Peter Triantafillou, Gerhard Wei...
VMCAI
2005
Springer
16 years 7 days ago
Checking Herbrand Equalities and Beyond
A Herbrand equality between expressions in a program is an equality which holds relative to the Herbrand interpretation of operators. We show that the problem of checking validity ...
Markus Müller-Olm, Oliver Rüthing, Helmu...
WAOA
2005
Springer
112views Algorithms» more  WAOA 2005»
16 years 7 days ago
Partial Multicuts in Trees
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
Asaf Levin, Danny Segev