Sciweavers

1768 search results - page 139 / 354
» Mining Very Large Databases
Sort
View
IADIS
2003
15 years 4 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é...
150
Voted
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 5 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
16 years 3 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
130
Voted
KDD
2002
ACM
193views Data Mining» more  KDD 2002»
16 years 3 months ago
Query, analysis, and visualization of hierarchically structured data using Polaris
In the last several years, large OLAP databases have become common in a variety of applications such as corporate data warehouses and scientific computing. To support interactive ...
Chris Stolte, Diane Tang, Pat Hanrahan
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 10 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer