Sciweavers

518 search results - page 57 / 104
» Querying XML Views of Relational Data
Sort
View
SIGMOD
2006
ACM
194views Database» more  SIGMOD 2006»
15 years 12 months ago
Graph-based synopses for relational selectivity estimation
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
Joshua Spiegel, Neoklis Polyzotis
IDEAS
2007
IEEE
148views Database» more  IDEAS 2007»
15 years 6 months ago
Boundedness of Regular Path Queries in Data Integration Systems
In this paper we study the problem of deciding whether a regular path query over views in data-integration systems can be re-expressed without recursion. The problem becomes chall...
Gösta Grahne, Alex Thomo
DAWAK
1999
Springer
15 years 4 months ago
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
Spyros Ligoudistianos, Timos K. Sellis, Dimitri Th...
SIGMOD
1999
ACM
138views Database» more  SIGMOD 1999»
15 years 4 months ago
Storing Semistructured Data with STORED
Systems for managing and querying semistructured-data sources often store data in proprietary object repositories or in a tagged-text format. We describe a technique that can use ...
Alin Deutsch, Mary F. Fernández, Dan Suciu
CACM
1998
110views more  CACM 1998»
14 years 11 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon