29 Hits in 4.0 sec

Streaming enumeration on nested documents [article]

Martín Muñoz, Cristian Riveros
2022 arXiv   pre-print
This paper presents an algorithm that enumerates these elements with constant-delay after processing the document stream in a single pass.  ...  as possible, namely, with constant-delay.  ...  for query evaluation over nested documents.  ... 
arXiv:2010.06037v3 fatcat:5auijmghuzfbzji2rpxou5kioy

Efficient Enumeration Algorithms for Regular Document Spanners

Fernando Florenzano, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, Domagoj Vrgoč
2020 ACM Transactions on Database Systems  
Towards this goal, we present a practical evaluation algorithm that allows output-linear delay enumeration of a spanner's result after a precomputation phase that is linear in the document.  ...  Finally, we study the related problem of counting the number of outputs of a document spanner and provide a fine grained analysis of the classes of document spanners that support efficient enumeration  ...  Florenzano, Riveros and Vrgoč were partially supported by Millennium Institute for Foundational Research on Data.  ... 
doi:10.1145/3351451 fatcat:ejksofqagzbkhousqqhf3bxqbu

Constant delay algorithms for regular document spanners [article]

Fernando Florenzano, Cristian Riveros, Martin Ugarte, Stijn Vansummeren, Domagoj Vrgoc
2018 arXiv   pre-print
Towards this goal, we present a practical evaluation algorithm that allows constant delay enumeration of a spanner's output after a precomputation phase that is linear in the document.  ...  Finally, we study the related problem of counting the number of outputs of a document spanner, providing a fine grained analysis of the classes of document spanners that support efficient enumeration of  ...  Given a language L for document spanners, we say that an enumeration algorithm E for EnumeraterLs has constant delay if E runs in two phases over the input γ P L and d.  ... 
arXiv:1803.05277v1 fatcat:drpcw3t5pvffzklvqylyvj4rnq

Grammars for Document Spanners [article]

Liat Peterfreund
2021 arXiv   pre-print
, without repetitions, with a constant delay between every two consecutive ones.  ...  We propose a new grammar-based language for defining information-extractors from documents (text) that is built upon the well-studied framework of document spanners for extracting structured data from  ...  Freydenberger for the helpful references.  ... 
arXiv:2003.06880v5 fatcat:3sdechswejhgtcjsxpbxqlbana

Constant-Delay Enumeration for Nondeterministic Document Spanners [article]

Antoine Amarilli, Pierre Bourhis, Stefan Mengel, Matthias Niewerth
2020 arXiv   pre-print
size, i.e., constant delay in the document size.  ...  We pose this problem in the setting of enumeration algorithms, where we can first run a preprocessing phase and must then produce the results with a small delay between any two consecutive results.  ...  We thank Rémi Dupré for coding the first implementation of the approach. The authors have been partially supported by the ANR project EQUUS ANR-19-CE48-0019.  ... 
arXiv:2003.02576v3 fatcat:wvfuwth5m5gjzldxtooidncdim

Ranked enumeration of MSO logic on words [article]

Pierre Bourhis, Alejandro Grez, Louis Jachiet, Cristian Riveros
2020 arXiv   pre-print
In the last years, enumeration algorithms with bounded delay have attracted a lot of attention for several data management tasks.  ...  We then demonstrate the generality of our framework which subsumes, for instance, document spanners and regular complex event processing queries and adds ranking to them.  ...  The document spanners' main algorithmic problem is the efficient evaluation of a spanner over a word.  ... 
arXiv:2010.08042v1 fatcat:utxzi646wrfc5oztxhyghml4g4

Efficient Enumeration Algorithms for Annotated Grammars [article]

Antoine Amarilli, Louis Jachiet, Martín Muñoz, Cristian Riveros
2022 arXiv   pre-print
Our first result is an algorithm for unambiguous annotated grammars, which preprocesses the input string in cubic time and enumerates all annotations with output-linear delay.  ...  This improves over Peterfreund's result, which needs quintic time preprocessing to achieve this delay bound.  ...  However, while the algorithm achieves constant-delay, the preprocessing bound is significantly worse than in the case of regular spanners: it is quintic in the document, and exponential in the number of  ... 
arXiv:2201.00549v2 fatcat:hbchqvyjkrfuvhoozd4ktnia5y

Document Spanners for Extracting Incomplete Information: Expressiveness and Complexity [article]

Francisco Maturana, Cristian Riveros, Domagoj Vrgoč
2017 arXiv   pre-print
We also study computational properties of these languages, focusing on the query enumeration problem, as well as satisfiability and containment.  ...  To remedy the situation, we propose to extend information extraction languages with the ability to use mappings, thus allowing us to work with documents which have missing or optional parts.  ...  The authors were supported by the Nucleus Millennium Center for Semantic Web Research grant N120004. Vrgoč was also supported by the FONDECYT project nr. 11160383.  ... 
arXiv:1707.00827v2 fatcat:qmnupjyjavelpairtefdcbnyoq

