Sciweavers

591 search results - page 44 / 119
» The complexity of XPath query evaluation
Sort
View
JAPLL
2010
179views more  JAPLL 2010»
13 years 7 months ago
Tractable query answering and rewriting under description logic constraints
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
Héctor Pérez-Urbina, Boris Motik, Ia...
ADC
2006
Springer
110views Database» more  ADC 2006»
14 years 15 days ago
A heuristic approach to cost-efficient fragmentation and allocation of complex value databases
The quality of database distribution design, which involves fragmentation and allocation, should be assessed by the performance of a system. In particular, this applies to non-rel...
Hui Ma, Klaus-Dieter Schewe, Qing Wang
SEBD
1996
94views Database» more  SEBD 1996»
13 years 10 months ago
Efficient Algorithm for determining the Optimal Execution Strategy for Path Queries in OODBS
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
Weimin Chen, Karl Aberer
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
12 years 11 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
SC
2003
ACM
14 years 2 months ago
Nondeterministic Queries in a Relational Grid Information Service
A Grid Information Service (GIS) stores information about the resources of a distributed computing environment and answers questions about it. We are developing RGIS, a GIS system...
Peter A. Dinda, Dong Lu