Sciweavers

486 search results - page 43 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
EDBT
2010
ACM
202views Database» more  EDBT 2010»
15 years 8 months ago
Querying trajectories using flexible patterns
The wide adaptation of GPS and cellular technologies has created many applications that collect and maintain large repositories of data in the form of trajectories. Previous work ...
Marcos R. Vieira, Petko Bakalov, Vassilis J. Tsotr...
SIGMOD
2007
ACM
125views Database» more  SIGMOD 2007»
16 years 1 months ago
Optimizing mpf queries: decision support and probabilistic inference
Managing uncertain data using probabilistic frameworks has attracted much interest lately in the database literature, and a central computational challenge is probabilistic infere...
Héctor Corrada Bravo, Raghu Ramakrishnan
SEMWEB
2005
Springer
15 years 7 months ago
Benchmarking Database Representations of RDF/S Stores
Abstract. In this paper we benchmark three popular database representations of RDF/S schemata and data: (a) a schema-aware (i.e., one table per RDF/S class or property) with explic...
Yannis Theoharis, Vassilis Christophides, Gregory ...
216
Voted
SIGMOD
2007
ACM
225views Database» more  SIGMOD 2007»
16 years 1 months ago
From complete to incomplete information and back
Incomplete information arises naturally in numerous data management applications. Recently, several researchers have studied query processing in the context of incomplete informat...
Lyublena Antova, Christoph Koch, Dan Olteanu
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
16 years 2 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami