Sciweavers

2889 search results - page 60 / 578
» Querying Structured Hyperdocuments
Sort
View
126
Voted
JCDCG
2000
Springer
15 years 6 months ago
Volume Queries in Polyhedra
We present a simple and practical data structure for storing a (not necessarily convex) polyhedron P which can, given a query surface S cutting the polyhedron, determine the volume...
John Iacono, Stefan Langerman
147
Voted
VLDB
1997
ACM
165views Database» more  VLDB 1997»
15 years 6 months ago
DataGuides: Enabling Query Formulation and Optimization in Semistructured Databases
In semistructured databases there is no schema fixed in advance. To provide the benefits of a schema in such environments, we introduce DataGuides: concise and accurate structural...
Roy Goldman, Jennifer Widom
PVLDB
2008
115views more  PVLDB 2008»
15 years 2 months ago
XML Structural Summaries
This tutorial introduces the concept of XML Structural Summaries and describes their role within XML retrieval. It covers the usage of those summaries for Database-style query pro...
Mirella Moura Moro, Zografoula Vagena, Vassilis J....
139
Voted
ASIACRYPT
2010
Springer
15 years 20 days ago
Structured Encryption and Controlled Disclosure
We consider the problem of encrypting structured data (e.g., a web graph or a social network) in such a way that it can be efficiently and privately queried. For this purpose, we ...
Melissa Chase, Seny Kamara
202
Voted
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 4 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...