Sciweavers

6650 search results - page 375 / 1330
» Mutating database queries
Sort
View
ICDE
2002
IEEE
113views Database» more  ICDE 2002»
16 years 6 months ago
XGRIND: A Query-Friendly XML Compressor
XML documents are extremely verbose since the "schema" is repeated for every "record" in the document. While a variety of compressors are available to address ...
Pankaj M. Tolani, Jayant R. Haritsa
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
16 years 6 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
SIGMOD
2004
ACM
121views Database» more  SIGMOD 2004»
16 years 5 months ago
An Optimal Algorithm for Querying Tree Structures and its Applications in Bioinformatics
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
Hsiao-Fei Liu, Ya-Hui Chang, Kun-Mao Chao
ADC
2007
Springer
107views Database» more  ADC 2007»
15 years 11 months ago
A Processing Model for the Optimal Querying of Encrypted XML Documents in XQuery
XQuery is a powerful and convenient language that is designed for querying the data in XML documents. In this paper, we address how to optimally query encrypted XML documents usin...
Tao-Ku Chang, Gwan-Hwan Hwang
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
15 years 9 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...