Sciweavers

436 search results - page 50 / 88
» Estimating the Quality of Data in Relational Databases
Sort
View
EDBT
2008
ACM
120views Database» more  EDBT 2008»
15 years 9 months ago
Schema mapping verification: the spicy way
Schema mapping algorithms rely on value correspondences ? i.e., correspondences among semantically related attributes ? to produce complex transformations among data sources. Thes...
Angela Bonifati, Giansalvatore Mecca, Alessandro P...
ICDE
2007
IEEE
153views Database» more  ICDE 2007»
15 years 4 months ago
An Indexing Structure for Automatic Schema Matching
Querying semantically related data sources depends on the ability to map between their schemas. Unfortunately, in most cases matching between schema is still largely performed man...
Fabien Duchateau, Zohra Bellahsene, Mark Roantree,...
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
15 years 11 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
PVLDB
2008
122views more  PVLDB 2008»
14 years 9 months ago
Identifying robust plans through plan diagram reduction
Estimates of predicate selectivities by database query optimizers often differ significantly from those actually encountered during query execution, leading to poor plan choices a...
Harish D., Pooja N. Darera, Jayant R. Haritsa
VLDB
2007
ACM
103views Database» more  VLDB 2007»
15 years 10 months ago
On the Production of Anorexic Plan Diagrams
A "plan diagram" is a pictorial enumeration of the execution plan choices of a database query optimizer over the relational selectivity space. We have shown recently tha...
Harish D., Pooja N. Darera, Jayant R. Haritsa