Sciweavers

6846 search results - page 49 / 1370
» Querying a summary of database
Sort
View
ICDE
2003
IEEE
98views Database» more  ICDE 2003»
15 years 11 months ago
XPath Query Evaluation: Improving Time and Space Efficiency
Contemporary XPath query engines evaluate queries in time exponential in the sizes of input queries, a fact that has gone unnoticed for a long time. Recently, the first main
Georg Gottlob, Christoph Koch, Reinhard Pichler
HICSS
1999
IEEE
125views Biometrics» more  HICSS 1999»
15 years 2 months ago
ASHRAM: Active Summarization and Markup
Typically, searching for information in a document collection amounts to refining a query and then scanning a large number of documents to determine their relevance. Active Summar...
Mary S. Neff, James W. Cooper
DOLAP
2000
ACM
15 years 2 months ago
Incremental Update to Aggregated Information for Data Warehouses over Internet
We consider the view maintenance problem in a web-based environment, in which clients query information from databases, stored in the form of materialized data warehouses, without...
Miranda Chan, Hong Va Leong, Antonio Si
IPM
2007
69views more  IPM 2007»
14 years 9 months ago
Investigating sentence weighting components for automatic summarisation
The work described here initially formed part of a triangulation exercise to establish the effectiveness of the Query Term Order algorithm. The methodology produced subsequently p...
Shao Fen Liang, Siobhan Devlin, John Tait
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 10 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali