Sciweavers

1588 search results - page 153 / 318
» Consistent query answering in databases
Sort
View
ICDE
2006
IEEE
188views Database» more  ICDE 2006»
16 years 6 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
CIKM
2009
Springer
15 years 11 months ago
iPoG: fast interactive proximity querying on graphs
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
Hanghang Tong, Huiming Qu, Hani Jamjoom, Christos ...
141
Voted
INFOSCALE
2007
ACM
15 years 6 months ago
Evaluation study of a distributed caching based on query similarity in a P2P network
Several caching techniques have been used to reduce the bandwidth consumption and to provide faster answers in P2P systems. In this paper, we address the problem of reducing unnec...
Mouna Kacimi, Kokou Yétongnon
SOFSEM
2004
Springer
15 years 10 months ago
Processing XPath Expressions in Relational Databases
Abstract. Research on processing XML documents gained much activity in recent times. XML query languages are mostly based on XPath expressions, which are used to select parts of XM...
Tadeusz Pankowski
ICDM
2006
IEEE
114views Data Mining» more  ICDM 2006»
15 years 11 months ago
Incremental Mining of Frequent Query Patterns from XML Queries for Caching
Existing studies for mining frequent XML query patterns mainly introduce a straightforward candidate generate-and-test strategy and compute frequencies of candidate query patterns...
Guoliang Li, Jianhua Feng, Jianyong Wang, Yong Zha...