Sciweavers

1989 search results - page 197 / 398
» A framework for testing database applications
Sort
View
VLDB
2001
ACM
168views Database» more  VLDB 2001»
14 years 8 months ago
Answering queries using views: A survey
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 accessin...
Alon Y. Halevy
VLDB
2007
ACM
104views Database» more  VLDB 2007»
14 years 8 months ago
Unifying Data and Domain Knowledge Using Virtual Views
The database community is on a constant quest for better integration of data management and knowledge management. Recently, with the increasing use of ontology in various applicat...
Lipyeow Lim, Haixun Wang, Min Wang
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 8 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
DEXA
1995
Springer
96views Database» more  DEXA 1995»
13 years 12 months ago
Knowledge Organization for Exploration
To support applications, such as efficient browsing in large knowledge bases and cooperative knowledge discovery in large databases, the concept of rule similarity is essential. In...
Amihai Motro, Sylvie Goullioud
WEBDB
2000
Springer
136views Database» more  WEBDB 2000»
13 years 12 months ago
An Optimization Technique for Answering Regular Path Queries
Rewriting queries using views is a powerful technique that has applications in data integration, data warehousing and query optimization. Query rewriting in relational databases i...
Gösta Grahne, Alex Thomo