Sciweavers

517 search results - page 92 / 104
» Querying Encrypted XML Documents
Sort
View
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 8 months ago
Efficient xml data dissemination with piggybacking
Content-based dissemination of XML data using the publishsubscribe paradigm is an effective means to deliver relevant data to interested data consumers. To meet the performance ch...
Chee Yong Chan, Yuan Ni
DOCENG
2003
ACM
14 years 1 months ago
XPath on left and right sides of rules: toward compact XML tree rewriting through node patterns
XPath [3, 5] is a powerful and quite successful language able to perform complex node selection in trees through compact specifications. As such, it plays a growing role in many ...
Jean-Yves Vion-Dury
DASFAA
2010
IEEE
220views Database» more  DASFAA 2010»
13 years 6 months ago
An Effective Object-Level XML Keyword Search
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet users' search concerns, we study how to effectively r...
Zhifeng Bao, Jiaheng Lu, Tok Wang Ling, Liang Xu, ...
WINET
2002
138views more  WINET 2002»
13 years 8 months ago
An Architecture for Secure Wide-Area Service Discovery
Abstract. The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an int...
Todd D. Hodes, Steven E. Czerwinski, Ben Y. Zhao, ...
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 8 months ago
TASM: Top-k Approximate Subtree Matching
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...