Sciweavers

365 search results - page 35 / 73
» Answering Non-Monotonic Queries in Relational Data Exchange
Sort
View
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 5 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
99
Voted
DL
2000
Springer
162views Digital Library» more  DL 2000»
15 years 4 months ago
Snowball: extracting relations from large plain-text collections
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...
Eugene Agichtein, Luis Gravano
ESA
2008
Springer
94views Algorithms» more  ESA 2008»
15 years 1 months ago
Relative Convex Hulls in Semi-dynamic Subdivisions
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
Mashhood Ishaque, Csaba D. Tóth
IADIS
2003
15 years 1 months ago
Querying Databases and XML Documents: Comparative Study and a New Proposal
XML has become the most useful standard of data interchange in the web and e-business world and there is a large amount of information stored in this format. Nonetheless, a large ...
Ana Fermoso García, María José...
PLDI
1995
ACM
15 years 3 months ago
APT: A Data Structure for Optimal Control Dependence Computation
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Keshav Pingali, Gianfranco Bilardi