Sciweavers

4085 search results - page 116 / 817
» Data Services - From Data to Containers
Sort
View
TOIS
2002
97views more  TOIS 2002»
15 years 4 months ago
Burst tries: a fast, efficient data structure for string keys
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
Steffen Heinz, Justin Zobel, Hugh E. Williams
165
Voted
ICDM
2002
IEEE
163views Data Mining» more  ICDM 2002»
15 years 10 months ago
High Performance Data Mining Using the Nearest Neighbor Join
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
Christian Böhm, Florian Krebs
PVLDB
2010
126views more  PVLDB 2010»
15 years 3 months ago
Set Similarity Join on Probabilistic Data
Set similarity join has played an important role in many real-world applications such as data cleaning, near duplication detection, data integration, and so on. In these applicati...
Xiang Lian, Lei Chen 0002
FECS
2009
172views Education» more  FECS 2009»
15 years 2 months ago
Using Interface Inheritance to Structure the Data Structures Course
Traditional instruction in the first data structures course treats object-oriented inheritance and polymorphism as isolated topics if at all. Course organization is an exploration...
Dale Parson, Daniel Spiegel
170
Voted
HICSS
2011
IEEE
183views Biometrics» more  HICSS 2011»
14 years 8 months ago
Optimizing Access across Multiple Hierarchies in Data Warehouses
In enterprise data warehouses, different users in different business units often define their own application specific dimension hierarchies tailor made to their reporting and b...
Lipyeow Lim, Bishwaranjan Bhattacharjee