Sciweavers

736 search results - page 69 / 148
» Answering Imprecise Queries over Web Databases
Sort
View
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 10 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura
SIGMOD
2007
ACM
229views Database» more  SIGMOD 2007»
14 years 9 months ago
Spark: top-k keyword query in relational databases
With the increasing amount of text data stored in relational databases, there is a demand for RDBMS to support keyword queries over text data. As a search result is often assemble...
Yi Luo, Xuemin Lin, Wei Wang 0011, Xiaofang Zhou
TKDE
2008
178views more  TKDE 2008»
13 years 9 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
PODS
2010
ACM
150views Database» more  PODS 2010»
14 years 2 months ago
Understanding queries in a search database system
It is well known that a search engine can significantly benefit from an auxiliary database, which can suggest interpretations of the search query by means of the involved concep...
Ronald Fagin, Benny Kimelfeld, Yunyao Li, Sriram R...
ICDE
2007
IEEE
110views Database» more  ICDE 2007»
14 years 10 months ago
Invalidation Clues for Database Scalability Services
For their scalability needs, data-intensive Web applications can use a Database Scalability Service (DBSS), which caches applications' query results and answers queries on th...
Amit Manjhi, Phillip B. Gibbons, Anastassia Ailama...