Sciweavers

1992 search results - page 155 / 399
» Implementing sorting in database systems
Sort
View
87
Voted
COLING
1996
15 years 1 months ago
Error-tolerant Tree Matching
This paper presents an efficient algorithm for retrieving from a database of trees, all trees that match a given query tree appro,imately, that is, within a certain error toleranc...
Kemal Oflazer
ADBIS
2004
Springer
153views Database» more  ADBIS 2004»
15 years 5 months ago
Cooperative Transaction Processing between Clients and Servers
Business rules are often implemented as stored procedures in a database server. These procedures are triggered by various clients, but the execution load is fully centralized on th...
Steffen Jurk, Ulf Leser, José-Luis Marzo
106
Voted
BTW
2003
Springer
94views Database» more  BTW 2003»
15 years 5 months ago
The Paradigm of Relational Indexing: a Survey
Abstract: In order to achieve efficient execution plans for queries comprising userdefined data types and predicates, the database system has to be provided with appropriate index ...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DEXAW
2003
IEEE
108views Database» more  DEXAW 2003»
15 years 5 months ago
Electronic Voting Systems: Security Implications of the Administrative Workflow
With the rapid growth of the Internet, online voting appears to be a reasonable alternative to conventional elections and other opinion expressing processes. Current research focu...
Costas Lambrinoudakis, Spyros Kokolakis, Maria Kar...
166
Voted
SIGMOD
2007
ACM
105views Database» more  SIGMOD 2007»
16 years 19 days ago
An XML transaction processing benchmark
XML database functionality has been emerging in "XML-only" databases as well as in the major relational database products. Yet, there is no industry standard XML databas...
Matthias Nicola, Irina Kogan, Berni Schiefer