Sciweavers

517 search results - page 98 / 104
» Querying Encrypted XML Documents
Sort
View
DOCENG
2006
ACM
14 years 1 months ago
Mash-o-matic
Mash-ups extract data fragments from disparate sources, and combine and transform the extracted fragments for display. Currently, mash-up developers tend to employ ad hoc represen...
Sudarshan Murthy, David Maier, Lois M. L. Delcambr...
AINA
2009
IEEE
14 years 17 days ago
A Generic Database Web Service for the Venice Service Grid
This work describes a generic database service for the lightweight Venice Service Grid, which has been developed at the University of Kaiserslautern, Germany. By using Web service...
Michael Koch, Markus Hillenbrand, Paul Müller
CADE
2006
Springer
13 years 11 months ago
Presburger Modal Logic Is PSPACE-Complete
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...
Stéphane Demri, Denis Lugiez
JAPLL
2010
133views more  JAPLL 2010»
13 years 6 months ago
Complexity of modal logics with Presburger constraints
We introduce the extended modal logic EML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as nu...
Stéphane Demri, Denis Lugiez
DASFAA
2007
IEEE
174views Database» more  DASFAA 2007»
14 years 1 months ago
Efficient Holistic Twig Joins in Leaf-to-Root Combining with Root-to-Leaf Way
Finding all the occurrences of a twig pattern on multiple elements in an XML document is a core operation for efficient evaluation of XML queries. Holistic twig join algorithms, Tw...
Guoliang Li, Jianhua Feng, Yong Zhang, Lizhu Zhou