Sciweavers

343 search results - page 10 / 69
» Efficient Query Evaluation over Compressed XML Data
Sort
View
SPE
2008
108views more  SPE 2008»
13 years 8 months ago
Effective asymmetric XML compression
The innate verbosity of the Extensible Markup Language remains one of its main weaknesses, especially when large XML documents are concerned. This problem can be solved with the a...
Przemyslaw Skibinski, Szymon Grabowski, Jakub Swac...
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
14 years 10 months ago
Efficiently Evaluating Order Preserving Similarity Queries over Historical Market-Basket Data
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
Reza Sherkat, Davood Rafiei
ADC
2007
Springer
193views Database» more  ADC 2007»
14 years 2 months ago
Optimizing XPath Queries on Streaming XML Data
XML stream processing has recently become popular for many applications such as selective dissemination of information. Several approaches have been proposed and most of them are ...
Keerati Jittrawong, Raymond K. Wong
SIGMOD
2002
ACM
196views Database» more  SIGMOD 2002»
14 years 9 months ago
Storing and querying ordered XML using a relational database system
XML is quickly becoming the de facto standard for data exchange over the Internet. This is creating a new set of data management requirements involving XML, such as the need to st...
Igor Tatarinov, Stratis Viglas, Kevin S. Beyer, Ja...
WWW
2005
ACM
14 years 9 months ago
Answering order-based queries over XML data
Order-based queries over XML data include XPath navigation axes such as following-sibling and following. In this paper, we present holistic algorithms that evaluate such order-bas...
Zografoula Vagena, Nick Koudas, Divesh Srivastava,...