A Purely Regular Approach to Non-Regular Core Spanners [article]

Markus L. Schmid, Nicole Schweikardt
2021 arXiv   pre-print
The regular spanners (characterised by vset-automata) are closed under the algebraic operations of union, join and projection, and have desirable algorithmic properties.  ...  , arguably still covers the intuitive applications of string equality selections for information extraction and has much better upper complexity bounds of the typical problems in static analysis and query  ...  Acknowledgment We wish to thank the anonymous reviewers of the conference version [20] of this work for their valuable feedback that improved the readability of this paper.  ... 
arXiv:2010.13442v2 fatcat:c5wdkfhanzewzlf5begephbtle

The theory of concatenation over finite models [article]

Dominik D. Freydenberger, Liat Peterfreund
2021 arXiv   pre-print
Not only does FC allow us to obtain new insights and techniques for expressive power and efficient evaluation of document spanners, but it also provides a general framework for logic on words that also  ...  Most noteworthy among these desirable properties are sufficient criteria for efficient model checking, and capturing various complexity classes by adding operators for transitive closures or fixed points  ...  Constant delay algorithms for regular document spanners. In Proc. PODS 2018, pages 165-177, 2018. 28 Theory of Computing Systems, 53(2):159-193, 2013. 30 Dominik D. Freydenberger.  ... 
arXiv:1912.06110v6 fatcat:qs76gsdhxzbrxdlydyl6xkgbcq

Preference-aware integration of temporal data

Bogdan Alexe, Mary Roth, Wang-Chiew Tan
2014 Proceedings of the VLDB Endowment  
algorithm.  ...  In addition to providing algorithms for implementing PRAWN, we study and establish several desirable properties of PRAWN.  ...  Acknowledgements The authors would like to thank Laura Haas, Lucian Popa, and the VLDB reviewers for their valuable feedback.  ... 
doi:10.14778/2735496.2735500 fatcat:gothbc5jebggzho6t225yribn4

On the Expressiveness of Languages for Complex Event Recognition

Alejandro Grez, Cristian Riveros, Martín Ugarte, Stijn Vansummeren, Jean Christoph Jung, Carsten Lutz
2020 International Conference on Database Theory  
Complex Event Recognition (CER for short) has recently gained attention as a mechanism for detecting patterns in streams of continuously arriving event data.  ...  for example requiring sequences of numbers to be increasing.  ...  the n th event of S the set A n (S) is enumerated with constant delay.  ... 
doi:10.4230/lipics.icdt.2020.15 dblp:conf/icdt/GrezRUV20 fatcat:dojn4d63mrc2niiowropnl4qji

Table of contents

2009 2009 17th Mediterranean Conference on Control and Automation  
This paper deals with the problem of delay-dependent stability and stabilization of Takagi-Sugeno (T-S) fuzzy systems with a time-varying delay.  ...  This paper proposes an ant colony optimization algorithm for tuning fuzzy PID controllers. First, the design of typical Takagi-Sugeno (TS) fuzzy PID controllers is investigated.  ...  The hierarchical routing algorithms are often utilized for bandwidth efficiency and power control over Wireless Sensor Networks.  ... 
doi:10.1109/med.2009.5164498 fatcat:bi37lbkbhfaihj7lbc64vvplo4

Dagstuhl Reports, Volume 9, Issue 5, May 2019, Complete Issue [article]

Algorithms to summarise structure in digital images are fundamental to computer vision, image understanding and quantitative analysis.  ...  We thank Philipp Kindermann for collecting the self-introductory slides before the seminar and for assembling this report after the seminar.  ...  Constant-Delay Enumeration for Nondeterministic Document Spanners. ICDT 2019. 5 Amarilli, A., Bourhis, P., Mengel, S., and Niewerth, M.  ... 
doi:10.4230/dagrep.9.5 fatcat:b3zb7ot6zvcgfaa3awtv4zr3oa

Construction and Analysis of Geometric Networks

Marc Benkert
, and Raghavan Dhandapani for interesting discussions.  ...  Acknowledgments We thank Esther Moet and Marc van Kreveld for very helpful comments. We are also very indebted to the anonymous referees, whose comments have helped us a lot.  ...  It consists of two nested loops: the outer loop runs over all input points and specifies a potential flock center.  ... 
doi:10.5445/ir/1000007167 fatcat:otlinnjdsfeffg7nw4x66tavhe
« Previous Showing results 1 — 15 out of 29 results