205 search results - page 13 / 41 » Optimizing Multiple Top-K Queries over Joins |
SIGMOD
2006
ACM
14 years 7 months ago
2006
ACM
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
VLDB
2005
ACM
14 years 1 months ago
2005
ACM
Multi-join queries are the core of any integration service that integrates data from multiple distributed data sources. Due to the large number of data sources and possibly high v...
BTW
2007
Springer
14 years 1 months ago
2007
Springer
: Over the recent years, very little effort has been made to give XPath a proper algebraic treatment. The only laudable exception is the Natix Algebra (NAL) which defines the tran...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
We present a query architecture in which join operators are decomposed into their constituent data structures (State Modules, or SteMs), and dataflow among these SteMs is managed ...
WSDM
2009
ACM
14 years 2 months ago
2009
ACM
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...