Sciweavers

163 search results - page 8 / 33
» Pattern based processing of XPath queries
Sort
View
89
Voted
IJSWIS
2008
135views more  IJSWIS 2008»
14 years 11 months ago
Efficient Processing of RDF Queries with Nested Optional Graph Patterns in an RDBMS
Relational technology has shown to be very useful for scalable Semantic Web data management. Numerous researchers have proposed to use RDBMSs to store and query voluminous RDF dat...
Artem Chebotko, Shiyong Lu, Mustafa Atay, Farshad ...
WWW
2005
ACM
16 years 9 days ago
TJFast: effective processing of XML twig pattern matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process ...
Jiaheng Lu, Ting Chen, Tok Wang Ling
PVLDB
2008
123views more  PVLDB 2008»
14 years 11 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...
110
Voted
ADBIS
2001
Springer
115views Database» more  ADBIS 2001»
15 years 4 months ago
Interactive Constraint-Based Sequential Pattern Mining
Data mining is an interactive and iterative process. It is very likely that a user will execute a series of similar queries differing in pattern constraints and mining parameters,...
Marek Wojciechowski
89
Voted
CORR
2012
Springer
222views Education» more  CORR 2012»
13 years 7 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach