Sciweavers

103 search results - page 13 / 21
» Views and queries: determinacy and rewriting
Sort
View
ICDT
2001
ACM
86views Database» more  ICDT 2001»
14 years 2 months ago
Minimizing View Sets without Losing Query-Answering Power
Abstract. The problem of answering queries using views has been studied extensively due to its relevance in a wide variety of data-management applications. In these applications, w...
Chen Li, Mayank Bawa, Jeffrey D. Ullman
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
14 years 9 months ago
ViewJoin: Efficient View-based Evaluation of Tree Pattern Queries
A fundamental problem in XML query processing is tree pattern query (TPQ) matching which computes all data instances in an XML database that match an input TPQ. There is a lot of r...
Ding Chen, Chee-Yong Chan
VLDB
2001
ACM
157views Database» more  VLDB 2001»
14 years 10 months ago
MiniCon: A scalable algorithm for answering queries using views
The problem of answering queries using views is to find efficient methods of answering a query using a set of previously materialized views over the database, rather than accessing...
Rachel Pottinger, Alon Y. Halevy
SIGMOD
1997
ACM
159views Database» more  SIGMOD 1997»
14 years 1 months ago
On-Line Warehouse View Maintenance
Data warehouses store materialized views over base data from external sources. Clients typically perform complex read-only queries on the views. The views are refreshed periodical...
Dallan Quass, Jennifer Widom
ESWS
2008
Springer
13 years 11 months ago
Viewing and Querying Topic Maps in terms of RDF
Both Topic Maps and RDF are popular semantic web standards designed for machine processing of web documents. Since these representations were originally created for different purpo...
Silvia Stefanova, Tore Risch