Sciweavers

433 search results - page 82 / 87
» Querying and Maintaining Ordered XML Data using Relational D...
Sort
View
CIARP
2009
Springer
13 years 10 months ago
A Brief Index for Proximity Searching
A large number of computer tasks can be modeled as the search for an object near a given query. From multimedia databases to learning algorithms, data mining and pattern recognitio...
Eric Sadit Tellez, Edgar Chávez, Antonio Ca...
BTW
2009
Springer
166views Database» more  BTW 2009»
14 years 2 months ago
TinTO: A Tool for View-Based Analysis of Stock Market Data Streams
: TinTO is an experimental system aiming at demonstrating the usefulness and feasibility of incrementally evaluated SQL queries for analyzing a wide spectrum of data streams. As ap...
Andreas Behrend, Christian Dorau, Rainer Manthey
DKE
2008
109views more  DKE 2008»
13 years 7 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 7 months ago
Quality and efficiency in high dimensional nearest neighbor search
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 12 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer