Sciweavers

151 search results - page 11 / 31
» Efficient memory representation of XML document trees
Sort
View
96
Voted
SIS
2004
15 years 1 months ago
Efficient Tree Search in Encrypted Data
Abstract. Sometimes there is a need to store sensitive data on an untrusted database server. Song, Wagner and Perrig have introduced a way to search for the existence of a word in ...
Richard Brinkman, Ling Feng, Jeroen Doumen, Pieter...
171
Voted
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
15 years 11 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
93
Voted
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
15 years 11 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
105
Voted
IJCNN
2006
IEEE
15 years 5 months ago
A Self-Organising Map Approach for Clustering of XML Documents
— The number of XML documents produced and available on the Internet is steadily increasing. It is thus important to devise automatic procedures to extract useful information fro...
Francesca Trentini, Markus Hagenbuchner, Alessandr...
ICDE
2008
IEEE
113views Database» more  ICDE 2008»
15 years 6 months ago
A rank-rewrite framework for summarizing XML documents
Abstract— With XML becoming a standard for data representation and exchange, we can expect to see large scale repositories and warehouses of XML data. In order for users to under...
Maya Ramanath, Kondreddi Sarath Kumar