Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Iris Miliaraki"'
Publikováno v:
ACM Transactions on Database Systems. 40:1-44
Frequent sequence mining is one of the fundamental building blocks in data mining. While the problem has been extensively studied, few of the available techniques are sufficiently scalable to handle datasets with billions of sequences; such large-sca
Publikováno v:
Proceedings of the VLDB Endowment. 6:1810-1821
Temporal annotations of facts are a key component both for building a high-accuracy knowledge base and for answering queries over the resulting temporal knowledge base with high precision and recall. In this paper, we present a temporal-probabilistic
Publikováno v:
WWW
Consider a user who submits a search query "Shakira" having a specific search goal in mind (such as her age) but at the same time willing to explore information for other entities related to her, such as comparable singers. In previous work, a system
Publikováno v:
SWIM
The need for scalable and efficient RDF stores has seen a high demand recently. Many efficient systems, both centralized and distributed, have been proposed. Since a row-oriented output is required by SPARQL, most of the current systems rely on relat
Publikováno v:
SIGMOD Conference
We investigate a new approach to the design of distributed, shared-nothing RDF engines. Our engine, coined "TriAD", combines join-ahead pruning via a novel form of RDF graph summarization with a locality-based, horizontal partitioning of RDF triples
Publikováno v:
Reasoning Web. Reasoning on the Web in the Big Data Era ISBN: 9783319105864
Reasoning Web
Reasoning Web
Probabilistic Databases (PDBs) lie at the expressive intersection of databases, first-order logic, and probability theory. PDBs employ logical deduction rules to process Select-Project-Join (SPJ) queries, which form the basis for a variety of declara
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e7f79f39071c573ba46a5be40104ae8a
https://doi.org/10.1007/978-3-319-10587-1_8
https://doi.org/10.1007/978-3-319-10587-1_8
Publikováno v:
SIGMOD Conference
Frequent sequence mining is one of the fundamental building blocks in data mining. While the problem has been extensively studied, few of the available techniques are sufficiently scalable to handle datasets with billions of sequences; such large-sca
Publikováno v:
Advances in Databases and Information Systems ISBN: 9783642406829
ADBIS
ADBIS
Over the past decade, the two research areas of probabilistic databases and probabilistic programming have intensively studied the problem of making structured probabilistic inference scalable, but — so far — both areas developed almost independe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ae05276753f8d6daae877c3f2ac13cd
https://doi.org/10.1007/978-3-642-40683-6_1
https://doi.org/10.1007/978-3-642-40683-6_1
Publikováno v:
Research Report
ICDE
ICDE
We investigate a novel approach of computing confidence bounds for top-k ranking queries in probabilistic databases with non-materialized views. Unlike related approaches, we present an exact pruning algorithm for finding the top-ranked query answers
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b966eaac1a51823780648529ee1f3d6
https://hdl.handle.net/11858/00-001M-0000-0014-B02F-211858/00-001M-0000-0027-139D-D
https://hdl.handle.net/11858/00-001M-0000-0014-B02F-211858/00-001M-0000-0027-139D-D
Autor:
Iris Miliaraki, Manolis Koubarakis
Publikováno v:
DEBS
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it is considered equally important to deal with value-based predicates. I