Sciweavers

6846 search results - page 56 / 1370
» Querying a summary of database
Sort
View
PKDD
1999
Springer
106views Data Mining» more  PKDD 1999»
15 years 2 months ago
Heuristic Measures of Interestingness
When mining a large database, the number of patterns discovered can easily exceed the capabilities of a human user to identify interesting results. To address this problem, variou...
Robert J. Hilderman, Howard J. Hamilton
VLDB
2001
ACM
102views Database» more  VLDB 2001»
15 years 2 months ago
Form-Based Proxy Caching for Database-Backed Web Sites
We explore a new proxy-caching framework that exploits the query semantics of HTML forms. We identify a common class of form-based queries, and study two representative caching sc...
Qiong Luo, Jeffrey F. Naughton
DATAMINE
1999
80views more  DATAMINE 1999»
14 years 9 months ago
MSQL: A Query Language for Database Mining
The tremendous number of rules generated in the mining process makes it necessary for any good data mining system to provide for powerful query primitives to post-process the gener...
Tomasz Imielinski, Aashu Virmani
CIKM
2003
Springer
15 years 3 months ago
Dimensionality reduction using magnitude and shape approximations
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Ümit Y. Ogras, Hakan Ferhatosmanoglu
SIGMOD
2001
ACM
115views Database» more  SIGMOD 2001»
15 years 10 months ago
Efficient Evaluation of XML Middle-ware Queries
We address the problem of efficiently constructing materialized XML views of relational databases. In our setting, the XML view is specified by a query in the declarative query la...
Mary F. Fernandez, Atsuyuki Morishima, Dan Suciu