Sciweavers

44 search results - page 2 / 9
» Algebraic Rewritings for Optimizing Regular Path Queries
Sort
View
PODS
1999
ACM
105views Database» more  PODS 1999»
13 years 9 months ago
Rewriting of Regular Expressions and Regular Path Queries
Diego Calvanese, Giuseppe De Giacomo, Maurizio Len...
CIKM
2007
Springer
13 years 11 months ago
Towards practically feasible answering of regular path queries in lav data integration
Regular path queries (RPQ’s) are given by means of regular expressions and ask for matching patterns on labeled graphs. RPQ’s have received great attention in the context of s...
Manuel Tamashiro, Alex Thomo, Srinivasan Venkatesh
DBPL
1995
Springer
144views Database» more  DBPL 1995»
13 years 8 months ago
An Algebraic Framework for Physical OODB Design
Physical design for object-oriented databases is still in its infancy. Implementation decisions often intrude into the conceptual design (such as inverse links and object decompos...
Leonidas Fegaras, David Maier
SIGMOD
2008
ACM
143views Database» more  SIGMOD 2008»
14 years 5 months ago
XML query optimization in the presence of side effects
The emergence of database languages with side effects, notably for XML, raises significant challenges for database compilers and optimizers. In this paper, we extend an algebra fo...
Giorgio Ghelli, Nicola Onose, Kristoffer Hø...
SIGMOD
1996
ACM
132views Database» more  SIGMOD 1996»
13 years 9 months ago
Cost-Based Optimization for Magic: Algebra and Implementation
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
Praveen Seshadri, Joseph M. Hellerstein, Hamid Pir...