Sciweavers

48 search results - page 5 / 10
» Investigations in tree locking for compiled database applica...
Sort
View
FPL
2008
Springer
122views Hardware» more  FPL 2008»
13 years 9 months ago
Mining Association Rules with systolic trees
Association Rules Mining (ARM) algorithms are designed to find sets of frequently occurring items in large databases. ARM applications have found their way into a variety of field...
Song Sun, Joseph Zambreno
DBPL
1991
Springer
66views Database» more  DBPL 1991»
13 years 11 months ago
Rationale and Design of BULK
BULK is a very-high-level persistent programming language and environment for prototyping and implementing database applications. BULK provides sets and sequences as primitive typ...
Steve Rozen, Dennis Shasha
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 1 months ago
XQuery Implementation in a Relational Database System
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...
EUROSYS
2009
ACM
14 years 4 months ago
xCalls: safe I/O in memory transactions
Memory transactions, similar to database transactions, allow a programmer to focus on the logic of their program and let the system ensure that transactions are atomic and isolate...
Haris Volos, Andres Jaan Tack, Neelam Goyal, Micha...
PVLDB
2010
200views more  PVLDB 2010»
13 years 6 months ago
SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
Shijie Zhang, Jiong Yang, Wei Jin