Sciweavers

432 search results - page 7 / 87
» On Notions of Regularity for Data Languages
Sort
View
PODS
2010
ACM
213views Database» more  PODS 2010»
14 years 19 days ago
Expressive languages for path queries over graph-structured data
For many problems arising in the setting of graph querying (such as finding semantic associations in RDF graphs, exact and approximate pattern matching, sequence alignment, etc.)...
Pablo Barceló, Carlos A. Hurtado, Leonid Li...
PODS
2012
ACM
240views Database» more  PODS 2012»
11 years 10 months ago
Approximate computation and implicit regularization for very large-scale data analysis
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
Michael W. Mahoney
COLING
2010
13 years 2 months ago
Varro: An Algorithm and Toolkit for Regular Structure Discovery in Treebanks
The Varro toolkit is a system for identifying and counting a major class of regularity in treebanks and annotated natural language data in the form of treestructures: frequently r...
Scott Martens
LATA
2009
Springer
14 years 2 months ago
A Kleene Theorem for Forest Languages
This paper proposes an alternative approach to the standard notion of rational (or regular) expression for tree languages. The main difference is that in the new notion we have on...
Lutz Straßburger
VLDB
2004
ACM
99views Database» more  VLDB 2004»
14 years 27 days ago
Query Languages and Data Models for Database Sequences and Data Streams
We study the fundamental limitations of relational algebra (RA) and SQL in supporting sequence and stream queries, and present effective query language and data model enrichments ...
Yan-Nei Law, Haixun Wang, Carlo Zaniolo