Method and system for implementing cross-multi-relation database sorting based on distributed stream calculation
The present invention provides a method for implementing cross-multi-relation database sorting based on distributed stream calculation, comprising: step 1, determining whether an original SQL statement comprises an Order by statement, if yes, transforming the original SQL statement, and encapsulatin...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The present invention provides a method for implementing cross-multi-relation database sorting based on distributed stream calculation, comprising: step 1, determining whether an original SQL statement comprises an Order by statement, if yes, transforming the original SQL statement, and encapsulating and sending a transformed SQL statement, a to-be-sorted field, a required limit quantity, a result truncation quantity, and connection configuration information of a relation database case; and if no, finishing the process; and step 2, sorting the relation database according to a parameter. The present invention further provides a system for implementing cross-multi-relation database sorting based on distributed stream calculation. The present invention avoids a problem of memory overflow when a data routing module responds to a sorting request of an application system. A node quantity of a distributed stream calculation module may be adjusted according to variation of a quantity of relation database cases, and extensibility is high. The present invention further has an advantage of being easy in integration with an existing system. |
---|