Zobrazeno 1 - 10
of 467
pro vyhledávání: '"Tok Wang Ling"'
Publikováno v:
IEEE Transactions on Knowledge and Data Engineering. 33:1439-1452
XML queries can be modeled by twig pattern queries (TPQs) specifying predicates on XML nodes and XPath relationships satisfied between them. A lot of TPQ types have been proposed; this paper takes into account a TPQ model extended by a specification
Publikováno v:
Conceptual Modeling ISBN: 9783030890216
ER
ER
Temporal keyword search enables non-expert users to query temporal relational databases with time conditions. However, aggregates and group-by are currently not supported in temporal keyword search, which hinders querying of statistical information i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4aa836db75550cebf12b48dcc7d6fd9a
https://doi.org/10.1007/978-3-030-89022-3_14
https://doi.org/10.1007/978-3-030-89022-3_14
Publikováno v:
ICDE
Structural XQuery and XPath queries are often modeled by twig pattern queries (TPQs) specifying predicates on XML nodes and structural relationships to be satisfied between them. This paper considers a TPQ model extended by a specification of output
Publikováno v:
2020 IEEE International Conference on Big Data and Smart Computing (BigComp).
Autor:
Tok Wang Ling, Thuy Ngoc Le
Publikováno v:
ACM SIGMOD Record. 45:17-28
Since XML has become a standard for information exchange over the Internet, more and more data are represented as XML. XML keyword search has been attracted a lot of interests because it provides a simple and user-friendly interface to query XML docu
Publikováno v:
Data & Knowledge Engineering. 99:105-125
XML keyword search has attracted a lot of interests with typical search based on lowest common ancestor (LCA). However, in this paper, we show several problems of the LCA-based approaches, including meaningless answers, incomplete answers, duplicated
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319988085
DEXA (1)
DEXA (1)
Querying temporal relational databases is a challenge for non-expert database users, since it requires users to understand the semantics of the database and apply temporal joins as well as temporal conditions correctly in SQL statements. Traditional
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b05e3a1eb57c319a2e585b226d816305
https://doi.org/10.1007/978-3-319-98809-2_22
https://doi.org/10.1007/978-3-319-98809-2_22
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030013905
ER Workshops
ER Workshops
Entity type completion in Knowledge Bases (KBs) is an important and challenging problem. In our recent work, we have proposed a hybrid framework which combines the human intelligence of crowdsourcing with automatic algorithms to address the problem.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a179b1a881cc388cc3c37c9e62762343
https://doi.org/10.1007/978-3-030-01391-2_4
https://doi.org/10.1007/978-3-030-01391-2_4