Sciweavers

479 search results - page 53 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
IFIP
2004
Springer
14 years 2 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
EDBT
2006
ACM
150views Database» more  EDBT 2006»
14 years 26 days ago
A Framework for Distributed XML Data Management
As data management applications grow more complex, they may need efficient distributed query processing, but also subscription management, data archival etc. To enact such applicat...
Serge Abiteboul, Ioana Manolescu, Emanuel Taropa
ICEIS
2006
IEEE
14 years 3 months ago
Filtering Unsatisfiable XPATH Queries
The satisfiability test checks, whether or not the evaluation of a query returns the empty set for any input document, and can be used in query optimization for avoiding the submis...
Jinghua Groppe, Sven Groppe
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
SIGMOD
2008
ACM
161views Database» more  SIGMOD 2008»
14 years 9 months ago
Efficient pattern matching over event streams
Pattern matching over event streams is increasingly being employed in many areas including financial services, RFIDbased inventory management, click stream analysis, and electroni...
Jagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Ne...