Sciweavers

806 search results - page 54 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
SIGMOD
2004
ACM
123views Database» more  SIGMOD 2004»
14 years 9 months ago
Automatic Categorization of Query Results
Exploratory ad-hoc queries could return too many answers ? a phenomenon commonly referred to as "information overload". In this paper, we propose to automatically catego...
Kaushik Chakrabarti, Surajit Chaudhuri, Seung-won ...
DEBU
2008
125views more  DEBU 2008»
13 years 9 months ago
Querying XML in Timber
In this paper, we describe the TIMBER XML database system implemented at University of Michigan. TIMBER was one of the first native XML database systems, designed from the ground ...
Yuqing Wu, Stelios Paparizos, H. V. Jagadish
JSW
2006
124views more  JSW 2006»
13 years 9 months ago
Dynamic Web Service Calls for Data Integration
Web Services are considered as a dominant paradigm for constructing and composing distributed business application and enabling enterprise-wide interoperability. A peer to peer arc...
Salima Benbernou, Mohand-Said Hacid
VLDB
2007
ACM
124views Database» more  VLDB 2007»
14 years 3 months ago
Ad-hoc Top-k Query Answering for Data Streams
A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k q...
Gautam Das, Dimitrios Gunopulos, Nick Koudas, Niko...
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
13 years 10 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young