Sciweavers

154 search results - page 11 / 31
» Exploiting Similarity of Subqueries for Complex Query Optimi...
Sort
View
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 8 months ago
Materialized View Selection by Query Clustering in XML Data Warehouses
XML data warehouses form an interesting basis for decision-support applications that exploit complex data. However, native XML database management systems currently bear limited p...
Hadj Mahboubi, Kamel Aouiche, Jérôme ...
ISMIR
2005
Springer
158views Music» more  ISMIR 2005»
14 years 1 months ago
Exploiting Musical Connections: A Proposal for Support of Work Relationships in a Digital Music Library
Musical works in the Western art music tradition exist in a complex, inter-related web. Works that are derivative or part of another work are common; however, most music informati...
Jenn Riley
ICDE
2010
IEEE
250views Database» more  ICDE 2010»
14 years 5 months ago
Optimized Query Evaluation Using Cooperative Sorts
— Many applications require sorting a table over multiple sort orders: generation of multiple reports from a table, evaluation of a complex query that involves multiple instances...
Yu Cao, Ramadhana Bramandia, Chee-Yong Chan, Kian-...
GLOBECOM
2008
IEEE
13 years 8 months ago
An Efficient Tree Search for Reduced Complexity Sphere Decoding
The complexity of sphere decoding (SD) has been widely studied due to the importance of this algorithm in obtaining the optimal Maximum Likelihood (ML) performance with lower compl...
Luay Azzam, Ender Ayanoglu
DBPL
2001
Springer
115views Database» more  DBPL 2001»
14 years 13 days ago
Optimization Properties for Classes of Conjunctive Regular Path Queries
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
Alin Deutsch, Val Tannen