Sciweavers

2635 search results - page 162 / 527
» Algorithms for the Database Layout Problem
Sort
View
128
Voted
SIGMOD
1996
ACM
176views Database» more  SIGMOD 1996»
15 years 8 months ago
The Dangers of Replication and a Solution
: Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up: a ten-fold increase in nodes and traffic gives a thousand fold increase ...
Jim Gray, Pat Helland, Patrick E. O'Neil, Dennis S...
VLDB
1989
ACM
107views Database» more  VLDB 1989»
15 years 8 months ago
Scheduling Real-Time Transactions with Disk Resident Data
Managingtransactionswith real-timerequirements and disk residentdata presentsmany new problems.In thispaperweaddressseveral:How canwe scheduletransactionswith deadlines?How do the...
Robert K. Abbott, Hector Garcia-Molina
DATESO
2010
132views Database» more  DATESO 2010»
15 years 2 months ago
Two-step Modified SOM for Parallel Calculation
This paper presents a simple modification of classic Kohonen network (SOM), which allows parallel processing of input data vectors or partitioning the problem in case of insufficie...
Petr Gajdos, Pavel Moravec
GIS
2006
ACM
16 years 5 months ago
Computing longest duration flocks in trajectory data
Moving point object data can be analyzed through the discovery of patterns. We consider the computational efficiency of computing two of the most basic spatio-temporal patterns in...
Joachim Gudmundsson, Marc J. van Kreveld
152
Voted
IDEAS
2005
IEEE
113views Database» more  IDEAS 2005»
15 years 10 months ago
On the Intersection of XPath Expressions
— XPath is a common language for selecting nodes in an XML document. XPath uses so called path expressions which describe a navigation path through semistructured data. In the la...
Beda Christoph Hammerschmidt, Martin Kempa, Volker...