Sciweavers

55 search results - page 9 / 11
» Reducing Order Enforcement Cost in Complex Query Plans
Sort
View
WWW
2008
ACM
14 years 9 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
14 years 8 days ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ADBIS
2006
Springer
166views Database» more  ADBIS 2006»
14 years 2 months ago
Clustering-Based Materialized View Selection in Data Warehouses
materialized view selection is a non-trivial task. Hence, its complexity must be reduced. A judicious choice of views must be costdriven and influenced by the workload experienced...
Kamel Aouiche, Pierre-Emmanuel Jouve, Jér&o...
ISCA
2007
IEEE
145views Hardware» more  ISCA 2007»
14 years 2 months ago
Mechanisms for store-wait-free multiprocessors
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
Thomas F. Wenisch, Anastassia Ailamaki, Babak Fals...
SARA
2007
Springer
14 years 2 months ago
Reformulating Constraint Satisfaction Problems to Improve Scalability
Constraint Programming is a powerful approach for modeling and solving many combinatorial problems, scalability, however, remains an issue in . Abstraction and reformulation techni...
Kenneth M. Bayer, Martin Michalowski, Berthe Y. Ch...