Sciweavers

301 search results - page 16 / 61
» Efficient Sketches for the Set Query Problem
Sort
View
VLDB
2004
ACM
112views Database» more  VLDB 2004»
15 years 11 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
IR
2010
14 years 8 months ago
Statistical query expansion for sentence retrieval and its effects on weak and strong queries
The retrieval of sentences that are relevant to a given information need is a challenging passage retrieval task. In this context, the well-known vocabulary mismatch problem arises...
David E. Losada
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
16 years 10 days ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
COMAD
2009
15 years 2 days ago
A Simple and Scalable Filter for XML Streams
XML stream querying problem involves evaluating a given, potentially large, set of query expressions on a continuous stream of XML messages. Since the messages arrive continuously...
Abdul Nizar, G. Suresh Babu, P. Sreenivasa Kumar
PVLDB
2008
108views more  PVLDB 2008»
14 years 10 months ago
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism
Graphs are widely used to model complicated data semantics in many applications. In this paper, we aim to develop efficient techniques to retrieve graphs, containing a given query...
Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu...