Modulo-counting quantifiers over finite trees
Theoretical Computer Science - Selected papers of the 17th Colloquium on Trees in Algebra and Programming (CAAP '92) and of the European Symposium on Programming (ESOP), Rennes, France, Feb. 1992
Optimization of sequence queries in database systems
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Sequential Pattern Query Language for Supporting Instant Data Mining for e-Services
Proceedings of the 27th International Conference on Very Large Data Bases
XPath queries on streaming data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Expressing and optimizing sequence queries in database systems
ACM Transactions on Database Systems (TODS)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Order checking in a CPOE using event analyzer
Proceedings of the 14th ACM international conference on Information and knowledge management
Unifying the Processing of XML Streams and Relational Data Streams
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
High-performance complex event processing over streams
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
MonetDB/XQuery: a fast XQuery processor powered by a relational engine
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XMark: a benchmark for XML data management
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Navigational XPath: calculus and algebra
ACM SIGMOD Record
Scalable complex pattern search in sequential data
Proceedings of the 17th ACM conference on Information and knowledge management
On Supporting Kleene Closure over Event Streams
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
DejaVu: declarative pattern matching over live and archived streams of events
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Query Automata for Nested Words
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Event-Oriented Data Models and Temporal Queries in Transaction-Time Databases
TIME '09 Proceedings of the 2009 16th International Symposium on Temporal Representation and Reasoning
Proceedings of the VLDB Endowment
Microsoft CEP server and online behavioral targeting
Proceedings of the VLDB Endowment
K*SQL: a unifying engine for sequence patterns and XML
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Axiomatizing the logical core of XPath 2.0
ICDT'07 Proceedings of the 11th international conference on Database Theory
Towards expressive publish/subscribe systems
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Relational languages and data models for continuous queries on sequences and data streams
ACM Transactions on Database Systems (TODS)
High-performance complex event processing over XML streams
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Proceedings of the 13th International Middleware Conference
High-performance complex event processing over hierarchical data
ACM Transactions on Database Systems (TODS) - Invited papers issue
Hi-index | 0.00 |
There is growing interest in query language extensions for pattern matching over event streams and stored database sequences, due to the many important applications that such extensions make possible. The push for such extensions has led DBMS vendors and DSMS venture companies to propose Kleene-closure extensions of SQL standards, building on seminal research that demonstrated the effectiveness and amenability to efficient implementation of such constructs. These extensions, however powerful, suffer from limitations that severely impair their effectiveness in many real-world applications. To overcome these problems, we have designed the K*SQL language and system, based on our investigation of the nested words, which are recent models that generalize both words and trees. K*SQL extends the existing relational sequence languages, and also enables applications from other domains such as genomics, software analysis, and XML processing. At the same time, K*SQL remains extremely efficient, using our powerful optimizations for pattern search over nested words. Furthermore, we show that other sequence languages and XPath can be automatically translated into K*SQL, allowing for K*SQL to be also used as a high-performance query execution back-end for those languages. Therefore, K*SQL is a unifying SQL-based engine for sequence and XML queries, which provides novel optimization techniques for both.