Zobrazeno 1 - 10
of 44
pro vyhledávání: '"V Saxton"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Theory of Computing Systems. 44:590-619
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. We investigate the expressive power provided in this regard by structural recursion. In particular, we show that the combination of ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0cb3fdf31766828cbf877db0dd6ce131
https://doi.org/10.1007/s00224-008-9110-5
https://doi.org/10.1007/s00224-008-9110-5
Publikováno v:
Information Processing & Management. 30:687-709
Traditionally, data models and query languages have provided mechanisms for dealing with sets of objects. Many database applications, however, are list oriented (i.e., deal with collections or aggregates of objects in which ordering is important). Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a1411e94f8a7c0f6aa85b557eefdc9c3
https://doi.org/10.1016/0306-4573(94)90078-7
https://doi.org/10.1016/0306-4573(94)90078-7
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540692690
ICDT
ICDT
XML query languages need to provide some mechanism to inspect and manipulate nodes at all levels of an input tree. In this paper we investigate the expressive power provided in this regard by structural recursion. We show that the combination of vert
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08d18995c23903873639f0c8405634c4
http://hdl.handle.net/1942/7740
http://hdl.handle.net/1942/7740
Autor:
Xiqun Tang, Lawrence V. Saxton
Publikováno v:
Advances in Web-Age Information Management ISBN: 9783540224181
WAIM
WAIM
This paper introduces tree multivalued dependencies (TMVDs) for XML documents by extending multivalued dependencies in relational databases and recent research about tree functional dependencies (TFDs). We show the existence of the TMVDs in XML docum
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::395fbe4988793090cfe85f4d453c9dae
https://doi.org/10.1007/978-3-540-27772-9_36
https://doi.org/10.1007/978-3-540-27772-9_36
Publikováno v:
ICDE
The Tarski algebra, an algebraic foundation for object-based query languages, is presented. While maintaining physical data independence, the Tarski algebra is shown to be both simple and powerful enough to express all reasonable queries. It is shown
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aac1f27b615d8ae57bda65c4508ac22a
https://doi.org/10.1109/icde.1993.344075
https://doi.org/10.1109/icde.1993.344075
Autor:
Lawrence V. Saxton, Tao Guan
Publikováno v:
Fundamentals of Information Systems ISBN: 9781461373384
FMLDO
FMLDO
A new complexity model for web queries is presented in this paper. The novelties of this model are: (1) the communication cost is considered; (2) the complexity of a web query is partitioned into the accessing complexity and the constructing complexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69d4d78e8cd4880051fd5d7cf279efdd
https://doi.org/10.1007/978-1-4615-5137-9_5
https://doi.org/10.1007/978-1-4615-5137-9_5
Publikováno v:
Conceptual Modeling – ER ’98 ISBN: 9783540651895
ER
ER
With the increasing importance of the World Wide Web as an information repository, how to locate documents of interest becomes more and more significant. The current practice is to send keywords to search engines. However, these search engines lack t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2be497c8658a3e91549d75c9b706912
https://doi.org/10.1007/978-3-540-49524-6_9
https://doi.org/10.1007/978-3-540-49524-6_9
Publikováno v:
PODS
We present a language for querying list-based complex objects. The language is shown to express precisely the polynomial-time generic list-object functions. The iteration mechanism of the language is based on a new approach wherein, in addition to th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::42e7dc67ac1e51f203d62bc939f6e9ef
https://doi.org/10.1145/182591.182611
https://doi.org/10.1145/182591.182611