Sciweavers

37 search results - page 3 / 8
» A Comparative Evaluation of Query Modeling Cost of SQL MDR
Sort
View
JOT
2010
108views more  JOT 2010»
13 years 6 months ago
Extending Scala with Database Query Capability
Abstract The integration of database and programming languages is difficult due to the different data models and type systems prevalent in each field. We present a solution wher...
Miguel Garcia, Anastasia Izmaylova, Sibylle Schupp
EDBT
2004
ACM
147views Database» more  EDBT 2004»
14 years 8 months ago
Projection Pushing Revisited
The join operation, which combines tuples from multiple relations, is the most fundamental and, typically, the most expensive operation in database queries. The standard approach t...
Benjamin J. McMahan, Guoqiang Pan, Patrick Porter,...
SIGMOD
2002
ACM
172views Database» more  SIGMOD 2002»
14 years 8 months ago
Automating physical database design in a parallel database
Physical database design is important for query performance in a shared-nothing parallel database system, in which data is horizontally partitioned among multiple independent node...
Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman
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...
ICDE
2010
IEEE
189views Database» more  ICDE 2010»
13 years 8 months ago
Caching all plans with just one optimizer call
Abstract— Modern database management systems (DBMS) answer a multitude of complex queries on increasingly larger datasets. Given the complexities of the queries and the numerous ...
Debabrata Dash, Ioannis Alagiannis, Cristina Maier...