Sciweavers

2070 search results - page 207 / 414
» Querying Communities in Relational Databases
Sort
View
90
Voted
ICDE
2010
IEEE
212views Database» more  ICDE 2010»
15 years 11 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
2007
ACM
229views Database» more  VLDB 2007»
15 years 5 months ago
Sum-Max Monotonic Ranked Joins for Evaluating Top-K Twig Queries on Weighted Data Graphs
In many applications, the underlying data (the web, an XML document, or a relational database) can be seen as a graph. These graphs may be enriched with weights, associated with t...
Yan Qi 0002, K. Selçuk Candan, Maria Luisa ...
PODS
2001
ACM
167views Database» more  PODS 2001»
15 years 11 months ago
Querying Websites Using Compact Skeletons
Several commercial applications, such as online comparison shopping and process automation, require integrating information that is scattered across multiple websites or XML docum...
Anand Rajaraman, Jeffrey D. Ullman
KDD
1998
ACM
183views Data Mining» more  KDD 1998»
15 years 3 months ago
Mining Generalized Association Rules and Sequential Patterns Using SQL Queries
Database integration of mining is becoming increasingly important with tile installation of larger and larger data warehouses built around relational database technology. Most of ...
Shiby Thomas, Sunita Sarawagi
AMW
2009
15 years 24 days ago
Data Expiration and Aggregate Queries
We investigate the space requirements for summaries needed for maintaining exact answers to aggregate queries over histories of relational databases. We show that, in general, a su...
David Toman