Sciweavers

591 search results - page 56 / 119
» The complexity of XPath query evaluation
Sort
View
CORR
1999
Springer
116views Education» more  CORR 1999»
15 years 3 months ago
Efficient and Extensible Algorithms for Multi Query Optimization
Complex queries are becoming commonplace, with the growing use of decision support systems. These complex queries often have a lot of common sub-expressions, either within a singl...
Prasan Roy, S. Seshadri, S. Sudarshan, Siddhesh Bh...
141
Voted
OPODIS
2007
15 years 4 months ago
Peer to Peer Multidimensional Overlays: Approximating Complex Structures
Peer to peer overlay networks have proven to be a good support for storing and retrieving data in a fully decentralized way. A sound approach is to structure them in such a way tha...
Olivier Beaumont, Anne-Marie Kermarrec, Etienne Ri...
139
Voted
SEMWEB
2009
Springer
15 years 10 months ago
Queries to Hybrid MKNF Knowledge Bases through Oracular Tabling
An important issue for the Semantic Web is how to combine open-world ontology languages with closed-world (non-monotonic) rule paradigms. Several proposals for hybrid languages all...
José Júlio Alferes, Matthias Knorr, ...
GIS
2004
ACM
16 years 4 months ago
Object-relational management of complex geographical objects
Modern database applications including computer-aided design, multimedia information systems, medical imaging, molecular biology, or geographical information systems impose new re...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
EDBT
2006
ACM
121views Database» more  EDBT 2006»
16 years 3 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin