Sciweavers

76 search results - page 14 / 16
» Enhanced Regular Path Queries on Semistructured Databases
Sort
View
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
13 years 11 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner
PUK
2003
13 years 9 months ago
Accelerating Heuristic Search in Spatial Domains
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
Stefan Edelkamp, Shahid Jabbar, Thomas Willhalm
CIKM
2004
Springer
13 years 11 months ago
Efficient processing of XML twig patterns with parent child edges: a look-ahead approach
With the growing importance of semi-structure data in information exchange, much research has been done to provide an effective mechanism to match a twig query in an XML database....
Jiaheng Lu, Ting Chen, Tok Wang Ling
DOCENG
2009
ACM
14 years 2 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 8 months ago
Relational-style XML query
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...
Taro L. Saito, Shinichi Morishita