Sciweavers

409 search results - page 57 / 82
» Plan Databases: Model and Algebra
Sort
View
DASFAA
2004
IEEE
169views Database» more  DASFAA 2004»
15 years 3 months ago
Statistic Driven Acceleration of Object-Relational Space-Partitioning Index Structures
Relational index structures, as for instance the Relational Interval Tree or the Linear Quadtree, support efficient processing of queries on top of existing object-relational datab...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
ICSE
2007
IEEE-ACM
15 years 12 months ago
Modeling in Software Engineering
A data model is a plan for building a database and is comparable to an architect's building plans. There are two major methodologies used to create a data model: the EntityRe...
Joanne M. Atlee, Robert B. France, Geri Georg, Ana...
SIGMOD
2008
ACM
136views Database» more  SIGMOD 2008»
15 years 12 months ago
Mining relationships among interval-based events for classification
Existing temporal pattern mining assumes that events do not have any duration. However, events in many real world applications have durations, and the relationships among these ev...
Dhaval Patel, Wynne Hsu, Mong-Li Lee
96
Voted
IUI
2005
ACM
15 years 5 months ago
Building intelligent shopping assistants using individual consumer models
This paper describes an Intelligent Shopping Assistant designed for a shopping cart mounted tablet PC that enables individual interactions with customers. We use machine learning ...
Chad M. Cumby, Andrew E. Fano, Rayid Ghani, Marko ...
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
15 years 4 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